Collective tree exploration

Networks

Volumn 48, Issue 3, 2006, Pages 166-177

  Fraigniaud, Pierre ^a,c   Ga̧sieniec, Leszek ^b   Kowalski, Dariusz R ^b   Pelc, Andrzej ^c  

^a CNRS   (France)

^b UNIVERSITY OF LIVERPOOL   (United Kingdom)

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

Author keywords

Algorithm; Collective graph exploration; Mobile agent; Robot; Tree

Indexed keywords

COLLECTIVE GRAPH EXPLORATION; COMMUNICATION CAPABILITIES; EXPLORATION TIME; MOBILE AGENTS;

ALGORITHMS; COMMUNICATION SYSTEMS; DATA ACQUISITION; MOBILE ROBOTS; PROBLEM SOLVING; SCHEDULING;

TREES (MATHEMATICS);

EID: 33845796192     PISSN: 00283045     EISSN: 10970037     Source Type: Journal    
DOI: 10.1002/net.20127     Document Type: Article

References (19)

1. S. Albers and M.R. Henzinger, Exploring unknown environments, SIAM J Comput 29 (2000), 1164-1188.
2. I. Averbakh and O. Herman, A heuristic with worst-case analysis for minimax routing of two traveling salesmen on a tree, Discrete Appl Math 68 (1996), 17-32.
3. I. Averbakh and O. Berman, (p - 1)/(p + 1)-approximate algorithms for p-traveling salesmen problems on a tree with minmax objective, Discrete Appl Math 75 (1997), 201-216.
4. B. Awerbuch, M. Betke, R. Rivest, and M. Singh, Piecemeal graph learning by a mobile robot, Proc 8th Conf on Comput Learning Theory, 1995, pp. 321-328.
5. E. Bar-Eli, P. Berman, A. Fiat, and R. Yan, On-line navigation in a room, J Algorithms 17 (1994), 319-341.
6. M.A. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan, The power of a pebble: Exploring and mapping directed graphs, Proc 30th Ann Symp on Theory of Computing (STOC 1998), pp. 269-278.
7. M. A. Bender and D. Slonim, The power of team exploration: Two robots can leam unlabeled directed graphs, Proc 35th Ann Symp on Foundations of Computer Science (FOCS 1994), pp. 75-85.
8. A. Blum, P. Raghavan, and B. Schieber, Navigating in unfamiliar geometric terrain, SIAM J Comput 26 (1997), 110-137.
9. M. Betke, R. Rivest, and M. Singh, Piecemeal learning of an unknown environment, Machine Learn 18 (1995), 231-254.
10. X. Deng, T. Kameda, and C.H. Papadimitriou, How to learn an unknown environment I: The rectilinear case, J ACM 45 (1998), 215-245.
11. X. Deng and C.H. Papadimitriou, Exploring an unknown graph, J Graph Theory 32 (1999), 265-297.
12. A. Dessmark and A. Pelc, Optimal graph exploration without good maps, Proc 10th European Symposium on Algorithms (ESA 2002), LNCS 2461, pp. 374-386.
13. K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, Tree exploration with little memory, Proc 13th Ann ACM-SIAM Symposium on Discrete Algorithms (SODA 2002), pp. 588-597.
14. C.A. Duncan, S.G. Kobourov, and V.S.A. Kumar, Optimal constrained graph exploration, Proc 12th Ann ACM-SIAM Symp on Discrete Algorithms (SODA 2001), pp. 807-814.
15. G.N. Frederickson, M.S. Hecht, and C.E. Kim, Approximation algorithms for some routing problems, SIAM J Comput 7 (1978), 178-193.
16. M. Garey and D. Johnson, Computers and Intractability, W.H. Freeman and Company, New York, 1979.
17. P. Panaite and A. Pelc, Exploring unknown undirected graphs, J Algorithms 33 (1999), 281-295.
18. P. Panaite and A. Pelc, Impact of topographic information on graph exploration efficiency, Networks 36 (2000), 96-103.
19. N.S.V. Rao, S. Kareti, W. Shi, and S.S. Iyengar, Robot navigation in unknown terrains: Introductory survey of nonheuristic algorithms, Tech Report ORNL/TM-12410, Oak Ridge National Laboratory, July 1993.