Remembering without memory: Tree exploration by asynchronous oblivious robots

Theoretical Computer Science

Volumn 411, Issue 14-15, 2010, Pages 1583-1598

  Flocchini, Paola ^a   Ilcinkas, David ^b   Pelc, Andrzej ^c   Santoro, Nicola ^d  

^a UNIVERSITY OF OTTAWA   (Canada)

^b UNIVERSITÉ DE BORDEAUX   (France)

^c UNIVERSITÉ DU QUÉBEC EN OUTAOUAIS   (Canada)

^d CARLETON UNIVERSITY   (Canada)

Author keywords

Asynchronous; Exploration; Mobile agent; Oblivious; Robot; Tree

Indexed keywords

ASYMPTOTICALLY OPTIMAL; AUTOMORPHISMS; AUTONOMOUS MOBILE ROBOT; COMPLEXITY MEASURES; EXPLORATION; FINITE TIME; MAXIMUM DEGREE; NON-TRIVIAL; OBLIVIOUS ROBOTS; QUIESCENT STATE; SWARM OF ROBOTS; VISIBILITY SENSORS;

MOBILE AGENTS;

ROBOTS;

EID: 76849098305     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2010.01.007     Document Type: Article

References (31)

1. Agmon N., and Peleg D. Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM Journal on Computing 36 (2006) 56-82
2. Albers S., and Henzinger M.R. Exploring unknown environments. SIAM Journal on Computing 29 (2000) 1164-1188
3. Ando H., Oasa Y., Suzuki I., and Yamashita M. Distributed memoryless point convergence algorithm for mobile robots with limited visibility. IEEE Transactions on Robotics and Automation 15 (1999) 818-828
4. Averbakh I., and Berman O. A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree. Discrete Applied Mathematics 68 (1996) 17-32
5. Averbakh I., and Berman O. (p - 1) / (p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective. Discrete Applied Mathematics 75 (1997) 201-216
6. B. Awerbuch, M. Betke, R. Rivest, M. Singh, Piecemeal graph learning by a mobile robot, in: Proc. 8th Conf. on Comput. Learning Theory, 1995, pp. 321-328
7. M.A. Bender, A. Fernandez, D. Ron, A. Sahai, S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, in: Proc. 30th Ann. Symp. on Theory of Computing, STOC, 1998, pp. 269-278
8. M.A. Bender, D. Slonim, The power of team exploration: Two robots can learn unlabeled directed graphs, in: Proc. 35th Ann. Symp. on Foundations of Computer Science, FOCS, 1994, pp. 75-85
9. Betke M., Rivest R., and Singh M. Piecemeal learning of an unknown environment. Machine Learning 18 (1995) 231-254
10. M. Cieliebak, Gathering non-oblivious mobile robots, in: Proc. 6th Latin American Symposium on Theoretical Informatics, LATIN, 2004, pp. 577-588
11. Cieliebak M., Flocchini P., Prencipe G., and Santoro N. Solving the robots gathering problem. Proc. 30th Int. Colloquium on Automata, Languages and Programming, ICALP. LNCS vol. 2719 (2003) 1181-1196
12. Cohen R., and Peleg D. Local spreading algorithms for autonomous robot systems. Theoretical Computer Science 399 (2008) 71-82
13. Czyzowicz J., Gasieniec L., and Pelc A. Gathering few fat mobile robots in the plane. Proc. 10th International Conference on Principles of Distributed Systems, OPODIS. LNCS vol. 4288 (2006) 744-753
14. Deng X., and Papadimitriou C.H. Exploring an unknown graph. Journal of Graph Theory 32 (1999) 265-297
15. Dessmark A., and Pelc A. Optimal graph exploration without good maps. Theoretical Computer Science 326 (2004) 343-362
16. K. Diks, P. Fraigniaud, E. Kranakis, A. Pelc, Tree exploration with little memory, in: Proc. 13th Ann. ACM-SIAM Symposium on Discrete Algorithms, SODA, 2002, pp. 588-597
17. C.A. Duncan, S.G. Kobourov, V.S.A. Kumar, Optimal constrained graph exploration, in: Proc. 12th Ann. ACM-SIAM Symp. on Discrete Algorithms, SODA, 2001, pp. 807-814
18. Frederickson G.N., Hecht M.S., and Kim C.E. Approximation algorithms for some routing problems. SIAM Journal on Computing 7 (1978) 178-193
19. Fleischer R., and Trippen G. Exploring an unknown graph efficiently. Proc. 13th Annual European Symposium on Algorithms, ESA. LNCS vol. 3669 (2005) 11-22
20. P. Flocchini, D. Ilcinkas, A. Pelc, N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, in: Proc. 11th International Conference on Principles of Distributed Systems, OPODIS, 2007, pp. 105-118
21. Flocchini P., Prencipe G., Santoro N., and Widmayer P. Arbitrary pattern formation by asynchronous, anonymous, oblivious robots. Theoretical Computer Science 407 (2008) 412-447
22. Flocchini P., Prencipe G., Santoro N., and Widmayer P. Gathering of asynchronous robots with limited visibility. Theoretical Computer Science 337 (2005) 147-168
23. Fraigniaud P., Gasieniec L., Kowalski D., and Pelc A. Collective tree exploration. Proc. Latin American Theoretical Informatics, LATIN. LNCS vol. 2976 (2004) 141-151
24. L. Gasieniec, A. Pelc, T. Radzik, X. Zhang, Tree exploration with logarithmic memory, in: Proc. 18th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA, 2007, pp. 585-594
25. Klasing R., Markou E., and Pelc A. Gathering asynchronous oblivious mobile robots in a ring. Theoretical Computer Science 390 (2008) 27-39
26. Panaite P., and Pelc A. Exploring unknown undirected graphs. Journal of Algorithms 33 (1999) 281-295
27. Prencipe G. Impossibility of gathering by a set of autonomous mobile robots. Theoretical Computer Science 384 (2007) 222-231
28. G. Prencipe, N. Santoro, Distributed algorithms for mobile robots, in: Proc. 5th IFIP International Conference on Theoretical Computer Science, TCS, 2006, pp. 47-62
29. Souissi S., Défago X., and Yamashita M. Gathering asynchronous mobile robots with inaccurate compasses. Proc. 10th Int. Conf. on Principles of Distributed Systems, OPODIS. LNCS vol. 4305 (2006) 333-349
30. Sugihara K., and Suzuki I. Distributed algorithms for formation of geometric patterns with many mobile robots. Journal of Robotic Systems 13 (1996) 127-139
31. Suzuki I., and Yamashita M. Distributed anonymous mobile robots: Formation of geometric patterns. SIAM Journal on Computing 28 (1999) 1347-1363