Abstract
We address the problem of propagating a piece of information among robots scattered in an environment. Initially, a single robot has the information. This robot searches for other robots to pass it along. When a robot is discovered, it can participate in the process by searching for other robots. Since our motivation for studying this problem is to form an ad hoc network, we call it the Network Formation Problem. In this paper, we study the case where the environment is a rectangle and the robots’ locations are unknown but chosen uniformly at random. We present an efficient network formation algorithm, Stripes, and show that its expected performance is within a logarithmic factor of the optimal performance. We also compare Stripes with an intuitive network formation algorithm in simulations. The feasibility of Stripes is demonstrated with a proof-of-concept implementation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alpern S, Gal S (2002) The theory of search games and rendezvous. Springer, Berlin
Alpern S (1995) The rendezvous search problem. SIAM J Control Optim 33(3): 673–683
Anderson EJ, Fekete SP (1998) Asymmetric rendezvous on the plane. In: SCG ’98: Proceedings of the fourteenth annual symposium on Computational geometry. ACM Press, New York, pp 365–373
Arkin EM, Bender MA, Fekete SP, Mitchell JSB, Skutella M (2006) The freeze-tag problem: how to wake up a swarm of robots. Algorithmica 46(2): 193–221. doi:10.1007/s00453-006-1206-1
Arkin EM, Fekete SP, Mitchell JSB (2000) Approximation algorithms for lawn mowing and milling. Comput Geom 17(1–2): 25–50
Choset H (2000) Coverage of known spaces: the boustrophedon cellular decomposition. Auton Robots 9(3): 247–253
Deb S, Médard M, Choute C (2006) Algebraic gossip: a network coding approach to optimal multiple rumor mongering. IEEE/ACM Trans Netw 14(SI): 2486–2507
Ganguli A, Cortes J, Bullo F (2006) Multirobot rendezvous with visibility sensors in nonconvex environments. IEEE Trans Robot (2006, to appear)
Martinez S, Bullo F, Cortes J, Frazzoli E (2007) On synchronous robotic networks. Part II. Time complexity of rendezvous and deployment algorithms. IEEE Trans Autom Control (to appear)
Motwani R, Raghavan P (2000) Randomized algorithms. Cambridge Press, Cambridge
Poduri S, Sukhatme GS (2007) Achieving connectivity through coalescence in mobile robot networks. In: International conference on robot communication and coordination, October 2007
Poduri S, Sukhatme GS (2007) Latency analysis of coalescence in robot groups. In: IEEE international conference on robotics and automation
Roy N, Dudek G (2001) Collaborative robot exploration and rendezvous: algorithms, performance bounds and observations. Auton Robots 11(2): 117–136
Thomas LC, Pikounis M (2001) Many-player rendevous search: stick together or split and meet. Naval Res Logist 48: 710–721
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Meisner, E., Yang, W. & Isler, V. Probabilistic network formation through coverage and freeze-tag. Intel Serv Robotics 2, 265–273 (2009). https://doi.org/10.1007/s11370-009-0051-x
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11370-009-0051-x