Operations on Rigid Formations of Autonomous Agents

This paper is concerned with the maintenance of rigid formations of mobile au- tonomous agents. A key element in all future multi-agent systems will be the role of sensor and communication networks as an integral part of coordination. Network topologies are critically im- portant for autonomous systems involving mobile underwater, ground and air vehicles and for sensor networks. This paper focuses on developing techniques and strategies for the analysis and design of sensor and network topologies required to achieve a rigid formation for cooperative tasks. Energy ef- ficiency and communication bandwidth are critically important in formations of mobile autonomous agents, and hence strategies that make efficient use of power and energy are beneficial. Therefore, we develop topologies for providing sensing and communications with the minimum number of links, and propose methods requiring the minimum number of changes in the set of links in dynamic mis- sions and maneuvers, including agent departure from a rigid formation, splitting a rigid formation and merging rigid sub-formations. To do this in a systematic manner, it is necessary to develop a framework for modeling agent formations that characterizes the sensing and communication links needed to maintain the formations. The challenge is that a comprehensive theory of such topologies of formations with sensing and communication limitations is in the earliest stage of development. Central to the development of these techniques and strategies will be the use of tools from rigidity theory, and graph theory.

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

[2]  Tiong-Seng Tay,et al.  Rigidity of multi-graphs. I. Linking rigid bodies in n-space , 1984, J. Comb. Theory, Ser. B.

[3]  Tibor Jordán,et al.  Algorithms for Graph Rigidity and Scene Analysis , 2003, ESA.

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

[5]  Walter Whiteley,et al.  Rigidity and scene analysis , 2004, Handbook of Discrete and Computational Geometry, 2nd Ed..

[6]  W. Whiteley,et al.  Generating Isostatic Frameworks , 1985 .

[7]  L. Lovász,et al.  On Generic Rigidity in the Plane , 1982 .

[8]  Walter Whiteley,et al.  Vertex Splitting in Isostatic Frameworks , 1990 .

[9]  J. P. Corfmat,et al.  Structurally controllable and structurally canonical systems , 1976 .

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

[11]  H. Gluck.  Almost all simply connected closed surfaces are rigid , 1975 .

[12]  R. Tennant.  Algebra , 1941, Nature.

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

[14]  R. P. Dilworth.  Review: G. Birkhoff, Lattice theory , 1950 .

[15]  B. Anderson,et al.  Structural controllability and matrix nets , 1982 .

[16]  Peter N. Belhumeur,et al.  Rigid formations of autonomous agents , 2004 .

[17]  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..

[18]  B. Anderson,et al.  A FRAMEWORK FOR MAINTAINING FORMATIONS BASED ON RIGIDITY , 2002 .

[19]  W. Whiteley,et al.  Statics of Frameworks and Motions of Panel Structures: A projective Geometric Introduction , 1982 .

[20]  A. Recski.  Matroid theory and its applications in electric network theory and in statics , 1989 .

[21]  Lebrecht Henneberg,et al.  Die graphische Statik der Starren Systeme , 1911 .