Distributed consensus on enclosing shapes and minimum time rendezvous

In this paper we introduce the notion of optimization under control and communication constraint in a robotic network. Starting from a general setup, we focus our attention on the problem of achieving rendezvous in minimum time for a network of first order agents with bounded inputs and limited range communication. We propose two dynamic control and communication laws. These laws are based on consensus algorithms for distributed computation of the minimal enclosing ball and orthotope of a set of points. We prove that these control laws converge to the optimal solution of the centralized problem (i.e., when no communication constrains are enforced) as the bound on the control input goes to zero. Moreover, we give a bound for the time complexity of one of the two laws

[1]  Masafumi Yamashita,et al.  Distributed memoryless point convergence algorithm for mobile robots with limited visibility , 1999, IEEE Trans. Robotics Autom..

[2]  Timothy W. McLain,et al.  Coordination Variables and Consensus Building in Multiple Vehicle Systems , 2004 .

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

[4]  Bernd Gärtner,et al.  The smallest enclosing ball of balls: combinatorial structure and algorithms , 2004, Int. J. Comput. Geom. Appl..

[5]  F. Bullo,et al.  On Synchronous Robotic Networks—Part I: Models, Tasks, and Complexity , 2005, IEEE Transactions on Automatic Control.

[6]  Seif Haridi,et al.  Distributed Algorithms , 1992, Lecture Notes in Computer Science.

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

[8]  Mireille E. Broucke,et al.  Local control strategies for groups of mobile autonomous agents , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[9]  Emilio Frazzoli,et al.  On synchronous robotic networks Part I: Models, tasks and complexity notions , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[10]  Jie Lin,et al.  The multi-agent rendezvous problem , 2003, 42nd IEEE International Conference on Decision and Control (IEEE Cat. No.03CH37475).

[11]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.