Algorithms for Rapidly Dispersing Robot Swarms in Unknown Environments

Subject: I.2.9  Computer Science  Robotics

References
(30)
1. B. Awerbuch, M. Betke, R. L. Rivest, and M. Singh. Piecemeal graph exploration by a mobile robot. In Proc. 8th Annual ACM Conference on Computational Learning Theory, pages 321328, 1995.
2. T. Balch. http://www.teambots.org.
3. T. Balch and R. C. Arkin. Behaviorbased formation control for multirobot teams. IEEE Transactions on Robotics and Automation, 14(6):926939, 1998.
4. M. A. Batalin and G. S. Sukhatme. Multirobot dynamic coverage of a planar bounded environment. Technical report, Robotic Embedded Systems Laboratory, University of Southern California, 2002.
5. M. A. Batalin and G. S. Sukhatme. Spreading out: A local approach to multirobot coverage. In H. Asama, T. Arai, T. Fukuda, and T. Hasegawa, editors, Proc. 6th International Symposium on Distributed Autonomous Robotic Systems, Fukuoka, Japan, 2002. SpringerVerlag.
6. O. B. Bayazit, J.M. Lien, and N. M. Amato. Better flocking behaviors using rulebased roadmaps. In Proc. 5th International Workshop on Algorithmic Foundations of Robotics, 2002.
7. M. A. Bender, A. FernĀ“andez, D. Ron, A. Sahai, and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. Information and Computation, 176:121, 2002.
8. M. A. Bender and D. Slonim. The power of team exploration: Two robots can learn unlabeled directed graphs. In Proc. 35th Annual Symposium on Foundations of Computer Science, pages 7585, 1994.
9. A. M. Bruckstein, C. L. Mallows, and I. A. Wagner. Probabilistic pursuits on the grid. American Mathematical Monthly, 104(4):323343, 1997.
10. X. Deng and C. H. Papadimitriou. Exploring an unknown graph. In Proc. 31st Annual Symposium on Foundations of Computer Science, pages 356361, 1990.

Metrics
No metrics available

 Download from


Cite this publication