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

Real-Time Suboptimal Model Predictive Control Using a Combination of Explicit MPC and Online Optimization

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2011年第7期56卷 1524-1534页

作者： Zeilinger, Melanie Nicole Jones, Colin Neil Morari, Manfred ETH Automat Control Lab CH-8092 Zurich Switzerland

Limits on the storage space or the computation time restrict the applicability of model predictive controllers (MPC) in many real problems. Currently available methods either compute the optimal controller online or derive an explicit control law. In this paper we introduce a new approach combining the two paradigms of explicit and online MPC to overcome their individual limitations. The algorithm computes a piecewise affine approximation of the optimal solution that is used to warm-start an active set linear programming procedure. A preprocessing method is introduced that provides hard real-time execution, stability and performance guarantees for the proposed controller. By choosing a combination of the quality of the approximation and the number of online active set iterations the presented procedure offers a tradeoff between the warm-start and online computational effort. We show how the problem of identifying the optimal combination for a given set of requirements on online computation time, storage and performance can be solved. Finally, we demonstrate the potential of the proposed warm-start procedure on numerical examples.

关键词： linear systems model predictive control (MPC) parametric linear programming real-time MPC

来源：评论

学校读者我要写书评

暂无评论

DEA-type models for designing optimal systems and determining optimal budgets

引用

MATHEMATICAL AND COMPUTER MODELLING 2011年第11-12期54卷 2645-2658页

作者： Wei, Quanling Chang, Tsung-Sheng Renmin Univ China Inst Operat Res & Math Econ Beijing Peoples R China Natl Dong Hwa Univ Grad Inst Logist Management Taipei Taiwan

This study intends to develop easy-to-implement and effective approaches to help decision makers cope with the challenges of designing their optimal systems, and determine the corresponding optimal budgets. The approaches are realized by constructing optimal system design (OSD) data envelopment analysis (DEA) models that build on the concepts and techniques of DEA, de novo programming and parametric linear programming with a parametric right-hand side. The proposed models explicitly take the important issue of congestion in system design into account. Therefore, the OSD DEA models can help decision makers not only optimally design their systems, but also determine their optimal budgets. Numerical examples are used to evaluate the strengths of the proposed models. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Data envelopment analysis De novo programming parametric linear programming Congestion Budget Resource allocation

来源：评论

学校读者我要写书评

暂无评论

Graphs of transportation polytopes

引用

JOURNAL OF COMBINATORIAL THEORY SERIES A 2009年第8期116卷 1306-1325页

作者： De Loera, Jesus A. Kim, Edward D. Onn, Shmuel Santos, Francisco Univ Calif Davis Dept Math Davis CA 95616 USA Technion Israel Inst Technol IL-32000 Haifa Israel Univ Cantabria E-39005 Santander Spain

This paper discusses properties of the graphs of 2-way and 3-way transportation polytopes, in particular, their possible numbers of vertices and their diameters. Our main results include a quadratic bound on the diameter of axial 3-way transportation polytopes and a catalogue of non-degenerate transportation polytopes of small sizes. The. catalogue disproves five conjectures about these polyhedra stated in the monograph by Yemelichev et al. (1984). It also allowed us to discover some new results. For example, we prove that the number of vertices of an in x n transportation polytope is a multiple of the greatest common divisor of in and n. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Hirsch conjecture parametric linear programming Polytope diameter Transportation polytopes

来源：评论

学校读者我要写书评

暂无评论

Multiparametric linear programming for Control

引用

第二十七届中国控制会议

作者： Morari M. Jones C.N. Zeilinger M.N. Bari M. Automatic Control Lab ETH ZurichPhysikstrasse 3ETL I28CH-8092 ZurichSwitzerland

ISBN: (纸本)9787811243901

Constrained finite time optimal control problems can be expressed as mathematical programs parameterized by the current state of the system:the so-called multi-parametric *** problems have received a great deal of attention in the control community during the last few years because solving the parametric program is equivalent to synthesizing the optimal state-feedback *** many cases of interest,the resulting synthesized controllers are simple piecewise-affine functions,which enables receding horizon control to be used not only in slowly sampled systems requiring powerful computers but now also in high-speed embedded *** primary limitation of these optimal’explicit solutions’is that the complexity can grow quickly with problem *** this talk I will introduce new methods to compute approximate explicit and online control laws that can trade-off time and space complexity against sub-optimality while providing guarantees of stability and feasibility.

关键词： parametric linear programming Approximation Explicit model predictive control

来源：评论

学校读者我要写书评

暂无评论

Multiparametric linear programming with applications to control

引用

EUROPEAN JOURNAL OF CONTROL 2007年第2-3期13卷 152-170页

作者： Jones, C. N. Baric, M. Morari, M. ETH Automat Control Lab Zurich Switzerland

parametric programming has received a lot of attention in the control literature in the past few years because model predictive controllers (MPC) can be posed in a parametric framework and hence pre-solved offline, resulting in a significant decrease in on-line computation effort. In this paper we survey recent work on parametric linear programming (pLP) from the point of view of the control engineer. We identify three types of algorithms, two arising from standard convex hull paradigms and one from a geometric intuition, and classify all currently proposed methods tinder these headings. Through this classification, we identify a third standard convex hull approach that offers significant potential for approximation of pLPs for the purpose of control. We present the resulting algorithm, based on the beneath/beyond paradigm, that computes low-complexity approximate controllers that guarantee stability and feasibility.

关键词： parametric linear programming approximation explicit model predictive control

来源：评论

学校读者我要写书评

暂无评论

Multiparametric linear programming with applications to control

Multiparametric linear programming with applications to cont...

引用

44th IEEE Conference on Decision Control/European Control Conference (CCD-ECC)

作者： Jones, C. N. Baric, M. Morari, M. ETH Automat Control Lab Zurich Switzerland

关键词： parametric linear programming approximation explicit model predictive control

来源：评论

学校读者我要写书评

暂无评论

A hybrid clustering algorithm

引用

COMPUTERS & OPERATIONS RESEARCH 2007年第11期34卷 3255-3269页

作者： Osei-Bryson, Kweku-Muata Inniss, Tasha R. Virginia Commonwealth Univ Dept Informat Syst Richmond VA 23284 USA Virginia Commonwealth Univ Informat Syst Res Inst Richmond VA 23284 USA Spelman Coll Dept Math Atlanta GA 30314 USA

Clustering attempts to partition a dataset into a meaningful set of mutually exclusive clusters. It is known that sequential clustering algorithms can give optimal partitions when applied to an ordered set of objects. In this technical note, we explore how this approach could be generalized to partition datasets in which there is no natural sequential ordering of the objects. As such, it extends the application of sequential clustering algorithms to all sets of objects. (C) 2006 Elsevier Ltd. All rights reserved.

关键词： clustering segmentation sequential partitioning parametric linear programming spectral analysis

来源：评论

学校读者我要写书评

暂无评论

Applications of sequential set partitioning: a set of technical information systems problems

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2006年第5期34卷 492-500页

作者： Osei-Bryson, KM Joseph, A Virginia Commonwealth Univ Dept Informat Syst Richmond VA 23284 USA Virginia Commonwealth Univ Sch Business Informat Syst Res Inst Richmond VA 23284 USA Univ Miami Sch Business Adm Dept Management Sci Coral Gables FL 33124 USA

Many problems that appear in different contexts are conceptually similar and so are amenable to solution by a common technique. Three such technical Information Systems (IS) problems are: (1) segmentation of computer programs;(2) attribute discretization for decision tree induction;and (3) design of hash tables in database systems. In this paper we show how each of these seemingly different problems can be formulated as a sequential (set) partitioning problem, and solved using a parametric linear programming (LP) procedure. This approach provides optimal solutions unlike previous solution approaches which were either greedy heuristics or limited to solving only a specific problem situation. Given the likelihood that other applications of the sequential partitioning problem exist in IS, the material presented here could be useful to other researchers in formulating the problem at an appropriate level of abstraction so that available optimal solution approaches can be identified. In addition to providing a common solution method, parametric LP frees the user from having to make premature decisions regarding the number of groups for the partition, and this decision can be delayed post solution. (c) 2005 Elsevier Ltd. All rights reserved.

关键词： program segmentation attribute discretization knowledge discovery concurrency control lock tables parametric linear programming

来源：评论

学校读者我要写书评

暂无评论

Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications

引用

JOURNAL OF COMBINATORIAL OPTIMIZATION 2005年第1期9卷 69-90页

作者： Chen, DZ Daescu, O Dai, Y Katoh, N Wu, XD Xu, JH Univ Notre Dame Dept Comp Sci & Engn Notre Dame IN 46556 USA Univ Texas Dept Comp Sci Richardson TX 75080 USA Univ Illinois Dept Bioengn MC 063 Chicago IL 60607 USA Kyoto Univ Grad Sch Engn Dept Architecture & Architectural Syst Nishikyo Ku Kyoto Japan Univ Texas Pan Amer Dept Comp Sci Edinburg TX 78541 USA SUNY Buffalo Dept Comp Sci & Engn Buffalo NY 14260 USA

This paper presents an improved algorithm for solving the sum of linear fractional functions (SOLF) problem in 1-D and 2-D. A key subproblem to our solution is the off-line ratio query (OLRQ) problem, which asks to find the optimal values of a sequence of m linear fractional functions (called ratios), each ratio subject to a feasible domain defined by O(n) linear constraints. Based on some geometric properties and the parametric linear programming technique, we develop an algorithm that solves the OLRQ problem in O((m+n)log (m+n)) time. The OLRQ algorithm can be used to speed up every iteration of a known iterative SOLF algorithm, from O(m(m+n)) time to O((m+n)log (m+n)), in 1-D and 2-D. Implementation results of our improved 1-D and 2-D SOLF algorithm have shown that in most cases it outperforms the commonly-used approaches for the SOLF problem. We also apply our techniques to some problems in computational geometry and other areas, improving the previous results.

关键词： combinatorial optimization computational geometry sum of linear fractional functions parametric linear programming robustness

来源：评论

学校读者我要写书评

暂无评论

Duality in fuzzy multi-criteria and multi-constraint level linear programming: a parametric approach

引用

FUZZY SETS AND SYSTEMS 2002年第3期132卷 335-346页

作者： Zhong, YH Shi, Y Univ Nebraska Coll Informat Sci & Technol Omaha NE 68182 USA SW Petr Inst Dept Comp Sci Sichuan 637001 Peoples R China

This paper presents a parametric approach for duality in fuzzy multi-criteria and multi-constraint level linear programming ((MCLP)-L-2) which extends fuzzy linear programming approaches. First, the MC2-simplex method is used to solve the crisp prima-dual (MCLP)-L-2 pair and then, through these crisp formulations, separate membership functions are constructed for fuzzy primal and dual program by considering the corresponding primal and dual decisions. For each program, a set of fuzzy potential solutions is determined in terms of the membership function and the related optimal solution with a certain range of decision parameters. Finally, using the primal and dual membership functions, a fuzzy weak duality function is obtained for any pair of primal and dual fuzzy potential solutions. (C) 2002 Elsevier Science B.V. All rights reserved.

关键词： multi-criteria linear programming multi-criteria and multi-constraint level linear programming fuzzy linear programming parametric linear programming duality

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：