Practical rendezvous through modified circumcenter algorithms

We present modified nonlinear circumcenter algorithms to achieve "practical" rendezvous when agents take noisy measurements of their neighbors' positions. Assuming a uniform probability distribution of the noise in a disk about the true position, we analyze the algorithms in 1D. In particular, we provide a characterization of the practical stability ball via deterministic and stochastic analysis tools. The higher dimensional cases are discussed in simulation and we propose modified "parallel" circumcenter algorithms that can be used with guaranteed performance.

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

[2]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[3]  Nicola Santoro,et al.  Gathering of Asynchronous Oblivious Robots with Limited Visibility , 2001, STACS.

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

[5]  Stephen P. Boyd,et al.  Distributed average consensus with least-mean-square deviation , 2007, J. Parallel Distributed Comput..

[6]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 2: The Asynchronous Case , 2007, SIAM J. Control. Optim..

[7]  Francesco Bullo,et al.  Esaim: Control, Optimisation and Calculus of Variations Spatially-distributed Coverage Optimization and Control with Limited-range Interactions , 2022 .

[8]  S. Zampieri,et al.  Optimal rendezvous control for randomized communication topologies , 2006, Proceedings of the 45th IEEE Conference on Decision and Control.

[9]  Wei Ren,et al.  Consensus algorithms are input-to-state stable , 2005, Proceedings of the 2005, American Control Conference, 2005..

[10]  L. Rogers,et al.  Diffusions, Markov processes, and martingales , 1979 .

[11]  Emilio Frazzoli,et al.  On synchronous robotic networks Part II: Time complexity of rendezvous and deployment algorithms , 2007, Proceedings of the 44th IEEE Conference on Decision and Control.

[12]  Mark de Berg,et al.  Computational geometry: algorithms and applications , 1997 .

[13]  Brian D. O. Anderson,et al.  The Multi-Agent Rendezvous Problem. Part 1: The Synchronous Case , 2007, SIAM J. Control. Optim..