Bearing-only pursuit

Proceedings - IEEE International Conference on Robotics and Automation

Volumn , Issue , 2008, Pages 2665-2670

  Karnad, Nikhil ^a   Isler, Volkan ^b  

^a RENSSELAER POLYTECHNIC INSTITUTE   (United States)

^b Rensselaer Polytechnic Institute   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BEARINGS (STRUCTURAL); GAME THEORY; INDUSTRIAL ENGINEERING; ROBOTICS; SENSORS; VISUAL COMMUNICATION;

INTERNATIONAL CONFERENCES; MOBILE ROBOTS; MONOCULAR VISION; TIME STEPPING;

ROBOTS;

EID: 51649085395     PISSN: 10504729     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ROBOT.2008.4543614     Document Type: Conference Paper

References (7)

1. J. E. Littlewood, A Mathematician's Miscellany. London: Methuen & Co. Ltd., 1953.
2. L. Alonso, A. S. Goldstein, and E. M. Reingold, ""Lion and man": upper and lower bounds," ORSA J. Comput., vol. 4, no. 4, pp. 447-452, 1992.
3. J. Sgall, "Solution of David Gale's lion and man problem," Theoret. Comput. Sci., vol. 259, no. 1-2, pp. 663-670, 2001.
4. R. Guy, "Unsolved problems in combinatorial games," in Proc. Symp. Applied Mathematics, 1991, pp. 183-189.
5. V. Isler, S. Kannan, and S. Khanna, "Randomized pursuitevasion in a polygonal environment," IEEE Transactions on Robotics, vol. 5, no. 21, pp. 864-875, 2005. [Online]. Available: http://www.cs.rpi.edu/ isler/new/pub/pubs/randpe-tro.pdf
6. S. Alexander, R. Bishop, and R. Ghrist, "Pursuit and evasion in non-convex domains of arbitrary dimensions," in Robotics: Science and Systems, 2006.
7. S. D. Bopardikar, F. Bullo, and J. P. Hespanha, "Sensing limitations in the Lion and Man problem," in ACC, New York, July 2007, to appear.