Verifying safety of interconnected passive systems using SOS programming

We consider a network of interconnected dynamical subsystems with a state-space safety constraint and propose a verification technique that constructs a (robustly) invariant set verifying safety. The invariant set is a sublevel set of a Lyapunov function constructed from local storage functions for each subsystem. Our approach requires only knowledge of a local passivity property for each subsystem and the static interconnection matrix for the network, and we pose the safety verification as a sum-of-squares (SOS) feasibility problem. We consider first the case when, in the absence of disturbance, the unique equilibrium of the network is known. We then extend these results to the case when the equilibrium of the networked system is unknown.

[1]  George J. Pappas,et al.  Stochastic safety verification using barrier certificates , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[2]  Murat Arcak,et al.  Diagonal Stability on Cactus Graphs and Application to Network Stability Analysis , 2011, IEEE Transactions on Automatic Control.

[3]  Tansu Alpcan,et al.  Power Control for Multicell CDMA Wireless Networks: A Team Optimization Approach , 2005, WiOpt.

[4]  George H. Hines,et al.  Equilibrium-independent passivity: A new definition and numerical certification , 2011, Autom..

[5]  M. Areak,et al.  Passivity as a design tool for group coordination , 2006, 2006 American Control Conference.

[6]  E. Kaszkurewicz,et al.  Matrix diagonal stability in systems and computation , 1999 .

[7]  Alexandre M. Bayen,et al.  A time-dependent Hamilton-Jacobi formulation of reachable sets for continuous dynamic games , 2005, IEEE Transactions on Automatic Control.

[8]  Eduardo D. Sontag,et al.  Stability certification of large scale stochastic systems using dissipativity , 2012, Autom..

[9]  Pravin Varaiya,et al.  Computation of Reach Sets for Dynamical Systems , 2010 .

[10]  Ufuk Topcu,et al.  Local stability analysis using simulations and sum-of-squares programming , 2008, Autom..

[11]  Antoine Girard,et al.  Approximation Metrics for Discrete and Continuous Systems , 2006, IEEE Transactions on Automatic Control.

[12]  A. Papachristodoulou,et al.  A network decomposition approach for efficient sum of squares programming based analysis , 2010, Proceedings of the 2010 American Control Conference.

[13]  P. Moylan,et al.  Stability criteria for large-scale systems , 1978 .

[14]  John T. Wen,et al.  A unifying passivity framework for network flow control , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[15]  Franco Blanchini,et al.  Set invariance in control , 1999, Autom..

[16]  Fabian R. Wirth,et al.  Robustness Analysis of Domains of Attraction of Nonlinear Systems , 1998 .

[17]  Russ Tedrake,et al.  Safety verification of reactive controllers for UAV flight in cluttered environments using barrier certificates , 2012, 2012 IEEE International Conference on Robotics and Automation.

[18]  Mathukumalli Vidyasagar,et al.  Input-Output Analysis of Large-Scale Interconnected Systems , 1981 .

[19]  Ryan Feeley,et al.  Some controls applications of sum of squares programming , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[20]  Olivier Bournez,et al.  Approximate Reachability Analysis of Piecewise-Linear Dynamical Systems , 2000, HSCC.

[21]  Eduardo D. Sontag,et al.  Diagonal stability of a class of cyclic systems and its connection with the secant criterion , 2006, Autom..

[22]  P. Varaiya,et al.  Ellipsoidal techniques for reachability analysis: internal approximation , 2000 .

[23]  P. Parrilo.  Structured semidefinite programs and semialgebraic geometry methods in robustness and optimization , 2000 .

[24]  A. Packard,et al.  Stability Region Analysis Using Simulations and Sum-of-Squares Programming , 2007, 2007 American Control Conference.