Roadmap based pursuit-evasion and collision avoidance

Robotics: Science and Systems

Volumn 1, Issue , 2005, Pages 257-264

  Isler, Volkan ^a   Sun, Dengfeng ^a   Sastry, Shankar ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 70449393925     PISSN: None     EISSN: 2330765X     Source Type: Conference Proceeding    
DOI: 10.15607/rss.2005.i.034     Document Type: Conference Paper

References (34)

1. J. Canny and J. Reif, "New lower bound techniques for robot motion planning problems," in 28th Annual IEEE Symposium on Foundations of Computer Science, 1987, pp. 49-60.
2. S. M. LaValle, Planning Algorithms. [Online], 2004, available at http://msl.cs.uiuc.edu/planning/.
3. H. Choset and et. al., Principles of Robot Motion: Theory, Algorithms, and Implementation. MIT Press, 2004.
4. L. E. Kavraki, J.-C. Latombe, and R. Motwani, "Randomized query processing in robot path planning," Journal of Computer and System Sciences, vol. 57, no. 1, pp. 50-60, August 1998.
5. S. M. LaValle, M. S. Branicky, and S. R. Lindemann, "On the relationship between classical grid search and probabilistic roadmaps," International Journal of Robotics Research, 2003.
6. R. Isaacs, Differential Games. Dover, 1965.
7. T. Basar and G. J. Olsder, Dynamic Noncooperative Game Theory. SIAM, 1998.
8. J. Hespanha, H. J. Kim, and S. Sastry, "Multiple-Agent probabilistic pursuit-evasion games," in In Proc. of the 38th Conf. on Decision and Contr, 1999, pp. 2432-2437.
9. R. Vidal, O. Shakernia, J. Kim, D. Shim, and S. Sastry, "Probabilistic pursuit-evasion games: Theory, implementation and experimental evaluation," IEEE Transactions on Robotics and Automation, vol. 18, pp. 662-669, 2002.
10. J. P. Hespanha, G. J. Pappas, and M. Prandini, "Greedy control for hybrid pursuit-evasion games," in Proceedings of the European Control Conference, Porto, Portugal, September 2001, pp. 2621-2626.
11. R. Nowakawski and P. Winkler, "Vertex-To-vertex pursuit in a graph," Discrete Math, vol. 43, pp. 235-239, 1983.
12. T. D. Parsons, "Pursuit evasion in a graph," in Theory and Application of Graphs, Y. Alavi and D. R. Lick, Eds. Springer Verlag, 1976, pp. 426-441.
13. N. Megiddo, S. L. Hakimi, M. R. Garey, D. S. Johnson, and C. H. Papadimitriou, "The complexity of searching a graph," J. ACM, 1988.
14. M. Aigner and M. Fromme, "A game of cops and robbers," Discrete Applied Math, vol. 8, pp. 1-12, 1984.
15. M. Adler, H. Räcke, N. Sivadasan, C. Sohler, and B. Vöcking, "Randomized pursuit-evasion in graphs," Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), 2002. [Online]. Available: citeseer.nj.nec.com/510108.html
16. V. Isler, S. Kannan, and S. Khanna, "Randomized pursuit-evasion with limited visibility," in Proc. of ACM-SIAM Symposium on Discrete Algorithms (SODA), 2004.
17. I. Suzuki and M. Yamashita, "Searching for a mobile intruder in a polygonal region," SIAM Journal on Computing, vol. 21, no. 5, pp. 863-888, 1992.
18. S.-M. Park, J.-H. Lee, and K.-Y. Chwa, "Visibility-based pursuitevasion in a polygonal region by a searcher," Proceedings of the International Colloquium on Automata, Languages and Programming (ICALP), vol. 2076, pp. 456-468, 2001. [Online]. Available: citeseer.nj.nec.com/park01visibilitybased.html
19. L. J. Guibas, J.-C. Latombe, S. M. LaValle, D. Lin, and R. Motwani, "A visibility-based pursuit-evasion problem," International Journal of Computational Geometry and Applications, vol. 9, no. 4/5, pp. 471-, 1999. [Online]. Available: citeseer.nj.nec.com/guibas96visibilitybased.html
20. J. Sgall, "Solution of David Gale's lion and man problem," Theoret. Comput. Sci., vol. 259, no. 1-2, pp. 663-670, 2001.
21. V. Isler, S. Kannan, and S. Khanna, "Locating and capturing an evader in a polygonal environment," in Proc. of 6th Workshop on Algorithmic Problems in Robotics (WAFR'04), 2004, pp. 351-367.
22. B. Gerkey, S. Thrun, and G. Gordon, "Clear the building: Pursuit-evasion with teams of robots," in Proceedings of the AAAI National Conference on Artificial Intelligence. San Jose, CA: AAAI, 2004.
23. J. Latombe, Robot Motion Planning. Kluwer Academic Publishers, 1991.
24. D. Fox, W. Burgard, and S. Thrun, "The dynamic window approach to collision avoidance," IEEE Robotics and Automation, vol. 4, no. 1, 1997.
25. S. M. LaValle and S. A. Hutchinson, "Optimal motion planning for multiple robots having independent goals," IEEE Trans. on Robotics and Automation, vol. 14, no. 6, pp. 912-925, Dec. 1998.
26. J. M. Phillips, L. E. Kavraki, and N. Bedrossian, "Spacecraft rendezvous and docking with real-Time, randomized optimization," in AIAA Guidance, Navigation, and Control, 2003.
27. C. Clark, S. Rock, and J. Latombe, "Dynamic networks for motion planning in multi-robot space systems," in International Symposium on Artificial Intelligence, Robotics and Automation in Space, 2003.
28. R. Bohlin and L. Kavraki, "Path planning using lazy prm," in International Conference on Robotics and Automation, 2000.
29. F. Schwarzer, M. Saha, and J.-C. Latombe, "Exact collision checking ofrobot paths," in Workshop on Algorithmic Foundations of Robotics (WAFR), 2002.
30. C. M. Clark, T. Bretl, and S. M. Rock, "Applying kinodynamic randomized motion planning with a dynamic priority system to multi-robot space systems," in IEEE Aerospace Conference, 2002.
31. L. Jaillet and T. Simeon, "A prm-based motion planner for dynamically changing environments," in IEEE/RSJ International Conference on Intelligent Robots and Systems, 2004.
32. L. Dubins, "On curves of minimum length with a constraint on average curvature, and with prescribed initial and terminal positions and tangents." American Journal of Mathematics, vol. 79, pp. 497-516, 1957.
33. R. S. Sutton and A. G. Barto, Reinforcement Learning:An Introduction. The MIT Press, 1998.
34. D. P. Bertsekas, Dynamic Programming and Optimal Control: 2nd Edition. Athena Scientific, 2000.