Visibility-Based Pursuit-Evasion in an Unknown Planar Environment

We address an on-line version of the visibility-based pursuit-evasion problem. We take a minimalist approach in modeling the capabilities of a pursuer robot. A point pursuer moves in an unknown, simplyconnected, piecewise-smooth planar environment, and is given the task of locating any unpredictable, moving evaders that have unbounded speed. The evaders are assumed to be points that move continuously. To solve the problem, the pursuer must for each target have an unobstructed view of it at some time during execution. The pursuer is equipped with a range sensor that measures the direction of depth discontinuities, but cannot provide precise depth measurements. All pursuer control is specified either in terms of this sensor or wall-following movements. The pursuer does not have localization capability or perfect control. We present a complete algorithm that enables the limited pursuer to clear the same environments that a pursuer with a complete map, perfect localization, and perfect control can clear (under certain general position assumptions). Theoretical guarantees that the evaders will be found are provided. The resulting algorithm to compute this strategy has been implemented in simulation. Results are shown for several examples. The approach is efficient and simple enough to be useful towards the development of real robot systems that perform visual searching.

[1]  Bruce Randall Donald,et al.  Sensor interpretation and task-directed planning using perceptual equivalence classes , 1991, Proceedings. 1991 IEEE International Conference on Robotics and Automation.

[2]  Lyle A. McGeoch,et al.  Competitive algorithms for on-line problems , 1988, STOC '88.

[3]  Manuel Blum,et al.  On the power of the compass (or, why mazes are easier to search than graphs) , 1978, 19th Annual Symposium on Foundations of Computer Science (sfcs 1978).

[4]  Howie Choset,et al.  Robust sensor-based coverage of unstructured environments , 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).

[5]  Steven M. LaValle,et al.  Optimal navigation and object finding without geometric maps or localization , 2003, 2003 IEEE International Conference on Robotics and Automation (Cat. No.03CH37422).

[6]  Vladimir J. Lumelsky,et al.  Provable strategies for vision-guided exploration in three dimensions , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[7]  Kenneth Y. Goldberg,et al.  Orienting polygonal parts without sensors , 1993, Algorithmica.

[8]  Steven M. LaValle,et al.  A pursuit-evasion BUG algorithm , 2001, Proceedings 2001 ICRA. IEEE International Conference on Robotics and Automation (Cat. No.01CH37164).

[9]  Vladimir J. Lumelsky,et al.  An algorithm for maze searching with azimuth input , 1994, Proceedings of the 1994 IEEE International Conference on Robotics and Automation.

[10]  Giora Slutzki,et al.  Pursuit-evasion using beam detection , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[11]  Kevin M. Lynch.  Sensorless parts feeding with a one joint robot , 1996 .

[12]  Ehud Rivlin,et al.  Sensory-based motion planning with global proofs , 1997, IEEE Trans. Robotics Autom..

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

[14]  Howie Choset,et al.  Sensor Based Planing, Part II: Incremental COnstruction of the Generalized Voronoi Graph , 1995, ICRA.

[15]  Bruce Randall Donald,et al.  On Information Invariants in Robotics , 1995, Artif. Intell..

[16]  Michael A. Bender,et al.  The power of a pebble: exploring and mapping directed graphs , 1998, STOC '98.

[17]  Leonidas J. Guibas,et al.  The Robot Localization Problem , 1995, SIAM J. Comput..

[18]  Leonidas J. Guibas,et al.  Sweeping simple polygons with a chain of guards , 2000, SODA '00.

[19]  Howie Choset,et al.  Complete sensor-based coverage with extended-range detectors: a hierarchical decomposition in terms of critical points and Voronoi diagrams , 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).

[20]  Xiaotie Deng,et al.  How to learn an unknown environment. I: the rectilinear case , 1998, JACM.

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

[22]  Steven M. LaValle,et al.  Visibility-based pursuit-evasion: the case of curved environments , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[23]  Masafumi Yamashita,et al.  Searching for a mobile intruder in a corridor: the open edge variant of the polygon search problem , 1995, Int. J. Comput. Geom. Appl..

[24]  Matthew T. Mason,et al.  An exploration of sensorless manipulation , 1986, Proceedings. 1986 IEEE International Conference on Robotics and Automation.

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

[26]  Ehud Rivlin,et al.  Range-sensor based navigation in three dimensions , 1999, Proceedings 1999 IEEE International Conference on Robotics and Automation (Cat. No.99CH36288C).

[27]  Vladimir J. Lumelsky,et al.  Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shape , 1987, Algorithmica.

[28]  Jean-Paul Laumond,et al.  Algorithms for Robotic Motion and Manipulation , 1997 .

[29]  Sung Yong Shin,et al.  Visibility-based pursuit-evasion in a polygonal room with a door , 1999, SCG '99.

[30]  Masafumi Yamashita,et al.  Bushiness and a Tight Worst-Case Upper Bound on the Search Number of a Simple Polygon , 1998, Inf. Process. Lett..

[31]  Masafumi Yamashita,et al.  Searching a Polygonal Region from the Boundary , 2001, Int. J. Comput. Geom. Appl..

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

[33]  Masafumi Yamashita,et al.  Searching for Mobile Intruders in a Polygonal Region by a Group of Mobile Searchers , 2001, SCG '97.

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

[35]  Vladimir J. Lumelsky,et al.  Incorporating body dynamics into sensor-based motion planning: the maximum turn strategy , 1997, IEEE Trans. Robotics Autom..