Bert Pluymers Johan Suykens, Bart De Moor Department of Electrotechnical Engineering (ESAT) Research Group SCD-SISTA Katholieke Universiteit Leuven, Belgium.

Slides:



Advertisements
Similar presentations
A Support Vector Method for Optimizing Average Precision
Advertisements

Lecture 24 MAS 714 Hartmut Klauck
Adopt Algorithm for Distributed Constraint Optimization
1 Constraint Satisfaction Problems A Quick Overview (based on AIMA book slides)
Timed Automata.
Evaluation of River Flood Regulation using Model Predictive Control K. U. LEUVEN Patrick Willems Toni Barjas Blanco P.K. Chiang Bart De Moor Jean Berlamont.
Supervisory Control of Hybrid Systems Written by X. D. Koutsoukos et al. Presented by Wu, Jian 04/16/2002.
Zonotopes Techniques for Reachability Analysis Antoine Girard Workshop “Topics in Computation and Control” March 27 th 2006, Santa Barbara, CA, USA
Reachability Analysis for AMS Verification using Hybrid Support Function and SMT- based Method Honghuang Lin, Peng Li Dept. of ECE, Texas A&M University.
Graduate Center/City University of New York University of Helsinki FINDING OPTIMAL BAYESIAN NETWORK STRUCTURES WITH CONSTRAINTS LEARNED FROM DATA Xiannian.
Optimization of thermal processes2007/2008 Optimization of thermal processes Maciej Marek Czestochowa University of Technology Institute of Thermal Machinery.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
All Hands Meeting, 2006 Title: Grid Workflow Scheduling in WOSE (Workflow Optimisation Services for e- Science Applications) Authors: Yash Patel, Andrew.
IAAC International Symposium in Systems & Control, 7-8 October 2013, Technion, Haifa, Israel P-O Gutman: Constrained control of uncertain linear time-invariant.
Centre for Autonomous Systems Petter ÖgrenCAS talk1 A Control Lyapunov Function Approach to Multi Agent Coordination P. Ögren, M. Egerstedt * and X. Hu.
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems Sajid M. Siddiqi Byron Boots Geoffrey J. Gordon Carnegie Mellon University.
Support Vector Machines (SVMs) Chapter 5 (Duda et al.)
Convertibility Verification and Converter Synthesis: Two Faces of the Same Coin Jie-Hong Jiang EE249 Discussion 11/21/2002 Passerone et al., ICCAD ’ 02.
Feasibility, uncertainty and interpolation J. A. Rossiter (Sheffield, UK)
NORM BASED APPROACHES FOR AUTOMATIC TUNING OF MODEL BASED PREDICTIVE CONTROL Pastora Vega, Mario Francisco, Eladio Sanz University of Salamanca – Spain.
Approximation Algorithms
Dynamic lot sizing and tool management in automated manufacturing systems M. Selim Aktürk, Siraceddin Önen presented by Zümbül Bulut.
Efficient Methodologies for Reliability Based Design Optimization
7. Experiments 6. Theoretical Guarantees Let the local policy improvement algorithm be policy gradient. Notes: These assumptions are insufficient to give.
Designing model predictive controllers with prioritised constraints and objectives Eric Kerrigan Jan Maciejowski Cambridge University Engineering Department.
1 Branch and Bound Searching Strategies 2 Branch-and-bound strategy 2 mechanisms: A mechanism to generate branches A mechanism to generate a bound so.
A Constraint Generation Approach to Learning Stable Linear Dynamical Systems Sajid M. Siddiqi Byron Boots Geoffrey J. Gordon Carnegie Mellon University.
1 Computational Learning Theory and Kernel Methods Tianyi Jiang March 8, 2004.
Ant Colony Optimization to Resource Allocation Problems Peng-Yeng Yin and Ching-Yu Wang Department of Information Management National Chi Nan University.
Efficient Methods for Solving Finite Satisfiability Problems in UML Class Diagrams Mira Balaban and Azzam Maraee.
Learning in Feature Space (Could Simplify the Classification Task)  Learning in a high dimensional space could degrade generalization performance  This.
Cardinality & Sorting Networks. Cardinality constraint Appears in many practical problems: scheduling, timetabling etc’. Also takes place in the Max-Sat.
Daniel Kroening and Ofer Strichman Decision Procedures An Algorithmic Point of View Deciding ILPs with Branch & Bound ILP References: ‘Integer Programming’
CSE 425: Industrial Process Control 1. About the course Lect.TuLabTotal Semester work 80Final 125Total Grading Scheme Course webpage:
CONTROL of NONLINEAR SYSTEMS with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
456/556 Introduction to Operations Research Optimization with the Excel 2007 Solver.
Decision Procedures An Algorithmic Point of View
SVM by Sequential Minimal Optimization (SMO)
A Framework for Distributed Model Predictive Control
ENCI 303 Lecture PS-19 Optimization 2
Transformation of Timed Automata into Mixed Integer Linear Programs Sebastian Panek.
A Polynomial Time Approximation Scheme For Timing Constrained Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, Charles J. Alpert** *Dept of Electrical.
Computation of Limit Cycles for Uncertain Nonlinear Fractional-order Systems using Interval Constraint Propagation P. S. V. Nataraj & Rambabu Kalla Systems.
ICML2004, Banff, Alberta, Canada Learning Larger Margin Machine Locally and Globally Kaizhu Huang Haiqin Yang, Irwin King, Michael.
A Faster Approximation Scheme for Timing Driven Minimum Cost Layer Assignment Shiyan Hu*, Zhuo Li**, and Charles J. Alpert** *Dept of ECE, Michigan Technological.
1 Prune-and-Search Method 2012/10/30. A simple example: Binary search sorted sequence : (search 9) step 1  step 2  step 3  Binary search.
Constrained Control of Power Converters Veaceslav Spinu Supervisor: prof.dr.ir. P.P.J. van den Bosch Co-supervisor: dr. M. Lazar Eindhoven University of.
A dynamic optimization model for power and performance management of virtualized clusters Vinicius Petrucci, Orlando Loques Univ. Federal Fluminense Niteroi,
Reinforcement Learning Control with Robust Stability Chuck Anderson, Matt Kretchmar, Department of Computer Science, Peter Young, Department of Electrical.
Identification and Estimation of the Influential Parameters in Bioreaction Systems Mordechai Shacham Ben Gurion University of the Negev Beer-Sheva, Israel.
On Finding All Minimally Unsatisfiable Subformulas Mark Liffiton and Karem Sakallah University of Michigan {liffiton, June 21, 2005.
Chapter 2) CSP solving-An overview Overview of CSP solving techniques: problem reduction, search and solution synthesis Analyses of the characteristics.
Primbs1 Receding Horizon Control for Constrained Portfolio Optimization James A. Primbs Management Science and Engineering Stanford University (with Chang.
1.2 Guidelines for strong formulations  Running time for LP usually depends on m and n ( number of iterations O(m), O(log n)). Not critically depend on.
A comparative approach for gene network inference using time-series gene expression data Guillaume Bourque* and David Sankoff *Centre de Recherches Mathématiques,
A Fully Polynomial Time Approximation Scheme for Timing Driven Minimum Cost Buffer Insertion Shiyan Hu*, Zhuo Li**, Charles Alpert** *Dept of Electrical.
Water resources planning and management by use of generalized Benders decomposition method to solve large-scale MINLP problems By Prof. André A. Keller.
Computational Approach for Adjudging Feasibility of Acceptable Disturbance Rejection Vinay Kariwala and Sigurd Skogestad Department of Chemical Engineering.
Support Vector Machines (SVMs) Chapter 5 (Duda et al.) CS479/679 Pattern Recognition Dr. George Bebis.
Optimal Acceleration and Braking Sequences for Vehicles in the Presence of Moving Obstacles Jeff Johnson, Kris Hauser School of Informatics and Computing.
Signal processing and Networking for Big Data Applications: Lecture 9 Mix Integer Programming: Benders decomposition And Branch & Bound NOTE: To change.
FORA: Simple and Effective Approximate Single­-Source Personalized PageRank Sibo Wang, Renchi Yang, Xiaokui Xiao, Zhewei Wei, Yin Yang School of Information.
Trellis Codes With Low Ones Density For The OR Multiple Access Channel
Chapter 6. Large Scale Optimization
Beijing University of Aeronautics & Astronautics
Alan Kuhnle*, Victoria G. Crawford, and My T. Thai
Ian C. Wong and Brian L. Evans ICASSP 2007 Honolulu, Hawaii
1.2 Guidelines for strong formulations
1.2 Guidelines for strong formulations
Presentation transcript:

Bert Pluymers Johan Suykens, Bart De Moor Department of Electrotechnical Engineering (ESAT) Research Group SCD-SISTA Katholieke Universiteit Leuven, Belgium Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Set Invariance An efficient tool for constrained control

1 Overview Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Motivation Set invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ.,

2 Constrained control ? Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., © Copyright Ipcos N.V. Physical constraints on inputs and outputs Imposed (safety, environmental, economical) constraints

3 Constraint satisfaction Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Car = system(position, speed = system state) Driver = controller(gas, brake, steering wheel = inputs) Road = constraint instantaneous constraint satisfaction ≠ ‘dynamic’ constraint satisfaction 120 km/h 10 m

4 “Given an autonomous dynamical system, then a set is (positive) invariant if it is guaranteed that if the current state lies within, all future states will also lie within.” Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., not invariant invariant Set Invariance

5 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Set Invariance Useful tool for analysis of controllers for constrained systems Example : – linear system – linear controller – state constraints ‘feasible region’ of closed loop system

6 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Set Invariance Consider an autonomous time-invariant system as defined previously A set is … … feasible iff Problem : Given an autonomous dynamical system subject to state constraints, find the feasible invariant set of maximal size. … invariant iff

7 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Given an LTI system subject to linear constraints then the largest size feasible invariant set can be found as with a finite integer. Invariant sets for LTI systems (Gilbert et al.,1991, IEEE TAC) is constructed by simple forward prediction can be proven to be the largest feasible invariant set is called the Maximal Admissible Set (MAS) Given an LTI system subject to linear constraints then the largest size feasible invariant set can be found as with a finite integer. Invariant sets for LTI systems (Gilbert et al.,1991, IEEE TAC) is constructed by simple forward prediction can be proven to be the largest feasible invariant set is called the Maximal Admissible Set (MAS)

8 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Linear Parameter-Varying state space models with polytopic uncertainty description LPV systems

9 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., LTI (L=1,n=2) LPV (L>1, e.g. 2, n=2) Straightforward extension towards LPV systems ?

10 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Ellipsoidal invariant sets for LPV systems (Kothare et al.,1996, Automatica) Constructed by solving semi-definite program (SDP) Conservative with respect to constraints

11 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Reformulated invariance condition (Pluymers et al., 2005, submitted to IEEE TAC) A set is invariant with respect to a system defined by iff with Sufficient condition :

12 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Algorithm (Pluymers et al., 2005, submitted to IEEE TAC) Initialize iteratively add constraints from to until Advantages : in step 2 only ‘significant’ constraints are added to : significant insignificant

13 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Algorithm (Pluymers et al., 2005, submitted to IEEE TAC) Advantages : prediction tree never explicitly constructed given a polyhedral set, it is straightforward to calculate : Initialize iteratively add constraints from to until

14 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Algorithm (Pluymers et al., 2005, submitted to IEEE TAC) 1.Initialize 2.Set 3.For each check whether constraint is significant with respect to. If significant, add the constraint to 4.Set 5.If go to step 3., otherwise exit and return Resulting set can be proven to satisfy and is feasible due to step 1.

15 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Garbage collection (Pluymers et al., 2005, submitted to IEEE TAC) Constraints added in previous iterations can become redundant with respect to the other constraints. Garbage collection : removal of redundant constraints. iteration 1 iteration 2 iteration 3iteration 4

16 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Consider an LPV system with L=2 : with feedback controller and subject to constraints

17 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Initialization

18 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Iteration 10

19 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Iteration 10 + garbage collection

20 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Iteration 20

21 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Iteration 20 + garbage collection

22 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Final Result

23 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Final Result

24 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complexity Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Example Final Result

25 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Scalability Efficient algorithm formulation through exploitation of structure of invariant set. Consecutive Linear Programming → with the number of constraints However : typically epx.(dimension) dim=3, n c = 24 dim=4, n c = 47 dim=5, n c = 86dim=6, n c = 158

26 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., ‘Branching’

27 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Constraint tightening In case of branch splitting : tighten one constraint in order to make the other redundant

28 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Scalability revisited dim=3, n c =17 dim=4, n c =24 dim=5, n c =37 dim=6, n c =52

29 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Test Case 2-dimensional projection of a 62-dimensional invariant set for the control of a chemical system Number of constraints : 642

30 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Test Case 2-dimensional projection of a 62-dimensional invariant set for the control of a chemical system Ellipsoidal invariant set significantly smaller

31 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Conclusion Invariant sets useful tools for characterization of feasible regions Efficient algorithm for the construction of ‘robust’ invariant sets for LPV systems Improved scaling behavior for high-dimensional systems The odds have turned against ellipsoidal invariant sets…

32 Set Invariance – An Efficient Tool for Constrained Control Overview Motivation Set Invariance MAS for LPV systems Reduced Complex. Sets Open Research Issues Signal processing Identification System Theory Automation Sde Boker workshop on Linear Systems Theory, 13 Sept. 2005, Ben Gurion Univ., Open research issues upper / lower bounds to achievable complexity reduction Robustness with respect to additive disturbances Minimal admissable sets Reduced complexity control-invariant sets Various other types of systems : PWA, Hybrid, NL

33 Thank you !!! you !!!