Dimitrios Hristu-Varsakelis Mechanical Engineering and Institute for Systems Research University of Maryland, College Park

Slides:



Advertisements
Similar presentations
NONLINEAR HYBRID CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois.
Advertisements

TOWARDS a UNIFIED FRAMEWORK for NONLINEAR CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer.
Lecture 8: Three-Level Architectures CS 344R: Robotics Benjamin Kuipers.
Network Utility Maximization over Partially Observable Markov Channels 1 1 Channel State 1 = ? Channel State 2 = ? Channel State 3 = ? Restless.
SSO Bidder’s Conference II
MIT and James Orlin © Game Theory 2-person 0-sum (or constant sum) game theory 2-person game theory (e.g., prisoner’s dilemma)
Properties of State Variables
DYNAMIC POWER ALLOCATION AND ROUTING FOR TIME-VARYING WIRELESS NETWORKS Michael J. Neely, Eytan Modiano and Charles E.Rohrs Presented by Ruogu Li Department.
Venkataramanan Balakrishnan Purdue University Applications of Convex Optimization in Systems and Control.
1 Nonlinear Control Design for LDIs via Convex Hull Quadratic Lyapunov Functions Tingshu Hu University of Massachusetts, Lowell.
Graph Laplacian Regularization for Large-Scale Semidefinite Programming Kilian Weinberger et al. NIPS 2006 presented by Aggeliki Tsoli.
Dimitrios Hristu-Varsakelis Mechanical Engineering and Institute for Systems Research University of Maryland, College Park
Problem Statement Given a control system where components, i.e. plant, sensors, controllers, actuators, are connected via a communication network, design.
*Sponsored in part by the DARPA IT-MANET Program, NSF OCE Opportunistic Scheduling with Reliability Guarantees in Cognitive Radio Networks Rahul.
1 Energy-Efficient localization for networks of underwater drifters Diba Mirza Curt Schurgers Department of Electrical and Computer Engineering.
K.N.Toosi University of Technology 1. 2  The Interconnection of two subsystems.
Chess Review May 11, 2005 Berkeley, CA Closing the loop around Sensor Networks Bruno Sinopoli Shankar Sastry Dept of Electrical Engineering, UC Berkeley.
1 Absolute Stability with a Generalized Sector Condition Tingshu Hu.
Computing Sketches of Matrices Efficiently & (Privacy Preserving) Data Mining Petros Drineas Rensselaer Polytechnic Institute (joint.

CS Dept, City Univ.1 Maximal Lifetime Scheduling for Wireless Sensor Surveillance Networks Prof. Xiaohua Jia Dept. of Computer Science City University.
F.B. Yeh & H.N. Huang, Dept. of Mathematics, Tunghai Univ Nov.8 Fang-Bo Yeh and Huang-Nan Huang Department of Mathematic Tunghai University The 2.
Dynamic Programming Introduction to Algorithms Dynamic Programming CSE 680 Prof. Roger Crawfis.
CONTROL of NONLINEAR SYSTEMS with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Introduction to estimation theory Seoul Nat’l Univ.
Presentation by: H. Sarper
Ch. 6 Single Variable Control
Multiple-Lyapunov Functions for Guaranteeing the Stability of a class of Hybrid Systems.
TUTORIAL on LOGIC-BASED CONTROL Part I: SWITCHED CONTROL SYSTEMS Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng.,
FULL STATE FEEDBAK CONTROL:
Introduction to the Hankel -based model order reduction for linear systems D.Vasilyev Massachusetts Institute of Technology, 2004.
Practical Dynamic Programming in Ljungqvist – Sargent (2004) Presented by Edson Silveira Sobrinho for Dynamic Macro class University of Houston Economics.
Reinforcement Learning Control with Robust Stability Chuck Anderson, Matt Kretchmar, Department of Computer Science, Peter Young, Department of Electrical.
1 Dynamic Programming Andreas Klappenecker [partially based on slides by Prof. Welch]
ESPL 1 Wordlength Optimization with Complexity-and-Distortion Measure and Its Application to Broadband Wireless Demodulator Design Kyungtae Han and Brian.
Advanced Operations Research Models Instructor: Dr. A. Seifi Teaching Assistant: Golbarg Kazemi 1.
Feedback Linearization Presented by : Shubham Bhat (ECES-817)
Chapter 20 1 Overall Objectives of Model Predictive Control 1.Prevent violations of input and output constraints. 2.Drive some output variables to their.
1  The Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
Lecture #14 Computational methods to construct multiple Lyapunov functions & Applications João P. Hespanha University of California at Santa Barbara Hybrid.
1 Decentralized control Sigurd Skogestad Department of Chemical Engineering Norwegian University of Science and Tecnology (NTNU) Trondheim, Norway.
8.4.2 Quantum process tomography 8.5 Limitations of the quantum operations formalism 量子輪講 2003 年 10 月 16 日 担当:徳本 晋
1  Problem: Consider a two class task with ω 1, ω 2   LINEAR CLASSIFIERS.
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
OR Chapter 7. The Revised Simplex Method  Recall Theorem 3.1, same basis  same dictionary Entire dictionary can be constructed as long as we.
1. 2 You should know by now… u The security level of a strategy for a player is the minimum payoff regardless of what strategy his opponent uses. u A.
Large-Scale Matrix Factorization with Missing Data under Additional Constraints Kaushik Mitra University of Maryland, College Park, MD Sameer Sheoreyy.
Chapter 2-OPTIMIZATION G.Anuradha. Contents Derivative-based Optimization –Descent Methods –The Method of Steepest Descent –Classical Newton’s Method.
دانشگاه صنعتي اميركبير دانشكده مهندسي پزشكي استاد درس دكتر فرزاد توحيدخواه بهمن 1389 کنترل پيش بين-دکتر توحيدخواه MPC Stability-2.
NONLINEAR CONTROL with LIMITED INFORMATION Daniel Liberzon Coordinated Science Laboratory and Dept. of Electrical & Computer Eng., Univ. of Illinois at.
CS623: Introduction to Computing with Neural Nets (lecture-12) Pushpak Bhattacharyya Computer Science and Engineering Department IIT Bombay.
Approximation Algorithms based on linear programming.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
CIS 540 Principles of Embedded Computation Spring Instructor: Rajeev Alur
Tools for Decision Analysis: Analysis of Risky Decisions
Computing and Compressive Sensing in Wireless Sensor Networks
Recursive Identification of Switched ARX Hybrid Models: Exponential Convergence and Persistence of Excitation René Vidal National ICT Australia Brian D.O.Anderson.
Chap 9. General LP problems: Duality and Infeasibility
Chapter 6. Large Scale Optimization
Distributed Sensing, Control, and Uncertainty
Feature space tansformation methods
Stability Analysis of Linear Systems
I.4 Polyhedral Theory (NW)
Maths for Signals and Systems Linear Algebra in Engineering Lectures 13 – 14, Tuesday 8th November 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR)
EE5900 Advanced Embedded System For Smart Infrastructure
Maths for Signals and Systems Linear Algebra in Engineering Lecture 6, Friday 21st October 2016 DR TANIA STATHAKI READER (ASSOCIATE PROFFESOR) IN SIGNAL.
I.4 Polyhedral Theory.
Chapter 6. Large Scale Optimization
Chapter 7 Inverse Dynamics Control
Presentation transcript:

Dimitrios Hristu-Varsakelis Mechanical Engineering and Institute for Systems Research University of Maryland, College Park (Joint work with Lei Zhang) Stabilization of Networked Control Systems: Communication and Controller co-design

Research Directions Interaction of Communication and Control (with Lei Zhang) Exploring control and communication as a joint problem. How to design communication and control laws while avoiding the computational complexity that can arise. “Static” vs. “feedback-based” communication patterns for control. From “individual” to “group”-level control (with Cheng Shao) Solving optimal control problems by neighbor-to-neighbor interaction What can groups do that individuals cannot? Free final time, partially-constrained final state problems. The problem of tokenizing robot control (with Sean Andersson) Control laws must be “composed” to solve problems of practical importance in real-world environments (e.g. robot navigation). Control instructions as a means of representing geographical relationships. Language-based navigation under sensor/actuator/environment uncertainty.

... K+2 k+1 k S S S S Optimal control by “local pursuit” Exploring the limits of some biologically- inspired control laws Control with limited communication Tools for co-designing Control and Communication Motion Description Languages Writing hierarchically-composable, machine-independent control programs for hybrid systems Landmark-based navigation / localization

Related Publications (since last year’s meeting) D. Hristu-Varsakelis, “Feedback control with Communication Constraints”, to appear in the Handbook of Networked and Embedded Control Systems, D. Hristu-Varsakelis and W. S. Levine, eds, Birkhauser, Boston, L. Zhang and D. Hristu-Varsakelis, “Stabilization of Networked Control Systems: Communication and Controller co-design”, Subm. to the 2005 American Control Conference L. Zhang and D. Hristu-Varsakelis, “Stabilization of Networked Control Systems under Feedback-based Communication”, Subm. to the 2005 IFAC World Congress. D. Hristu-Varsakelis and W. S. Levine, “A Laboratory Course for Networked Digital Control Systems”, to appear in the IEEE Control Systems Magazine. S. Andersson and D. Hristu-Varsakelis, “Stochastic Language-based Motion Control”, IEEE CDC D. Hristu-Varsakelis, M. Egerstedt, P. S. Krishnaprasad, “On the Structural Complexity of the Motion Description Language MDLe”, IEEE CDC S. Andersson and D. Hristu-Varsakelis, “Language-based Feedback Control using Monte Carlo Sensing ”, subm. to IEEE Conf. on Robotics and Automation, D. Hristu-Varsakelis and C. Shao, “Biologically-inspired optimal control: learning from social insects” to appear in the International Journal of Control. C. Shao and D. Hristu-Varsakelis, “Biologically-inspired optimal control via intermittent cooperation ”, Subm. to the 2005 American Control Conference. C. Shao and D. Hristu-Varsakelis, “Optimal control through biologically inspired pursuit”, Subm. to the 2005 IFAC World Congress

Stabilization of NCS: Modeling Communication Constraints and, due to limited communication. Define an M-to-N communication sequence: a map,  (k): Z  {0,1} M, satisfying ||  (k) || 2 =N, 8 k. Let  (k),  (k), be w m –to-m, and p-to-w p communication sequences, where w m <m, w p <p. Goal: Design a stabilizing controller and pair of communication sequences controller

Stabilization of NCS: Modeling Communication Constraints What to do with sensors/actuators that are not communicating? Hold (ZOH) signals to their value(s) at the time of the last “interruption”. –Communication and Control become tightly coupled. –Computational complexity of stabilization problem is high –Feedback-based communication policies in limited settings (e.g. block- diagonal plant and controller) (see works by Brockett, Hristu & Morgansen, Ishii & Francis, Hristu & Kumar). Alternative: “Ignore” sensors/actuators that are not actively transmitting. –Have the plant (controller) set corresponding actuators (sensor readings) to zero. –This will reduce the complexity (but requires additional processing at the plant, e.g., recognizing which actuators should be turned off). controller

Low-complexity Communication/Controller Co-design From the point of view of the controller, the system is now LTV: controller Plant Without ZOH, the effects of limited communication are very much tractable: We know how to design stabilizing controllers for LTV (e.g. periodic) linear systems, but how should we choose the communication sequences to ensure/preserve stabilizability?

Preserving Reachability under Limited Communication The communication sequence has the effect of selecting columns from. Can we always arrange matters so that I can select n independent columns over any consecutive k f steps? Examine the state evolution over k f steps: where: and

Sequences that Preserve Reachability & Observability There exist integers i, N, and an N-periodic communication sequence under which the plant is reachable in [i,i+l] for any i ( l -step reachable). Constructive algorithm based on the matrix and the number of available input channels, w m [Zhang and Hristu-Varsakelis, ACC 05]. A similar result holds for observability, this time finding a sequence that selects n independent rows from: To stabilize a NCS, select periodic communication sequences  (k),  (k) that preserve reachability and observability, then design a stabilizing feedback controller (and observer, if necessary) for the resulting periodic system. This is always possible if A invertible and (A,B) reachable. Note: Invertibility of A is necessary: for there is no reachability-preserving 3-to-1 sequence.

Example – output feedback stabilization Controller (periodic) Plant Observer (periodic) Plant is 7-step reachable, 7-step observable. Designed a periodic observer and a periodic state feedback controller using standard linear theory (period-2 gain sequences). We constructed 2-periodic input/output sequences

Observer / Controller Design Observer: Controller: Gains: where select  >1 for closed-loop decay rate of (1/  ) k l=7, and

State Evolution

Stabilization under Feedback-based communication K Let controller be static state feedack: In continuous time define an M-to-N communication sequence as  (t): R +  {0,1} M, satisfying ||  (t) || 2 =N, 8 t. Goal: Design the controller K and a feedback-based policy  =  (x,t) in order to stabilize the closed-look system In some cases, it could be advantageous to have the communication sequence depend on the states/outputs as opposed to being defined in advance.

Feedback-based communication cont’d Ignoring “inactive” sensors and actuators gives rise to switched dynamics for the closed-loop system: K and so that where again Again, forgo any ZOH and instead use zero for any sensor/actuator readings that are unavailable due to limited communication

and, with : standard basis vectors in R m, R n. Feedback-based communication cont’d Wlog, suppose that only 1 sensor and 1 actuator can communicate with the controller at any time ( w p = w m =1 ). There are n.m possible closed-loop dynamics: Idea: 1.Design the gain K so that the have a stable convex combination, say 2. Then, at any time, at least one of the n.m communication choices leads to the decrease of a Lyapunov function x T (t)Px(t), i.e. for some (i,j) where: This defines a stabilizing communication policy!

Feedback-based communication cont’d Computing stabilizing a gain & communication policy: 1.Choose any  ij so that. Think of these as the relative amount of attention to be given by the controller to the i-th sensor and j-th actuator. 2. Choose G to place the eigenvalues of 3. Solve for the controller gain K from K ij =  ij G ij where P=P T >0 satisfies 1. Fastest Decay (FD): 2. Weighted Fastest Decay (WFD): Possible communication policies: Denote the switching signal by s(t)=(i(t),j(t)):

Stability under the FD and WFD policies Quadratic Stability under FD / WFD: Choose  ij, K, P as suggested. Then, under the FD or WFD policy, all trajectories of the closed-loop system satisfy, where (because there is always a choice of s(t)=(i(t),j(t)) for which V decreases.) Fastest Decay (FD): Weighted Fastest Decay (WFD):

Stability without chattering FD / WFD can lead to chattering. To avoid this, try to impose a minimum dwell time: Modified FD 0. Choose  0, such that 1. At t=t 0, let (FD policy) 2. Let s(t)=s(t k ) on [t k, t k+1 ), where: Quadratic Stability under Modified FD: Choose  ij, K, P as before. Then, under the Modified FD policy, all trajectories of the closed-loop system satisfy. Moreover, the switching rate is bounded by 1/ , where (because at t k, the decay rate of is at least (by FD), and is bounded above)

Example 1: Using the FD policy We chose to place the eigenvalues of A+BG at: (-5,-6,-4,-3) For a choice of we obtained the controller gains: State Evolution under FD Only 1 of 4 sensors and 1 of 2 actuators can communicate with the controller at any one time (i.e. w p =w m =1.)

Example 1: Time vs. Control effort Notice how the amount of time spent communicating with each actuator can be manipulated by choosing the weights  ij

Optimizing the controller We can choose the weights  ij to achieve various objectives while maintaining stability. Example: avoiding actuator saturation There is a maximum radius r max such that all closed-loop trajectories starting with ||x 0 (0)||<r are guaranteed not to saturate the actuators. Bound for r max depends on M, K, and max (P)/ mi n (P). K depends on  ij – choose them to maximize r max (its upper bound) 1. Choose P to minimize max (P)/ min (P), and/or 2. Scale the rows of K to maximize the region in which we are guaranteed not to saturate, by a factor of  i, where: where K’ i are the rows of the gain matrix K’ obtained when  i j =1/n and  ij =  i /n 8 i=1,…,m, j=1,…,n. Suppose that |u(t) i | < M i for all i=1,…,m To maximize our upper bound for r max

Example – Avoiding saturation by choice of  ij Set P=I, and saturation bounds M 1 =M 2 =5. Apply Modified FD policy. Place eigenvalues of A+BG at [ -1, -1.5] Weights: Gain:

Summary & Conclusions Stabilization of Networked Control Systems (NCS) Reduced complexity of the stabilization problem by “ignoring” sensors/actuators that are not actively communicating, and by forgoing ZOH. The approach makes the selection of controllers and communication sequences tractable and straightforward, compared to when ZOH is used. “Static” communication sequences –Algorithm for selecting periodic sequences that preserve stabilizability. –Controller design using known state-space methods. Feedback-based communication sequences –An algorithm for jointly selecting the controller and communication. –Trade-off between time and control effort.