Univector field method-based multi-agent navigation for pursuit problem in obstacle environments

The pursuit problem is a well-known problem in computer science. In this problem, a group of predator agents attempt to capture a prey agent in an environment with various obstacle types, partial observation, and an infinite grid-world. Predator agents are applied algorithms that use the univector field method to reach the prey agent, strategies for avoiding obstacles and strategies for cooperation between predator agents. Obstacle avoidance strategies are generalized and presented through strategies called hitting and following boundary (HFB); trapped and following shortest path (TFSP); and predicted and following shortest path (PFSP). In terms of cooperation, cooperation strategies are employed to more quickly reach and capture the prey agent. Experimental results are shown to illustrate the efficiency of the method in the pursuit problem.

[1]  N. H. C. Yung,et al.  Avoidance of moving obstacles through behavior fusion and motion prediction , 1998, SMC'98 Conference Proceedings. 1998 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.98CH36218).

[2]  Dong-Soo Kwon,et al.  Evolutionary programming-based univector field navigation method for past mobile robots , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[3]  Faraón Llorens-Largo,et al.  Extending Korf's Ideas on the Pursuit Problem , 2008, DCAI.

[4]  Jong-Hwan Kim,et al.  Footstep Planning Based on Univector Field Method for Humanoid Robot , 2009, FIRA.

[5]  Richard E. Neapolitan,et al.  Foundations of Algorithms , 1996 .

[6]  Daniel Hladek,et al.  MULTI-ROBOT CONTROL SYSTEM FOR PURSUIT-EVASION PROBLEM , 2009 .

[7]  Anthony Stentz,et al.  The Focussed D* Algorithm for Real-Time Replanning , 1995, IJCAI.

[8]  Wei Lin,et al.  Nash strategies for pursuit-evasion differential games involving limited observations , 2015, IEEE Transactions on Aerospace and Electronic Systems.

[9]  Thomas Bräunl,et al.  Performance Comparison of Bug Navigation Algorithms , 2007, J. Intell. Robotic Syst..

[10]  Subhash Suri,et al.  Capture bounds for visibility-based pursuit evasion , 2015, Comput. Geom..

[11]  Jason M. O'Kane,et al.  A complete algorithm for visibility-based pursuit-evasion with multiple pursuers , 2014, 2014 IEEE International Conference on Robotics and Automation (ICRA).

[12]  Sven Koenig,et al.  Fast replanning for navigation in unknown terrain , 2005, IEEE Transactions on Robotics.

[13]  Jingtai Liu,et al.  Research on Pursuit-evasion games with multiple heterogeneous pursuers and a high speed evader , 2015, The 27th Chinese Control and Decision Conference (2015 CCDC).

[14]  Hoang Huu Viet,et al.  Univector Field Method based Multi-Agent Navigation for Pursuit Problem , 2012 .

[15]  S. Kolski,et al.  Detection, prediction, and avoidance of dynamic obstacles in urban environments , 2008, 2008 IEEE Intelligent Vehicles Symposium.

[16]  Geoffrey A. Hollinger,et al.  Search and pursuit-evasion in mobile robotics , 2011, Auton. Robots.

[17]  Faruk Polat,et al.  Real-Time Moving Target Search , 2007, PRIMA.

[18]  Esra Kadioglu Urtis,et al.  An approach to multi-agent pursuit evasion games using reinforcement learning , 2015, 2015 International Conference on Advanced Robotics (ICAR).

[19]  Edward M. Reingold,et al.  Bounds for cops and robber pursuit , 2010, Comput. Geom..

[20]  Seung-Hwan Choi,et al.  Evolutionary Univector Field-based Navigation with Collision Avoidance for Mobile Robot , 2008 .

[21]  Faruk Polat,et al.  Multi-agent real-time pursuit , 2009, Autonomous Agents and Multi-Agent Systems.

[22]  Athanasios Kehagias,et al.  Cops and invisible robbers: The cost of drunkenness , 2012, Theor. Comput. Sci..