Set theory based condition in LMI form for network topology preservation for decentralized control

Connectivity preservation of the interconnection network is an essential ingredient in decentralized control. This paper focuses on the preservation of a given network topology which ensures the connectivity. We consider a networked system with a discrete dynamics in which two subsystems are able to communicate if an algebraic relation between their states is satisfied. The connected subsystems are called neighbours. The subsystems updates their state in a decentralized manner by taking into account their neighbours state. Each connection is preserved as far as the algebraic relation is verified. The objective of the proposed set theory based control law is to keep the state of each subsystem in a specific domain that ensures the algebraic constraint satisfaction. The resulting control design reduces to the solution of convex problems involving Linear Matrix Inequalities (LMI), then easily solvable. Beside the network preservation, the global coordination may be imposed by adding supplementary constraints in the control design.

[1]  Ιωαννησ Τσιτσικλησ,et al.  PROBLEMS IN DECENTRALIZED DECISION MAKING AND COMPUTATION , 1984 .

[2]  Stephen P. Boyd,et al.  Randomized gossip algorithms , 2006, IEEE Transactions on Information Theory.

[3]  G. Basile,et al.  Controlled and conditioned invariant subspaces in linear system theory , 1969 .

[4]  Ruggero Carli,et al.  Communication constraints in the average consensus problem , 2008, Autom..

[5]  H. Witsenhausen.  Sets of possible states of linear systems given perturbed observations , 1968 .

[6]  E. Yaz.  Linear Matrix Inequalities In System And Control Theory , 1998, Proceedings of the IEEE.

[7]  H. Witsenhausen.  A minimax control problem for sampled linear systems , 1968 .

[8]  Asuman E. Ozdaglar,et al.  Distributed Subgradient Methods for Multi-Agent Optimization , 2009, IEEE Transactions on Automatic Control.

[9]  F. Schweppe,et al.  Control of linear dynamic systems with set constrained disturbances , 1971 .

[10]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[11]  Randal W. Beard,et al.  Consensus seeking in multiagent systems under dynamically changing interaction topologies , 2005, IEEE Transactions on Automatic Control.

[12]  G. Basile,et al.  Controlled and conditioned invariants in linear system theory , 1992 .

[13]  E. Gilbert,et al.  Theory and computation of disturbance invariant sets for discrete-time linear systems , 1998 .

[14]  Reza Olfati-Saber,et al.  Flocking for multi-agent dynamic systems: algorithms and theory , 2006, IEEE Transactions on Automatic Control.

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

[16]  John N. Tsitsiklis,et al.  On Krause's Multi-Agent Consensus Model With State-Dependent Connectivity , 2008, IEEE Transactions on Automatic Control.

[17]  Antoine Girard,et al.  Sufficient conditions for flocking via graph robustness analysis , 2010, 49th IEEE Conference on Decision and Control (CDC).

[18]  Luc Moreau,et al.  Stability of multiagent systems with time-dependent communication links , 2005, IEEE Transactions on Automatic Control.

[19]  F. Blanchini.  Ultimate boundedness control for uncertain discrete-time systems via set-induced Lyapunov functions , 1994, IEEE Trans. Autom. Control..

[20]  R. Schneider.  Convex Bodies: The Brunn–Minkowski Theory: Minkowski addition , 1993 .

[21]  R. Tyrrell Rockafellar,et al.  Convex Analysis , 1970, Princeton Landmarks in Mathematics and Physics.

[22]  David Q. Mayne,et al.  Constrained model predictive control: Stability and optimality , 2000, Autom..

[23]  F. Schweppe.  Recursive state estimation: Unknown but bounded errors and system inputs , 1967 .

[24]  K. Ball.  CONVEX BODIES: THE BRUNN–MINKOWSKI THEORY , 1994 .

[25]  Yasushi Hada,et al.  Constrained Model Predictive Control , 2006 .

[26]  Jie Lin,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2003, IEEE Trans. Autom. Control..

[27]  Rainer Hegselmann,et al.  Opinion dynamics and bounded confidence: models, analysis and simulation , 2002, J. Artif. Soc. Soc. Simul..

[28]  F. L. Chernousko.  Optimal Ellipsoidal Estimation of Dynamic Systems Subject to Uncertain Disturbances , 2002 .

[29]  D. Bertsekas.  Infinite time reachability of state-space regions by using feedback control , 1972 .

[30]  J. Norton,et al.  State bounding with minimal volume ellipsoids , 1996 .

[31]  Aharon Ben-Tal,et al.  Lectures on modern convex optimization , 1987 .

[32]  D. Bertsekas,et al.  On the minimax reachability of target sets and target tubes , 1971 .

[33]  Richard M. Murray,et al.  Consensus problems in networks of agents with switching topology and time-delays , 2004, IEEE Transactions on Automatic Control.

[34]  Franco Blanchini,et al.  Set-theoretic methods in control , 2007 .

[35]  D. Bertsekas,et al.  Recursive state estimation for a set-membership description of uncertainty , 1971 .

[36]  John N. Tsitsiklis,et al.  Distributed Asynchronous Deterministic and Stochastic Gradient Optimization Algorithms , 1984, 1984 American Control Conference.

[37]  Jean-Loup Guillaume,et al.  Fast unfolding of communities in large networks , 2008, 0803.0476.

[38]  Anand D. Sarwate,et al.  Broadcast Gossip Algorithms for Consensus , 2009, IEEE Transactions on Signal Processing.

[39]  Arkadi Nemirovski,et al.  Lectures on modern convex optimization - analysis, algorithms, and engineering applications , 2001, MPS-SIAM series on optimization.

[40]  Giovanni Marro,et al.  On the robust controlled invariant , 1987 .

[41]  Antoine Girard,et al.  Opinion Dynamics With Decaying Confidence: Application to Community Detection in Graphs , 2009, IEEE Transactions on Automatic Control.