Constrained agreement protocols for tree graph topologies

This article presents a novel way of manipulating the initial conditions in the consensus equation such that a constrained agreement problem is solved across a distributed network of agents, particularly for a network represented by a tree graph. The presented method is applied to the problem of coordinating multiple pendula attached to mobile bases. The pendula should move in such a way that their motion is synchronised, which calls for a constrained optimal control problem for each pendulum as well as the constrained agreement problem across the network. Simulation results are presented that support the viability of the proposed approach as well as a hardware demonstration.

[1]  Dimos V. Dimarogonas,et al.  Decentralized Navigation Functions for Multiple Robotic Agents with Limited Sensing Capabilities , 2007, J. Intell. Robotic Syst..

[2]  Magnus Egerstedt,et al.  Multi-pendulum synchronization using constrained agreement protocols , 2009, 2009 Second International Conference on Robot Communication and Coordination.

[3]  K.L. Moore,et al.  Forced and constrained consensus among cooperating agents , 2005, Proceedings. 2005 IEEE Networking, Sensing and Control, 2005..

[4]  Mark W. Spong,et al.  Robot dynamics and control , 1989 .

[5]  Zexiang Li,et al.  Stabilization of a 2-DOF spherical pendulum on X-Y table , 2000, Proceedings of the 2000. IEEE International Conference on Control Applications. Conference Proceedings (Cat. No.00CH37162).

[6]  R. Beard,et al.  Consensus of information under dynamically changing interaction topologies , 2004, Proceedings of the 2004 American Control Conference.

[7]  A. Jadbabaie,et al.  Coordination of groups of mobile autonomous agents using nearest neighbor rules , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..

[8]  Fernando Paganini,et al.  Distributed control of spatially invariant systems , 2002, IEEE Trans. Autom. Control..

[9]  Sanjay Lall,et al.  Affine Controller Parameterization for Decentralized Control Over Banach Spaces , 2006, IEEE Transactions on Automatic Control.

[10]  Stephen P. Boyd,et al.  A scheme for robust distributed sensor fusion based on average consensus , 2005, IPSN 2005. Fourth International Symposium on Information Processing in Sensor Networks, 2005..

[11]  Anders Rantzer,et al.  Dynamic dual decomposition for distributed control , 2009, 2009 American Control Conference.

[12]  Nader Motee,et al.  Optimal Control of Spatially Distributed Systems , 2008, 2007 American Control Conference.

[13]  A. Jadbabaie,et al.  On the stability of the Kuramoto model of coupled nonlinear oscillators , 2005, Proceedings of the 2004 American Control Conference.

[14]  Asuman E. Ozdaglar,et al.  Constrained Consensus and Optimization in Multi-Agent Networks , 2008, IEEE Transactions on Automatic Control.

[15]  George J. Pappas,et al.  Coordination of Multiple Autonomous Vehicles , 2003 .

[16]  Magnus Egerstedt,et al.  Graph Theoretic Methods in Multiagent Networks , 2010, Princeton Series in Applied Mathematics.

[17]  Stephen P. Boyd,et al.  Gossip algorithms: design, analysis and applications , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[18]  R. Murray,et al.  Agreement problems in networks with directed graphs and switching topology , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).