Scalable and practical pursuit-evasion

In this paper, we consider the design and implementation of practical, yet near-optimal, pursuit-evasion games. In prior work, we developed, using the theory of zero-sum games, minimal completion-time strategies for pursuit-evasion. Unfortunately, those strategies do not scale beyond a small number of robots. In this paper, we design and implement a partition strategy where pursuers capture evaders by decomposing the game into multiple multi-pursuer single-evader games. Our algorithm terminates, has bounded capture time, is robust, and is scalable in the number of robots. In our implementation, a sensor network provides sensing-at-a-distance, as well as a communication backbone that enables tighter coordination between pursuers. Our experiments in a challenging office environment suggest that this approach is near-optimal, at least for the configurations we have evaluated. Overall, our work illustrates an innovative interplay between robotics and communication.

[1]  Maja J. Mataric,et al.  Integration of representation into goal-driven behavior-based robots , 1992, IEEE Trans. Robotics Autom..

[2]  Peter Norvig,et al.  Artificial Intelligence: A Modern Approach , 1995 .

[3]  Benjamin Kuipers,et al.  A robot exploration and mapping strategy based on a semantic hierarchy of spatial representations , 1991, Robotics Auton. Syst..

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

[5]  Gaurav S. Sukhatme,et al.  Deployment and Connectivity Repair of a Sensor Net with a Flying Robot , 2004, ISER.

[6]  Gaurav S. Sukhatme,et al.  The Design and Analysis of an Efficient Local Algorithm for Coverage and Exploration Based on Sensor Network Deployment , 2007, IEEE Transactions on Robotics.

[7]  Deborah Estrin,et al.  The Tenet architecture for tiered sensor networks , 2006, SenSys '06.

[8]  S. Shankar Sastry,et al.  Tracking and Coordination of Multiple Agents Using Sensor Networks: System Design, Algorithms and Experiments , 2007, Proceedings of the IEEE.

[9]  Qun Li,et al.  Navigation protocols in sensor networks , 2005, TOSN.

[10]  Sampath Kannan,et al.  Randomized pursuit-evasion in a polygonal environment , 2005, IEEE Transactions on Robotics.

[11]  Gaurav S. Sukhatme,et al.  Most valuable player: a robot device server for distributed control , 2001, Proceedings 2001 IEEE/RSJ International Conference on Intelligent Robots and Systems. Expanding the Societal Role of Robotics in the the Next Millennium (Cat. No.01CH37180).

[12]  Sourabh Bhattacharya,et al.  Motion Strategies for Surveillance , 2007, Robotics: Science and Systems.

[13]  Gaurav S. Sukhatme,et al.  An Incremental Self-Deployment Algorithm for Mobile Sensor Networks , 2002, Auton. Robots.

[14]  Edward M. Reingold,et al.  The complexity of pursuit on a graph , 1995 .

[15]  Ulrich Pferschy.  Solution methods and computational investigations for the Linear Bottleneck Assignment Problem , 2007, Computing.

[16]  Warren A. Cheung,et al.  Constrained Pursuit-Evasion Problems in the Plane , 2005 .

[17]  B. Alspach.  SEARCHING AND SWEEPING GRAPHS: A BRIEF SURVEY , 2006 .

[18]  Tucker R. Balch,et al.  Physical Path Planning Using the GNATs , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.

[19]  G. Sukhatme,et al.  Optimal Policy in Discrete Pursuit-Evasion Games , 2022 .

[20]  Richard T. Vaughan,et al.  The Player/Stage Project: Tools for Multi-Robot and Distributed Sensor Systems , 2003 .

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

[22]  Richard J. Nowakowski,et al.  A game of cops and robbers played on products of graphs , 1998, Discret. Math..

[23]  Alain Quilliot,et al.  A short note about pursuit games played on a graph with a given genus , 1985, J. Comb. Theory, Ser. B.

[24]  Gaurav S. Sukhatme,et al.  Coverage, Exploration and Deployment by a Mobile Robot and Communication Network , 2004, Telecommun. Syst..

[25]  Alejandro Sarmiento,et al.  Surveillance Strategies for a Pursuer with Finite Sensor Range , 2007, Int. J. Robotics Res..

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

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

[28]  Rainer E. Burkard,et al.  Linear Assignment Problems and Extensions , 1999, Handbook of Combinatorial Optimization.

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

[30]  Chenyang Lu,et al.  Adaptive Embedded Roadmaps For Sensor Networks , 2007, Proceedings 2007 IEEE International Conference on Robotics and Automation.

[31]  A. Volgenant,et al.  A shortest augmenting path algorithm for dense and sparse linear assignment problems , 1987, Computing.

[32]  Peter I. Corke,et al.  Localization and Navigation Assisted by Networked Cooperating Sensors and Robots , 2005, Int. J. Robotics Res..

[33]  B. Intrigila,et al.  On the Cop Number of a Graph , 1993 .

[34]  GovindanRamesh,et al.  The Tenet architecture for tiered sensor networks , 2010 .