An Efficient Motion Strategy to Compute Expected-Time Locally Optimal Continuous Search Paths in Known Environments

In this paper we address the problem of finding time-optimal search paths in known environments. In particular, we address the problem of searching a known environment for an object whose unknown location is characterized by a known probability density function (PDF). With this formulation, the time required to find the object is a random variable induced by the choice of search path together with the PDF for the object's location. The optimization problem we consider is that of finding the path that minimizes the expected value of the time required to find the object. As the complexity of the problem precludes finding an exact optimal solution, we propose a two-level, heuristic approach to finding the optimal search path. At the top level, we use a decomposition of the workspace based on critical curves to impose a qualitative structure on the solution trajectory. At the lower level, individual segments of this trajectory are refined using local numerical optimization methods. We have implemented the algorithm and present simulation results for the particular case when the object's location is specified by the uniform PDF.

[1]  Alejandro Sarmiento,et al.  An efficient strategy for rapidly finding an object in a polygonal world , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

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

[3]  Steven M. LaValle,et al.  An Objective-Based Framework for Motion Planning under Sensing and Control Uncertainties , 1998, Int. J. Robotics Res..

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

[5]  Suk-Kyo Hong,et al.  A roadmap construction algorithm for mobile robot path planning using skeleton maps , 2007, Adv. Robotics.

[6]  F. A. Seiler,et al.  Numerical Recipes in C: The Art of Scientific Computing , 1989 .

[7]  Günther Greiner,et al.  Efficient clipping of arbitrary polygons , 1998, TOGS.

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  Kevin W. Bowyer,et al.  Aspect graphs: An introduction and survey of recent results , 1990, Int. J. Imaging Syst. Technol..

[10]  Seiichi Shin,et al.  New repulsive potential functions with angle distributions for local path planning , 2006, Adv. Robotics.

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

[12]  José Santos-Victor,et al.  Vision-based navigation and environmental representations with an omnidirectional camera , 2000, IEEE Trans. Robotics Autom..

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

[14]  Alejandro Sarmiento,et al.  Planning expected-time optimal paths for searching known environments , 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566).

[15]  Alejandro Sarmiento,et al.  A Sample-based Convex Cover for Rapidly Finding an Object in a 3-D Environment , 2005, ICRA.

[16]  Hiroshi Ishiguro,et al.  Baseline Detection and Localization for Invisible Omnidirectional Cameras , 2004, International Journal of Computer Vision.

[17]  Keiji Nagatani,et al.  Sensor-based navigation for car-like mobile robots based on a generalized Voronoi graph , 2003, Adv. Robotics.

[18]  Takashi Tsubouchi,et al.  A semi-optimal path generation scheme for a frame articulated steering-type vehicle , 2006, Adv. Robotics.

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

[20]  Rafael Murrieta-Cid,et al.  Planning exploration strategies for simultaneous localization and mapping , 2006, Robotics Auton. Syst..

[21]  G. Siouris,et al.  Optimum systems control , 1979, Proceedings of the IEEE.

[22]  Seiichi Shin,et al.  Local path planning using a new artificial potential function composition and its analytical design guidelines , 2006, Adv. Robotics.

[23]  Takeshi Tsuchiya,et al.  Environment representation using enclosed obstacles and minimum-turns path planning , 1997, Adv. Robotics.

[24]  Roger Sauter,et al.  Introduction to Probability and Statistics for Engineers and Scientists , 2005, Technometrics.

[25]  Rafael Murrieta-Cid,et al.  A Motion Planner for Maintaining Landmark Visibility with a Differential Drive Robot , 2008, WAFR.

[26]  Héctor H. González-Baños,et al.  Navigation Strategies for Exploring Indoor Environments , 2002, Int. J. Robotics Res..

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

[28]  Thomas H. Cormen,et al.  Introduction to algorithms [2nd ed.] , 2001 .

[29]  Hans Rohnert,et al.  Shortest Paths in the Plane with Convex Polygonal Obstacles , 1986, Inf. Process. Lett..

[30]  Simeon C. Ntafos,et al.  Optimum watchman routes , 1986, SCG '86.

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

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

[33]  J. March.  Introduction to the Calculus of Variations , 1999 .

[34]  Vladimir J. Lumelsky,et al.  A terrain-covering algorithm for an AUV , 1996, Auton. Robots.

[35]  Bala R. Vatti.  A generic solution to polygon clipping , 1992, CACM.

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

[37]  Marilena Vendittelli,et al.  Real-time map building and navigation for autonomous robots in unknown environments , 1998, IEEE Trans. Syst. Man Cybern. Part B.

[38]  Steven M. LaValle,et al.  Distance-Optimal Navigation in an Unknown Environment Without Sensing Distances , 2007, IEEE Transactions on Robotics.

[39]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

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

[41]  S. Hutchinson,et al.  A Sample-based Convex Cover for Rapidly Finding an Object in a 3-D Environment , 2005, ICRA.

[42]  Alejandro Sarmiento,et al.  On the existence of a strategy to maintain a moving target within the sensing range of an observer reacting with delay , 2003, Proceedings 2003 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2003) (Cat. No.03CH37453).

[43]  Antony I. T. Rowstron,et al.  Using time-encoded terrain maps for cooperation planning , 1998, Adv. Robotics.

[44]  Vincenzo Caglioti,et al.  Minimum uncertainty explorations in the self-localization of mobile robots , 1998, IEEE Trans. Robotics Autom..

[45]  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).