Latency Analysis of Coalescence for Robot Groups

Coalescence is the problem of isolated mobile robots independently searching for peers with the goal of forming a single connected network. This is important because communication is a necessary requirement for several collaborative robot tasks. In this paper, we consider a scenario where the robots do not have any information about the environment or positions of other robots and perform a random walk search. We show through probabilistic analysis that as the number of isolated robots N increases, the expected coalescence time decreases as 1/radicN. Simulations results are presented to validate this analysis.

[1]  R. Murray,et al.  Robust connectivity of networked vehicles , 2004, 2004 43rd IEEE Conference on Decision and Control (CDC) (IEEE Cat. No.04CH37601).

[2]  F. Bullo,et al.  Robust rendezvous for mobile autonomous agents via proximity graphs in d dimensions , .

[3]  Gregory Dudek,et al.  Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and Observations , 2001, Auton. Robots.

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

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

[6]  George J. Pappas,et al.  Controlling Connectivity of Dynamic Graphs , 2005, Proceedings of the 44th IEEE Conference on Decision and Control.

[7]  Maurizio Porfiri,et al.  Random talk: Random walk and synchronizability in a moving neighborhood network☆ , 2006 .

[8]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

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

[10]  Patrik Dykiel.  Asymptotic properties of coalescing random walks , 2005 .