检索结果-内蒙古大学图书馆

programming approach for fuzzy model-based multiobjective control systems

INTERNATIONAL JOURNAL OF UNCERTAINTY FUZZINESS AND KNOWLEDGE-BASED SYSTEMS 1999年第4期7卷 293-300页

作者： Bien, Z Kang, DO Yang, S Korea Adv Inst Sci & Technol Dept Elect Engn Taejon 305701 South Korea Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47906 USA

Many practical control problems for the complex, uncertain or large-scale plants, need to simultaneously achieve a number of objectives, which may conflict or compete with each other. If the conventional optimization methods are applied to solve these control problems, the solution process may be time-consuming and the resulting solution would often lose its original meaning of optimality. Nevertheless, the human operators usually perform satisfactory results based on their qualitative and heuristic knowledge. In this paper, we investigate the control strategies of the human operators, and propose a fuzzy model-based multi-objective satisfactory controller. We also apply it to the automatic train operation (ATO) system for the magnetically levitated vehicles (MAGLEV).

关键词： multiobjective control system programming approach fuzzy-model based predictive

来源：评论

学校读者我要写书评

暂无评论

A nonlinear programming approach to a very large hydroelectric system optimization

引用

Mathematical programming 1974年第1期6卷 28-41页

作者： Gagnon, C.R. Hicks, R.H. Jacoby, S.L.S. Kowalik, J.S. Boeing Computer Services Inc. Seattle Washington United States Bonneville Power Administration Portland Oregon United States Boeing Computer Services Inc. Seattle Washington United States Sir George Williams University Montreal Canada

A large scale hydroelectric system optimization is considered and solved by using a non-linear programming method. The largest numerical case involves approximately 6 000 variables, 4 000 linear equations, 11 000 linear and nonlinear inequality constraints and a nonlinear objective function. The solution method is based on partial elimination of independent variables by solving linear equations, essentially unconstrained optimization of a compound function that consists of the objective function, nonlinear inequality constraints and part of the linear inequality constraints. The compound function is obtained via penalty formulation. The algorithm takes full advantage of the problem's structure and provides useful solutions for real life problems that, in general, are defined over empty feasible regions. © 1974, The Mathematical programming Society. All rights reserved.

关键词： Objective Function Inequality Constraint Feasible Region programming approach Linear Inequality

来源：评论

学校读者我要写书评

暂无评论

An integer programming approach to a class of combinatorial problems

引用

Mathematical programming 1972年第1期3卷 339-344页

作者： Beale, E.M.L. Tomlin, J.A. Scicon Ltd. London United Kingdom

In this paper, we discuss the solution of a class of modified quadratic assignment problems, with particular reference to an application involving decentralization of a large organization. The main emphasis is on the use of a standard branch and bound mathematical programming system (UMPIRE) and the problem manipulations required to carry this out efficiently. © 1972 The Mathematical programming Society.

关键词： Mathematical Method Mathematical programming Integer programming Assignment Problem programming approach

来源：评论

学校读者我要写书评

暂无评论

A quadratic programming approach to the impulsive loading analysis of rigid plastic structures

引用

Meccanica 1972年第1 Supplement期7卷 45-57页

作者： Capurso, Michele Istituto di Scienza delle Costruzioni Università di Bologna Italy

This paper discusses the dynamic problem of rigid plastic structures subjected to impulsive loading. A couple of "dual" extremum theorems reduces the problem to the optimization of convex quadratic functions subject to linear inequalities and equations: the first theorem takes as variables stress and accelerations, the second accelerations and plastic multiplier rates. The problem is discussed in matrix notation on the basis of finite element discretization of the structure and piecewise linear approximation of the yield surfaces, using some quadratic programming concepts. The procedure is illustrated by a simple numerical example. © 1972 Tamburini Editore s.p.a. Milano.

关键词： Quadratic programming Element Discretization Yield Surface Dynamic Problem programming approach

来源：评论

学校读者我要写书评

暂无评论

Towards an OPC UA Compliant programming approach with Formal Model of Computation for Dynamic Reconfigurable Automation Systems 17

Towards an OPC UA Compliant Programming Approach with Formal...

引用

17th IEEE International Conference on Industrial Informatics (INDIN)

作者： Atmojo, Udayanto Dwi Vyatkin, Valeriy Aalto Univ Dept Elect Engn & Automat Espoo Finland

ISBN: (纸本)9781728129273

This paper proposes Service Oriented SystemJ OPC UA (SOSJ - OPC UA), a service-oriented programming approach which targets dynamic industrial manufacturing systems. An extension of SOSJ, SOSJ - OPC UA utilizes OPC UA standard to introduce service orientation, enable interoperability with different actors in the systems, and compliance with Reference Architecture Model for Industrie 4.0 (RAMI 4.0) which defines OPC UA as the communication standard. The paper begins by describing new concept on the synergy of SOSJ and OPC UA. Then, SOA information exchange mechanisms which utilize OPC UA are defined that enable parties to find each other. SOSJ - OPC UA is then demonstrated in a simple manufacturing example to demonstrate its capability.

关键词： programming approach service-oriented architecture reconfigurable manufacturing formal model of computation OPC UA Industry 4.0 RAMI 4.0

来源：评论

学校读者我要写书评

暂无评论

On the Solution of Revenue- and Network-Constrained Day-Ahead Market Clearing Under Marginal Pricing-Part I: An Exact Bilevel programming approach

On the Solution of Revenue- and Network-Constrained Day-Ahea...

引用

Manchester PowerTech

作者： Ricardo Fernández-Blanco José M. Arroyo Natalia Alguacil Joint Research Center (JRC) - European Commission University of Castilla-La Mancha

ISBN: (纸本)9781509042388

The first of this two-paper series addresses a practical day-ahead auction model, where generation revenue constraints are explicitly incorporated in the problem formulation, as routinely done in several national electricity markets across Europe. The revenue-constrained market-clearing procedure includes the effect of the transmission network, inter-temporal constraints associated with generation scheduling, demand-side bidding, and marginal pricing. This auction design is an instance of price-based market clearing which features two major complicating factors. First, locational marginal prices become decision variables of the optimization process. In addition, producer revenues are formulated as bilinear and highly nonconvex products of power outputs and market-clearing prices. The resulting problem is formulated as a mixed-integer nonlinear bilevel program with bilinear terms for which available solution techniques rely on heuristics, approximations, or modeling simplifications. This paper presents a novel and exact methodology whereby the original problem is recast as an equivalent single-level mixed-integer linear program. As a consequence, finite convergence to optimality is guaranteed and the use of standard commercial software is allowed. The proposed transformation is based on duality theory of linear programming, Karush-Kuhn-Tucker optimality conditions, and integer algebra results. In the second part of this two-paper series, numerical results from several case studies illustrate the effective performance of the proposed solution approach.

关键词： Revenue Network-Constrained programming approach

来源：评论

学校读者我要写书评

暂无评论

INTEGER programming approachES TO TRAVELING SALESMAN PROBLEM

引用

MATHEMATICAL programming 1976年第3期10卷 367-378页

作者： MILIOTIS, P UNIV LONDON LONDONENGLAND

The availability of an LP routine where we can add constraints and reoptimize, makes it possible to adopt an integer programming approach to the travelling-salesman *** with some of the constraints that define the problem we use either a branching process or a cutting planes routine to eliminate fractional solutions. We then test the resulting integer solution against feasibility and if necessary we generate the violated constraints and reoptimize until a “genuine” feasible solution is *** only a small number of the omitted constraints is *** generality of the method and the modest solution times achieved leads us to believe that such an LP approach to other combinatorial problems deserves further consideration.

关键词： Feasible Solution Mathematical Method Integer programming programming approach Solution Time

来源：评论

学校读者我要写书评

暂无评论

Model-predictive dynamic control allocation scheme for reentry vehicles

引用

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS 2007年第1期30卷 100-113页

作者： Luo, Yu Serrani, Andrea Yurkovich, Stephen Oppenheimer, Michael W. Doman, David B. Ohio State Univ Dept Elect & Comp Engn Columbus OH 43210 USA USAF Res Lab Control Design & Anal Branch Wright Patterson AFB OH 45433 USA

Allocation of control authority among redundant control effectors, under hard constraints, is an important component of the inner loop of a reentry vehicle guidance and control system. Whereas existing control allocation schemes generally neglect actuator dynamics, thereby assuming A static relationship between control surface deflections and moments about a three-body axis, in this work a dynamic control allocation scheme is developed that implements a form, of model-predictive control. In the approach proposed here, control allocation is posed as a sequential quadratic programming problem with constraints, which can also be cast into a linear complementarity problem and therefore solved in a finite number of iterations. Accounting directly for nonnegligible dynamics of the actuators with hard constraints, the scheme extends existing algorithms by providing asymptotic tracking of time-varying input commands for this class of applications. To illustrate the effectiveness of the proposed scheme, a high-fidelity simulation for an experimental reusable launch vehicle is used, in which, results are compared with those of static control allocation schemes in situations of actuator failures.

关键词： CONSTRAINED CONTROL ALLOCATION NONLINEAR CONTROL ALLOCATION PIECEWISE-LINEAR FUNCTIONS programming approach STABILITY EFFICIENT X-33

来源：评论

学校读者我要写书评

暂无评论

DISTRIBUTED REAL-TIME CONTROL OF A SPATIAL ROBOT JUGGLER

引用

COMPUTER 1992年第5期25卷 12-24页

作者： RIZZI, AA WHITCOMB, LL KODITSCHEK, DE YALE UNIV ROBOT LABNEW HAVENCT 06520 YALE UNIV ELECT ENGNNEW HAVENCT 06520

The Yale spatial juggler and an emerging set of working principles for the design and implementation of embedded real-time distributed controllers are described. The robot uses a distributed network of transputers to process stereo camera data and control the torque of a three-degree-of-freedom arm to juggle a ball. The juggling algorithm is a direct extension of a novel class of nonlinear feedback controllers, called mirror laws. The algorithm takes the form of a mathematical expression that specifies robot position as a function of the ball's position and velocity. The programming approach, called geometric programming, substitutes event-driven dynamical processes and geometrical transformations for a more syntactically oriented if-then-else approach

关键词： Yale spatial juggler computer vision computerised control distributed control distributed network distributed real-time control embedded real-time distributed controllers event-driven dynamical processes geometric programming geometric programming geometrical transformations juggling algorithm mathematical expression mirror laws mobile robots nonlinear feedback controllers position control programming approach real-time systems robot position robot programming spatial robot juggler stereo camera data syntactically oriented if-then-else approach three-degree-of-freedom arm torque transputers transputers working principles

来源：评论

学校读者我要写书评

暂无评论

Optimal selection of a connected reserve network

引用

OPERATIONS RESEARCH 2006年第2期54卷 379-388页

作者： Önal, H Briers, RA Univ Illinois Dept Agr & Consumer Econ Urbana IL 61801 USA Napier Univ Sch Life Sci Edinburgh EH10 5DT Midlothian Scotland

Spatial considerations are important in conservation reserve design. A particularly important spatial requirement is the connectivity of selected sites. Direct connections between reserve sites increase the likelihood of species persistence by allowing dispersal and colonization of other areas within the network without species having to leave the reserve. The conventional set-covering and maximal-covering formulations of the reserve selection problem assume that species representation is the only criterion in site selection. This approach usually results in a small but highly fragmented reserve, which may not be desirable. We present a linear integer programming framework incorporating spatial contiguity as an additional site selection criterion. An empirical application to a data set on the occurrence of breeding birds in Berkshire, United Kingdom, demonstrates that site connectivity requires a significantly larger reserve. Incorporation of spatial criteria increases the computational complexity of the problem. To overcome this, we use a two-stage procedure where the original sites are aggregated first and an optimum solution is determined for the aggregate sites. Then, site selection is restricted to original sites included in the aggregate solution and a connected reserve is determined. In this particular application the above procedure generated a significantly more efficient reserve than a heuristic selection.

关键词： programming approach SITE SELECTION MOVEMENT CORRIDORS LOCATION PROBLEM CONSERVATION ALGORITHMS LANDSCAPE HABITAT BIRDS OPTIMIZATION

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：