Pursuit-evasion in an unknown environment using Gap Navigation Trees

2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS)

Volumn 4, Issue , 2004, Pages 3456-3462

  Guilamo, Luis ^a   Tovar, Benjamin ^a   LaValle, Steven M ^a  

^a University of Illinois at Urbana Champaign   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATIONAL COMPLEXITY; FEEDBACK CONTROL; HEURISTIC METHODS; ONLINE SYSTEMS; THEOREM PROVING; TREES (MATHEMATICS);

DISCRETE DISCONTINUITIES; GAP NAVIGATION TREE (GNT); PURSUIT EVASION; STATIONARY SENTRIES;

MOBILE ROBOTS;

EID: 14044275783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (23)

1. Micah Adler, Harald Räcke, Naveen Sivadasan, Christian Sohler, and Berthold Vöcking. Randomized pursuit-evasion in graphs. In 29th International Colloquium on Automata, Languages, and Programming, 2002.
2. B. Aronov, L. Guibas, M. Teichmann, and L. Zhang. Visibility queries in simple polygons and applications. Algorithms and Computation, 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998, Proceedings, 1533, 1998.
3. T. Başar and G. J. Olsder. Dynamic Noncooperative Game Theory. Academic Press, London, 1982.
4. Alon Efrat, Leonidas J. Guibas, Sariel Har-Peled, David C. Lin, Joseph S. B. Mitchell, and T. M. Murali. Sweeping simple polygons with a chain of guards. In Simposium on Discrete Algorithms, pages 927-936, 2000.
5. J. A. Ellis, Ivan Hal Sudborough, and J. S. Turner. The vertex separation and search number of a graph. Information and Computation, 113(1):50-79, 1994.
6. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani. Visibility-based pursuit-evasion in a polygonal environment. International Journal of Computational Geometry and Applications, 9(5):471-494, 1999.
7. L. J. Guibas, R. Motwani, and P. Raghavan. The robot localization problem. In K. Goldberg, D. Halperin, J.-C. Latombe, and R. Wilson, editors, Proc. 1st Workshop on Algorithmic Foundations of Robotics, pages 269-282. A.K. Peters, Wellesley, MA, 1995.
8. R. Isaacs. Differential Games. Wiley, New York, NY, 1965.
9. V. Isler, S. Kannan, and S. Khanna. Randomized pursuit-evasion with limited visibility. In ACM-SIAM Sympos. Discrete Algorithms, 2004.
10. T. Kameda, M. Yamashita, and I. Suzuki. On-line polygon search by a six-state boundary 1-searcher. Technical Report CMPT-TR 2003-07, School of Computing Science, SFU, 2003.
11. I. Kamon, E. Rivlin, and E. Rimon. Range-sensor based navigation in three dimensions. In IEEE Int. Conf. Robot. & Autom., 1999.
12. J.-C. Latombe. Robot Motion Planning. Kluwer Academic Publishers, Boston, MA, 1991.
13. S. M. LaValle and J. Hinrichsen. Visibility-based pursuit-evasion: The case of curved environments. IEEE Transactions on Robotics and Automation, 17(2):196-201, April 2001.
14. S. M. LaValle, B. Simov, and G. Slutzki. An algorithm for searching a polygonal region with a flashlight. International Journal of Computational Geometry and Applications, 12(1-2):87-113, 2002.
15. V. J. Lumelsky and A. A. Stepanov. Path planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape. Algorithmica, 2:403-430, 1987.
16. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou. The complexity of searching a graph. Journal of the ACM, 35(1):18-44, January 1988.
17. J. Minguez and L. Montano. Nearness diagram navigation (ND): Collision avoidance in troublesome scenarios. IEEE Transactions on Robotics and Automation, February 2004.
18. N. J. Nilsson. A mobile automaton: An application of artificial intelligence techniques. In 1st International Joint Conference on Artificial Intelligence, 1969.
19. S.-M. Park, J.-H. Lee, and K.-Y. Chwa. Visibility-based pursuit-evasion in a polygonal region by a searcher. Technical Report CS/TR-2001-161, KAIST, Dept. of Computer Science, Korea, January 2001.
20. T. D. Parsons. Pursuit-evasion in a graph. In Y. Alavi and D. R. Lick, editors, Theory and Application of Graphs, pages 426-441. Springer-Verlag, Berlin, 1976.
21. S. Sachs, S. Rajko, and S. M. LaValle. Visibility-based pursuit-evasion in an unknown planar environment. Submitted to International Journal of Robotics Research, 2003.
22. I. Suzuki and M. Yamashita. Searching for a mobile intruder in a polygonal region. SIAM J. Computing, 21(5):863-888, October 1992.
23. B. Tovar, S. M. LaValle, and R. Murrieta. Optimal navigation and object finding without geometric maps or localization. In Proc. IEEE International Conference on Robotics and Automation, 2003.