Probabilistic strategies to coordinate multiple robotic pursuers in pursuit-evasion games

This paper examines the problem of coordinating multiple robotic pursuers in locating and tracking a non-adversarial mobile evader in a dynamic environment. We have proposed a probabilistic and distributed algorithm in this paper. Our method considers the uncertain state information of the pursuers and the evader using the probabilistic formulation of the pursuit-evasion problem, in order to minimize the expected time of capture rather than guaranteeing capture. Unlike many other approaches to this problem, our method provides a distributed technique to enhance the search efficiency of multiple pursuers as a result of avoiding overlapping search. Finally, we present simulated results to demonstrate the performance of our algorithm in a complex dynamic environment. The results show that our algorithm successfully reduces the expected capture time of the evader with a limited number of pursuers.

[1]  L. A. Zadeh,et al.  Optimal Pursuit Strategies in Discrete-State Probabilistic Systems , 1962 .

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

[3]  Jun Ota,et al.  Motion Planning of Multiple Mobile Robots , 1992 .

[4]  Jun Ota,et al.  Motion Pianning Of Multiple Mobile Robots , 1992, Proceedings of the IEEE/RSJ International Conference on Intelligent Robots and Systems.

[5]  S. Shankar Sastry,et al.  Pursuit-evasion games with unmanned ground and aerial vehicles , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[6]  V. Chvátal.  A combinatorial theorem in plane geometry , 1975 .

[7]  Peng Cheng,et al.  A Short Survey on Pursuit-Evasion Games , 2022 .

[8]  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).

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

[10]  Yi Guo,et al.  A distributed and optimal motion planning approach for multiple mobile robots , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[11]  Geoffrey A. Hollinger,et al.  Probabilistic Strategies for Pursuit in Cluttered Environments with Multiple Robots , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

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

[13]  Lynne E. Parker,et al.  Current State of the Art in Distributed Autonomous Mobile Robotics , 2000 .

[14]  Leonidas J. Guibas,et al.  Finding an unpredictable target in a workspace with obstacles , 1997, Proceedings of International Conference on Robotics and Automation.

[15]  Andrew B. Kahng,et al.  Cooperative Mobile Robotics: Antecedents and Directions , 1997, Auton. Robots.

[16]  Leonidas J. Guibas,et al.  Visibility-Based Pursuit-Evasion in a Polygonal Environment , 1997, WADS.

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

[18]  Tamir Hegazy,et al.  A Distributed Approach to Dynamic Autonomous Agent Placement for Tracking Moving Targets with Application to Monitoring Urban Environments , 2004 .

[19]  L. E. Parker,et al.  Current research in multirobot systems , 2003, Artificial Life and Robotics.