Distributed rigid formation control algorithm for multi-agent systems

Purpose – Rigidity of formation is an important concept in multi‐agent localization and control problems. The purpose of this paper is to design the control laws to enable the group to asymptotically exhibit the flocking motion while preserving the network rigidity at all times.Design/methodology/approach – The novel approach for designing control laws is derived from a smooth artificial potential function based on an undirected infinitesimally rigid formation which specifies the target formation. Then the potential function is used to specify a gradient control law, under which the original system then becomes an orderly infinitesimally rigid formation.Findings – The strong relationship between the stability of the target formation and the gradient control protocol are utilized to design the control laws which can be proved to make the target formation stable. However, the rigidity matrix is not utilized in the design of control law. Future research will mainly focus on formation control with the relatio...

[1]  Jorge Cortés,et al.  Distributed algorithms for reaching consensus on general functions , 2008, Autom..

[2]  Yves Cherruault,et al.  The genicAgent: a hybrid approach for multi‐agent problem solving , 2001 .

[3]  Karl H. Johansson,et al.  Further results on the stability of distance-based multi-robot formations , 2009, 2009 American Control Conference.

[4]  Juan Manuel García-Chamizo,et al.  Mobile agent system framework suitable for scalable networks , 2006 .

[5]  Changhong Wang,et al.  Multi-robot object tracking and docking systems based on networked control frames , 2010, Kybernetes.

[6]  N. Leonard,et al.  Coordinated Patterns on Smooth Curves , 2006, 2006 IEEE International Conference on Networking, Sensing and Control.

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

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

[9]  Mireille E. Broucke,et al.  Stabilization of infinitesimally rigid formations of multi-robot networks , 2008, 2008 47th IEEE Conference on Decision and Control.

[10]  B. Roth,et al.  The rigidity of graphs , 1978 .

[11]  Bill Jackson,et al.  Egerváry Research Group on Combinatorial Optimization Connected Rigidity Matroids and Unique Realizations of Graphs Connected Rigidity Matroids and Unique Realizations of Graphs , 2022 .

[12]  Brian D. O. Anderson,et al.  A Theory of Network Localization , 2006, IEEE Transactions on Mobile Computing.

[13]  Karl Henrik Johansson,et al.  On the stability of distance-based formation control , 2008, 2008 47th IEEE Conference on Decision and Control.

[14]  M. Spong,et al.  Stable flocking of multiple inertial agents on balanced graphs , 2006, 2006 American Control Conference.

[15]  Michael Emile Hermary.  Rigidity of graphs , 1986 .

[16]  Jianghai Hu,et al.  Stiffness matrix and quantitative measure of formation rigidity , 2009, Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference.

[17]  B. Roth,et al.  The rigidity of graphs, II , 1979 .

[18]  J. Hendrickx,et al.  Rigid graph control architectures for autonomous formations , 2008, IEEE Control Systems.

[19]  A. Stephen Morse,et al.  Network localization using graph decomposition and rigidity , 2008, 2008 47th IEEE Conference on Decision and Control.

[20]  G. Laman.  On graphs and rigidity of plane skeletal structures , 1970 .

[21]  Brian D. O. Anderson,et al.  Acquiring and maintaining persistence of autonomous multi-vehicle formations , 2007 .

[22]  R. Murray,et al.  Graph rigidity and distributed formation stabilization of multi-vehicle systems , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..