Roadmap Based Pursuit-Evasion and Collision Avoidance

We study pursuit-evasion games for mobile robots and their applications to collision avoidance. In the first part of the paper, under the assumption that the pursuer and the evader (possibly subject to physical constraints) share the same roadmap to plan their strategies, we present sound and complete strategies for three different games. In the second part, we utilize the pursuit-evasion results to post-process the workspace and/or configuration space and obtain a collision probability map of the environment. Next, we present a probabilistic method to utilize this map and plan trajectories which minimize the collision probability for independent robots.

[1]  S. LaValle,et al.  Motion Planning , 2008, Springer Handbook of Robotics.

[2]  L. Dubins.  On Curves of Minimal Length with a Constraint on Average Curvature, and with Prescribed Initial and Terminal Positions and Tangents , 1957 .

[3]  Howie Choset,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[4]  Mitul Saha,et al.  Exact Collision Checking of Robot Paths , 2002, WAFR.

[5]  Christos H. Papadimitriou,et al.  The complexity of searching a graph , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).

[6]  Rufus Isaacs,et al.  Differential Games , 1965 .

[7]  George J. Pappas,et al.  Greedy control for hybrid pursuit games , 2001, 2001 European Control Conference (ECC).

[8]  S. Shankar Sastry,et al.  Probabilistic pursuit-evasion games: theory, implementation, and experimental evaluation , 2002, IEEE Trans. Robotics Autom..

[9]  Leonidas J. Guibas,et al.  A Visibility-Based Pursuit-Evasion Problem , 1999, Int. J. Comput. Geom. Appl..

[10]  Lydia E. Kavraki,et al.  Randomized query processing in robot path planning , 1995, STOC '95.

[11]  Kyung-Yong Chwa,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Region by a Searcher , 2001, ICALP.

[12]  Dimitri P. Bertsekas,et al.  Dynamic Programming and Optimal Control, Two Volume Set , 1995 .

[13]  Sampath Kannan,et al.  Locating and Capturing an Evader in a Polygonal Environment , 2004, WAFR.

[14]  George J. Pappas,et al.  Greedy Control for Hybrid Pursuit-Evasion GamesJo , 2001 .

[15]  John F. Canny,et al.  New lower bound techniques for robot motion planning problems , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[16]  Jean-Claude Latombe,et al.  Robot motion planning , 1970, The Kluwer international series in engineering and computer science.

[17]  Lydia E. Kavraki,et al.  Path planning using lazy PRM , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[18]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[19]  Steven M. LaValle,et al.  On the Relationship between Classical Grid Search and Probabilistic Roadmaps , 2004, Int. J. Robotics Res..

[20]  Christopher M. Clark,et al.  Applying kinodynamic randomized motion planning with a dynamic priority system to multi-robot space systems , 2002, Proceedings, IEEE Aerospace Conference.

[21]  Peter Winkler,et al.  Vertex-to-vertex pursuit in a graph , 1983, Discret. Math..

[22]  Micah Adler,et al.  Randomized Pursuit-Evasion In Graphs , 2003, Comb. Probab. Comput..

[23]  Thierry Siméon,et al.  A PRM-based motion planner for dynamically changing environments , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[24]  Martin Aigner,et al.  A game of cops and robbers , 1984, Discret. Appl. Math..

[25]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[26]  T. D. Parsons,et al.  Pursuit-evasion in a graph , 1978 .

[27]  Jeff M. Phillips,et al.  Spacecraft Rendezvous and Docking with Real-Time, Randomized Optimization , 2003 .

[28]  Steven M. LaValle,et al.  Planning algorithms , 2006 .

[29]  Wolfram Burgard,et al.  The dynamic window approach to collision avoidance , 1997, IEEE Robotics Autom. Mag..

[30]  Masafumi Yamashita,et al.  Searching for a Mobile Intruder in a Polygonal Region , 1992, SIAM J. Comput..

[31]  Wolfram Burgard,et al.  Principles of Robot Motion: Theory, Algorithms, and Implementation ERRATA!!!! 1 , 2007 .

[32]  Jirí Sgall.  Solution of David Gale's lion and man problem , 2001, Theor. Comput. Sci..

[33]  Sampath Kannan,et al.  Randomized pursuit-evasion with limited visibility , 2004, SODA '04.

[34]  Steven M. LaValle,et al.  Optimal motion planning for multiple robots having independent goals , 1998, IEEE Trans. Robotics Autom..

[35]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[36]  J.P. Hespanha,et al.  Multiple-agent probabilistic pursuit-evasion games , 1999, Proceedings of the 38th IEEE Conference on Decision and Control (Cat. No.99CH36304).

[37]  Lydia E. Kavraki,et al.  Randomized Query Processing in Robot Path Planning , 1998, J. Comput. Syst. Sci..

[38]  Stephen M. Rock,et al.  Dynamic Networks for Motion Planning in Multi-Robot Space Systems , 2003 .