Multirobot tree and graph exploration

IEEE Transactions on Robotics

Volumn 27, Issue 4, 2011, Pages 707-717

  Brass, Peter ^a   Cabrera Mora, Flavio ^b   Gasparri, Andrea ^c   Xiao, Jizhong ^a  

^a CITY COLLEGE OF NEW YORK   (United States)

^b CITY UNIVERSITY OF NEW YORK   (United States)

^c ROMA TRE UNIVERSITY   (Italy)

Author keywords

Distributed robotics; mapping; multirobot exploration; path planning

Indexed keywords

DEPTH FIRST SEARCH; DISTRIBUTED ROBOTICS; GRAPH EXPLORATION; INDOOR NAVIGATION; LOWER BOUNDS; MULTIPLE ROBOT; MULTIROBOT EXPLORATION; MULTIROBOTS; PATH-PLANNING; SINGLE ROBOTS;

ALGORITHMS; INDUSTRIAL ROBOTS; OPTIMIZATION; PLANT EXTRACTS;

TREES (MATHEMATICS);

EID: 80051695871     PISSN: 15523098     EISSN: None     Source Type: Journal    
DOI: 10.1109/TRO.2011.2121170     Document Type: Article

References (32)

1. P. Brass, A. Gasparri, F. Cabrera-Mora, and J. Xiao, "Multi-robot tree and graph exploration," in Proc. IEEE Int. Conf. Robot. Autom., 2009, pp. 2332-2337.
2. P. Fraigniaud, L. Gasieniec, D. Kowalski, and A. Pelc, "Collective tree exploration," Networks, vol. 48, pp. 166-177, Oct. 2006. (Pubitemid 44972224)
3. C. Papadimitriou and M. Yanakakis, "Shortest paths without a map," Theor. Comput. Sci., vol. 84, pp. 127-150, 1991. (Pubitemid 21699608)
4. X. Deng, T. Kameda, and C. Papadimitriou, "How to learn an unknown environment," in Proc. IEEE 32nd Annu. Symp. Found. Comput. Sci, Piscataway, NJ: IEEE Comput. Soc. Press, 1991, pp. 298-303.
5. A. Blum, P. Raghavan, and B. Schieber, "Navigating in unfamiliar geometric terrain," in Proc. 23rd Annu. ACM Symp. Theory Comput, New York: ACM, 1991, pp. 494-504.
6. J. O'Rourke, Art Gallery Theorems and Algorithms. London, U.K.: Oxford Univ. Press, 1987.
7. W. Chin and S. Ntafos, "Optimum watchman routes," in Proc. 23rd Annu. ACM Symp. Comput. Geometry, 1986, pp. 24-33.
8. S. Ntafos and L. Gewali, "External watchman routes," Vis. Comput., vol. 10, pp. 474-483, Aug. 1994.
9. F. Hoffmann, C. Icking, R. Klein, and K. Kriegel, "The polygon exploration problem," SIAM J. Comput., vol. 31, pp. 577-600, 2001. (Pubitemid 33782966)
10. R. Fleischer, T.Kamphans, R.Klein, E. Langetepe, andG. Trippen, "Competitive online approximation of the optimal search ratio," SIAM J. Comput., vol. 38, pp. 881-898, 2008.
11. H. Moravec, "Sensor fusion in certainty grids for mobile robots," AI Mag., vol. 9, pp. 61-74, 1988.
12. B. Yamauchi, "Frontier-based approach for autonomous exploration," in Proc. IEEE Int. Symp. Comput. Intell., Robot. Autom., 1997, pp. 146-151.
13. P. Panaite and A. Pelc, "Impact of topographic information on graph exploration efficiency," Networks, vol. 36, pp. 96-103, Sep. 2000.
14. A. Dessmark and A. Pelc, "Optimal graph exploration without good maps," in Proc. European Symposium on Algorithms (LNCS, vol. 2461). New York: Springer-Verlag, 2002, pp. 374-386.
15. B. Awerbuch, M. Betke, R. Rivest, and M. Singh, "Piecemeal graph exploration by a mobile robot," in Proc. 8th Annu. ACM Conf. Comput. Learning Theory, 1995, pp. 321-328.
16. B. Awerbuch and S. Kobourov, "Polylogarithmic-overhead piecemeal graph exploration," in Proc. 11th Annu. ACM Conf. Comput. Learning Theory, New York: ACM, 1998, pp. 280-286.
17. C. Duncan, S. Kobourov, and V. Kumar, "Optimal constrained graph exploration," ACM Trans. Algorithms, vol. 2, pp. 380-402, Jul. 2006. (Pubitemid 44452178)
18. L. Budach, "On the solution of the labyrinth problem for finite automata," Elektron. Inform. Verarbeitung Kybern., vol. 11, pp. 661-672, 1975.
19. F. Hoffmann, One Pebble Does Not Suffice to Search Plane Labyrinth. (LNCS, vol. 117). New York: Springer-Verlag, 1981.
20. M. Bender, A. Fernandez, D. Ron, A. Sahai, and S. Vadhan, "The power of a pebble: exploring and mapping directed graphs," in Proc. 30th Annu. ACM Symp. Theory Comput., 1998, pp. 269-278.
21. H.Wang, M. Jenkin, and P.Dymond, "Enhancing exploration in graph-like worlds," in Proc. Can. Conf. Comput. Robot Vis., May 2008, pp. 53-60.
22. L. Gasieniec, A. Pelc, T. Radzik, and X. Zhang, "Tree exploration with logarithmic memory," in Proc. ACM-SIAM Symp. Discrete Algo., 2007, pp. 585-594.
23. X. Deng and C. Papadimitriou, "Exploring an unknown graph," in Proc. IEEE 33th Annu. Symp. Found. Comput. Sci., 1990, pp. 355-361. (Pubitemid 21663266)
24. S. Kwek, "On a simple depth-first search strategy for exploring unknown graphs," in Proc. Worksh. Algorithms Data Struct. (LNCS, vol. 1272). Berlin/Heidelberg, Germany: Springer-Verlag, 1997, pp. 345-353. (Pubitemid 127109909)
25. S. Albers and M. Henzinger, "Exploring unknown environments," SIAM J. Comput., vol. 29, pp. 1164-1188, 2000.
26. R. Fleischer and G. Trippen, "Exploring an unknown graph efficiently," in Proc. Eur. Symp. Algorithms (LNCS, vol. 3669). New York: Springer-Verlag, 2005, pp. 11-22. (Pubitemid 41491514)
27. S. Das, P. Flocchini, S. Kutten, A. Nayak, and N. Santoro, "Map construction of unknown graphs by multiple agents," Theor. Comput. Sci., vol. 385, pp. 37-48, Oct. 2007.
28. G. Dudek, M. Jenkin, E. Milios, and D. Wilkes, "Robotic exploration as graph construction," IEEE Trans. Robot. Autom., vol. 7, no. 6, pp. 859-865, Dec. 1991. (Pubitemid 23563811)
29. M. Batalin and G. Sukhatme, "Coverage, exploration and deployment by a mobile robot and communication network," Telecommun. Syst., vol. 26, pp. 181-196, Jun. 2004. (Pubitemid 39019014)
30. M. Batalin and G. Sukhatme, "The design and analysis of an efficient local algorithm for coverage and exploration based on sensor network deployment," IEEE Trans, Robot., vol. 23, no. 4, pp. 661-675, Aug. 2007. (Pubitemid 47308107)
31. B. Yamauchi, "Frontier-based exploration using multiple robots," in Proc. 2nd Int. Conf. Auton. Agents, New York: ACM, 1998, pp. 47-53.
32. R. Graham, "Bounds for certain multiprocessing anomalies," Bell Syst. Tech. J., vol. 45, pp. 1563-1581, Sep. 1966.