Finding an unpredictable target in a workspace with obstacles

This paper introduces a visibility-based motion planning problem in which the task is to coordinate the motions of one or more robots that have omnidirectional vision sensors, to eventually "see" a target that is unpredictable, has unknown initial position, and is capable of moving arbitrarily feast. A visibility region is associated with each robot, and the goal is to guarantee that the target will ultimately lie in at least one visibility region. Both a formal characterization of the general problem and several interesting problem instances are presented. A complete algorithm for computing the motion strategy of the robots is also presented, and is based on searching a finite cell complex that is constructed on the basis of critical information changes. A few computed solution strategies are shown. Several bounds on the minimum number of needed robots are also discussed.

[1]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[2]  Jake K. Aggarwal,et al.  Mobile robot self-location using model-image feature correspondence , 1996, IEEE Trans. Robotics Autom..

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

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

[5]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

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

[7]  Steven M. LaValle,et al.  A game-theoretic framework for robot motion planning , 1996 .

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

[9]  Leonidas J. Guibas,et al.  Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.

[10]  John Canny,et al.  The complexity of robot motion planning , 1988 .

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

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

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

[14]  Andrea S. LaPaugh,et al.  Recontamination does not help to search a graph , 1993, JACM.

[15]  Jérôme Barraquand,et al.  Motion planning with uncertainty: the information space approach , 1995, Proceedings of 1995 IEEE International Conference on Robotics and Automation.