Algorithms for rapidly dispersing robot swarms in unknown environments

Springer Tracts in Advanced Robotics

Volumn 7 STAR, Issue , 2004, Pages 77-93

  Hsiang, Tien Ruey ^a   Arkin, Esther M ^a   Bender, Michael A ^a   Fekete, Sándor P ^b   Mitchell, Joseph S B ^a  

^a STONY BROOK UNIVERSITY   (United States)

^b TECHNICAL UNIVERSITY OF BRAUNSCHWEIG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONNECTED SUBSET; LEADER-FOLLOWER; LOCAL COMMUNICATIONS; LOCAL SENSORS; MAKESPAN; PRIMARY OBJECTIVE; ROBOT SWARMS; UNKNOWN ENVIRONMENTS; WALL FOLLOWING;

DISPERSIONS; PIXELS; ROBOTICS; SCHEDULING ALGORITHMS;

ROBOTS;

EID: 33748562474     PISSN: 16107438     EISSN: 1610742X     Source Type: Book Series    
DOI: 10.1007/978-3-540-45058-0_6     Document Type: Conference Paper

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 321-328, 1995.
2. T. Balch. http://www.teambots.org.
3. T. Balch and R. C. Arkin. Behavior-based formation control for multi-robot teams. IEEE Transactions on Robotics and Automation, 14(6):926-939, 1998.
4. M. A. Batalin and G. S. Sukhatme. Multi-robot 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. Springer-Verlag.
6. O. B. Bayazit, J.-M. Lien, and N. M. Amato. Better flocking behaviors using rule-based roadmaps. In Proc. 5th International Workshop on Algorithmic Foundations of Robotics, 2002.
7. M. A. Bender, A. Fernández, D. Ron, A. Sahai, and S. Vadhan. The power of a pebble: Exploring and mapping directed graphs. Information and Computation, 176:1-21, 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 75-85, 1994.
9. A. M. Bruckstein, C. L. Mallows, and I. A. Wagner. Probabilistic pursuits on the grid. American Mathematical Monthly, 104(4):323-343, 1997.
10. X. Deng and C. H. Papadimitriou. Exploring an unknown graph. In Proc. 31st Annual Symposium on Foundations of Computer Science, pages 356-361, 1990.
11. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes. Map validation and robot self-location in a graph-like world. Robotics and Autonomous Systems, 22(2):159-178, 1997.
12. A. Dumitrescu, I. Suzuki, and M. Yamashita. High speed formations of reconfigurable modular robotic systems. In Proc. IEEE International Conference on Robotics and Automation (ICRA '02), pages 123-128, 2002.
13. P. Flocchini, G. Prencipe, N. Santoro, and P. Widmayer. Distributed coordination of a set of autonomous mobile robots. In Proc. IEEE Intelligent Vehicle Symposium (IV 2000), pages 480-485, 2000.
14. D. Gage. Many-robot systems. http://www.spawar.navy.mil/robots/research/ manyrobo/manyrobo.html.
15. D. Gage. Sensor abstractions to support many-robot systems. In Proc. of SPIE Mobile Robots VII, Boston MA, 1992, Vol. 1831, pages 235-246, 1992.
16. V. Gervasi and G. Prencipe. Flocking by a set of autonomous mobile robots. Technical Report TR-01-24, University of Pisa, Oct. 2001.
17. A. Howard, M. J. Mataric, and G. S. Sukhatme. Mobile sensor network deployment using potential fields: A distributed scalable solution to the area coverage problem. In H. Asama, T. Arai, T. Fukuda, and T. Hasegawa, editors, Proc. 6th International Symposium on Distributed Autonomous Robotic Systems, Fukuoka, Japan, 2002. Springer-Verlag.
18. N. Jovanovic, T-R. Hsiang, and M. Sztainberg. T-R. Hsiang, N. Jovanovic, and M. Sztainberg. Experimental Comparison of Dispersion Protocols for Robot Swarms. Technical Report, Stony Brook University, 2002.
19. J. S. B. Mitchell, Geometric shortest paths and network optimization, In Handbook of Computational Geometry (J.-R. Sack and J. Urrutia, editors), pages 633-701. Elsevier Science Publishers B.V. North-Holland, Amsterdam, 2000.
20. D. Payton, R. Estkowski, M. Howard. Progress in Pheromone Robotics. In Proc. 7th International Conference on Intelligent Autonomous Systems, 2002.
21. D. Payton, M. Daily, R. Estkowski, M. Howard, C. Lee. Pheromone Robotics. Autonomous Robots, Vol. 11, No. 3, pages 319-324, 2001.
22. G. Prencipe. Distributed Coordination of a Set of Autonomous Mobile Robots. Ph.D. thesis Dipartimento di Informatica, Università degli Studi di Pisa, 2002. http://www.di.unipi.it/phd/tesi/tesi-2002/PhDthesis-Prencipe.ps. gz.
23. J. H. Reif and H. Wang. Social potential fields: A distributed behavioral control for autonomous robots. Robotics and Autonomous Systems, 27(3):171-194, 1999.
24. W. Spears and D. Gordon. Using artificial physics to control agents. In Proc. IEEE Internat. Conf. on Information, Intelligence, and Systems, 1999.
25. K. Sugihara and I. Suzuki. Distributed algorithms for formation of geometric patterns with many mobile robots. Journal of Robotic Systems, 13(3):127-139, 1996.
26. I. Suzuki and M. Yamashita. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing, 28(4):1347-1363, 1999.
27. I. Wagner and A. Bruckstein. Cooperative cleaners: a study in ant robotics. Technical Report CIS9512, Technion, 1995.
28. I. Wagner, M. Lindenbaum, and A. Bruckstein. Distributed covering by ant-robots using evaporating traces. IEEE Transactions on Robotics and Automation, 15(5):918-933, 1999.
29. I. A. Wagner, M. Lindenbaum, and A. M. Bruckstein. Efficiently searching a graph by a smell-oriented vertex process. Annals of Mathematics and Artificial Intelligence, 24(1-4):211-223, 1998.
30. A. Winfield. Distributed sensing and data collection via broken ad hoc wireless connected networks of mobile robots. In L.E. Parker, G.W. Bekey, and J. Barhen, editors, Distributed Autonomous Robotic Systems, Vol. 4, pp. 273-282, 2000. Springer-Verlag.