Visibility-based Pursuit-evasion with Limited Field of View

We study the visibility-based pursuit-evasion problem, in which one or more searchers must move through a given environment so as to guarantee detection of any and all evaders, which can move arbitrarily fast. Our goal is to develop techniques for coordinating teams of robots to execute this task in application domains such as clearing a building, for reasons of security or safety. To this end, we introduce a new class of searcher, the φ-searcher, which can be readily instantiated as a physical mobile robot. We present a detailed analysis of the pursuit-evasion problem using φ-searchers. We present the first complete search algorithm for a single φ-searcher, show how this algorithm can be extended to handle multiple searchers, and give examples of computed trajectories.

[1]  D. R. Lick,et al.  Theory and Applications of Graphs , 1978 .

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

[3]  Robin Milner,et al.  On Observing Nondeterminism and Concurrency , 1980, ICALP.

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

[5]  J. Schwartz,et al.  On the “piano movers'” problem I. The case of a two‐dimensional rigid polygonal body moving amidst polygonal barriers , 1983 .

[6]  J. O'Rourke Art gallery theorems and algorithms , 1987 .

[7]  Micha Sharir,et al.  An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers , 1987, J. Algorithms.

[8]  Jean-Daniel Boissonnat,et al.  A practical exact motion planning algorithm for polygonal objects amidst polygonal obstacles , 1988, Proceedings. 1988 IEEE International Conference on Robotics and Automation.

[9]  Ivan Hal Sudborough,et al.  Min cut is NP-complete for edge weighted trees , 1988 .

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

[11]  T. C. Shermer,et al.  Recent results in art galleries (geometry) , 1992, Proc. IEEE.

[12]  T. Shermer Recent Results in Art Galleries , 1992 .

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

[14]  R. Simmons,et al.  Exploration with and without a Map , 1993 .

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

[16]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1997, SIAM J. Comput..

[17]  Tamio Arai,et al.  Distributed Autonomous Robotic Systems 3 , 1998 .

[18]  Brian Yamauchi,et al.  Frontier-based exploration using multiple robots , 1998, AGENTS '98.

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

[20]  Kurt Mehlhorn,et al.  Efficient exact geometric computation made easy , 1999, SCG '99.

[21]  Lynne E. Parker,et al.  Cooperative Robotics for Multi-Target Observation , 1999, Intell. Autom. Soft Comput..

[22]  Maja J. Mataric,et al.  Broadcast of Local Elibility for Multi-Target Observation , 2000, DARS.

[23]  Maja J. Matarić,et al.  Distributed Autonomous Robotic Systems 4 , 2000 .

[24]  Wolfram Burgard,et al.  Collaborative multi-robot exploration , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

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

[26]  Gaurav S. Sukhatme,et al.  Tracking Targets Using Multiple Robots: The Effect of Environment Occlusion , 2002, Auton. Robots.

[27]  Lynne E. Parker,et al.  Multi-Robot Systems: From Swarms to Intelligent Automata , 2002, Springer Netherlands.

[28]  Nicholas Roy,et al.  Exponential Family PCA for Belief Compression in POMDPs , 2002, NIPS.

[29]  Kyung-Yong Chwa,et al.  Simple algorithms for searching a polygon with flashlights , 2002, Inf. Process. Lett..

[30]  Micah Adler,et al.  Randomized Pursuit-Evasion in Graphs , 2002, Combinatorics, Probability and Computing.

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

[32]  Camillo J. Taylor,et al.  Dynamic Sensor Planning and Control for Optimally Tracking Targets , 2003, Int. J. Robotics Res..

[33]  Tucker Balch,et al.  Collaborative execution of exploration and tracking using move value estimation for robot teams (mvert) , 2003 .

[34]  Jean-Daniel Boissonnat,et al.  Algorithmic Foundations of Robotics V, Selected Contributions of the Fifth International Workshop on the Algorithmic Foundations of Robotics, WAFR 2002, Nice, France, December 15-17, 2002 , 2004, WAFR.

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

[36]  Sebastian Thrun,et al.  Parallel Stochastic Hill- Climbing with Small Teams , 2005 .

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

[38]  Nidhi Kalra,et al.  Hoplites: A Market-Based Framework for Planned Tight Coordination in Multirobot Teams , 2005, Proceedings of the 2005 IEEE International Conference on Robotics and Automation.