Probabilistic Network Formation through Coverage and Freeze-Tag
- 1 January 2009
- book chapter
- Published by Springer Nature
- p. 3-17
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On Synchronous Robotic Networks—Part II: Time Complexity of Rendezvous and Deployment AlgorithmsIEEE Transactions on Automatic Control, 2007
- Latency Analysis of Coalescence for Robot Groups2007
- Achieving Connectivity through Coalescence in Mobile Robot Networks2007
- Many‐player rendezvous search: Stick together or split and meet?Naval Research Logistics (NRL), 2001
- Collaborative Robot Exploration and Rendezvous: Algorithms, Performance Bounds and ObservationsAutonomous Robots, 2001
- Coverage of Known Spaces: The Boustrophedon Cellular DecompositionAutonomous Robots, 2000
- Approximation algorithms for lawn mowing and milling☆☆A preliminary version of this paper was entitled “The lawnmower problem” and appears in the Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 461–466.Computational Geometry, 2000
- Asymmetric rendezvous on the plane1998
- The Rendezvous Search ProblemSIAM Journal on Control and Optimization, 1995