Constrained invariant motions for networked multi-agent systems

In this paper we propose a methodology to solve the constrained consensus problem, i.e., the consensus problem for multi-agent systems with constrained dynamics. We propose a decentralized one-step horizon optimization problem to be solved iteratively by the agents to achieve rendezvous at the centroid of the network while ensuring the connectivity of the network and the feasibility of the agents motion respect to their constrained kinematics. We also provide simulations of the algorithm behavior.

[1]  Giancarlo Ferrari-Trecate,et al.  Analysis of coordination in multi-agent systems through partial difference equations , 2006, IEEE Transactions on Automatic Control.

[2]  M. Egerstedt,et al.  Motion probes for fault detection and recovery in networked control systems , 2008, 2008 American Control Conference.

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

[4]  Karl Henrik Johansson,et al.  Decentralized connectivity maintenance in mobile networks with bounded inputs , 2008, 2008 IEEE International Conference on Robotics and Automation.

[5]  G. Ferrari-Trecate,et al.  Contractive distributed MPC for consensus in networks of single and double integrators , 2008 .

[6]  Gordon F. Royle,et al.  Algebraic Graph Theory , 2001, Graduate texts in mathematics.

[7]  Reza Olfati-Saber,et al.  Consensus and Cooperation in Networked Multi-Agent Systems , 2007, Proceedings of the IEEE.

[8]  Stephen P. Boyd,et al.  Fast linear iterations for distributed averaging , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[9]  Mehdi Gati,et al.  Analysis of coordination in multi-agent systems through partial difference equationsߞPart I: T , 2005 .

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

[11]  A. Bensoussan,et al.  Difference equations on weighted graphs , 2005 .

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

[13]  Magnus Egerstedt,et al.  Laplacian Sheep: A Hybrid, Stop-Go Policy for Leader-Based Containment Control , 2006, HSCC.

[14]  Huiqing Liu,et al.  On the Laplacian spectral radius of a graph , 2004 .

[15]  George J. Pappas,et al.  Stable flocking of mobile agents part I: dynamic topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[16]  Sonia Martínez,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in arbitrary dimensions , 2006, IEEE Transactions on Automatic Control.

[17]  E.M. Atkins,et al.  A survey of consensus problems in multi-agent coordination , 2005, Proceedings of the 2005, American Control Conference, 2005..

[18]  Wassim M. Haddad,et al.  Distributed nonlinear control algorithms for network consensus , 2008, Autom..

[19]  F. Bullo,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in d dimensions , .

[20]  Qin Chen,et al.  Distributed motion coordination of multiple robots , 1994, Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS'94).

[21]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2004, IEEE Transactions on Automatic Control.