Convex Conditions on Decentralized Control for Graph Topology Preservation

This technical note focuses on the preservation of a given graph topology which is usually chosen to ensure its connectivity. This is an essential ingredient allowing interconnected systems to accomplish tasks by using decentralized control strategies. We consider a networked system with discrete-time dynamics in which the subsystems are able to communicate if an algebraic relation between their states is satisfied. Each subsystem is called agent and the connected subsystems are called neighbors. The agents update their state in a decentralized manner by taking into account the neighbors' states. The characterization of the local control feedback gains ensuring topology preservation is provided. The results are based on invariance and set-theory and yield to conditions in Linear Matrix Inequality (LMI) form. The conditions for topology preservation are applied to an illustrative example concerning partial state consensus of agents with double integrator dynamics.

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

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

[3]  George J. Pappas,et al.  Distributed Connectivity Control of Mobile Networks , 2008, IEEE Trans. Robotics.

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

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

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

[7]  Francesco Bullo,et al.  Distributed Control of Robotic Networks , 2009 .

[8]  Stephen P. Boyd,et al.  Linear Matrix Inequalities in Systems and Control Theory , 1994 .

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

[10]  Jorge Cortes,et al.  Distributed Control of Robotic Networks: A Mathematical Approach to Motion Coordination Algorithms , 2009 .

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

[12]  Irinel-Constantin Morarescu,et al.  Set theory based condition in LMI form for network topology preservation for decentralized control , 2012, 2012 IEEE 51st IEEE Conference on Decision and Control (CDC).

[13]  R. Rockafellar.  Convex Analysis: (pms-28) , 1970 .

[14]  丸山 徹.  Convex Analysisの二,三の進展について , 1977 .

[15]  Riccardo Scattolini,et al.  Model Predictive Control Schemes for Consensus in Multi-Agent Systems with Single- and Double-Integrator Dynamics , 2009, IEEE Transactions on Automatic Control.

[16]  George J. Pappas,et al.  Distributed connectivity control of mobile networks , 2007, 2007 46th IEEE Conference on Decision and Control.

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