Decentralized algorithms for optimally rigid network constructions

In this paper, we address the construction of optimally rigid networks that minimize an edge-weighted objective function over a planar graph. We propose two auction-based algorithms to solve this problem in a fully decentralized way. The first approach finds an optimal solution at the cost of high communication complexity; the second approach provides a sub-optimal solution while reducing the computational burden according to a sliding mode parameter ζ, yielding a tradeoff between complexity and optimality. A theoretical characterization of the optimality of the first algorithm is provided, and a closed form for the maximum gap between the optimal solution and the sub-optimal solution is also given. Simulation results are presented to corroborate the theoretical findings.

[1]  Frank Allgöwer,et al.  Growing optimally rigid formations , 2012, 2012 American Control Conference (ACC).

[2]  Gaurav S. Sukhatme,et al.  Constrained Interaction and Coordination in Proximity-Limited Multiagent Systems , 2013, IEEE Transactions on Robotics.

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

[4]  Gaurav S. Sukhatme,et al.  Decentralized generic rigidity evaluation in interconnected systems , 2013, 2013 IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[6]  Gaurav S. Sukhatme,et al.  Distributed combinatorial rigidity control in multi-agent networks , 2013, 52nd IEEE Conference on Decision and Control.

[7]  Antonio Franchi,et al.  Rigidity Maintenance Control for Multi-Robot Systems , 2012, Robotics: Science and Systems.

[8]  Maja J. Mataric,et al.  On foraging strategies for large-scale multi-robot systems , 2006, 2006 IEEE/RSJ International Conference on Intelligent Robots and Systems.

[9]  Wenwu Yu,et al.  An Overview of Recent Progress in the Study of Distributed Multi-Agent Coordination , 2012, IEEE Transactions on Industrial Informatics.

[10]  Yu-Yan Zhang,et al.  Automatic generation of optimally rigid formations using decentralized methods , 2010, Int. J. Autom. Comput..

[11]  Gaurav S. Sukhatme,et al.  Probabilistic spatial mapping and curve tracking in distributed multi-agent systems , 2012, 2012 IEEE International Conference on Robotics and Automation.

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

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

[14]  Andrea Gasparri,et al.  A spatially structured genetic algorithm for multi-robot localization , 2009, Intell. Serv. Robotics.

[15]  Lino Marques,et al.  User interfaces for human robot interactions with a swarm of robots in support to firefighters , 2010, 2010 IEEE International Conference on Robotics and Automation.

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

[17]  Mac Schwager,et al.  Persistent Robotic Tasks: Monitoring and Sweeping in Changing Environments , 2011, IEEE Transactions on Robotics.

[18]  B. Hendrickson,et al.  An Algorithm for Two-Dimensional Rigidity Percolation , 1997 .

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

[20]  B. Hendrickson,et al.  Regular ArticleAn Algorithm for Two-Dimensional Rigidity Percolation: The Pebble Game , 1997 .

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

[22]  Brian D. O. Anderson,et al.  Analysis of Noisy Bearing-Only Network Localization , 2013, IEEE Transactions on Automatic Control.

[23]  Peter N. Belhumeur,et al.  Closing ranks in vehicle formations based on rigidity , 2002, Proceedings of the 41st IEEE Conference on Decision and Control, 2002..