Optimal navigation and object finding without geometric maps or localization

In this paper we develop a dynamite data structure, useful for robot navigation in an unknown, simply connected planar environment. The guiding philosophy in this work is to avoid traditional problems such as complete map building and localization by constructing a minimal representation based entirely on critical events in online sensor measurements made by the robot. Furthermore, this representation provides a sensor-feedback motion strategy that guides the robot along an optimal trajectory between any two environment locations, and allows the search of static targets, even though there is no geometric map of the environment. We present algorithms for building the data structure in an unknown environment, and for using it to perform optimal navigation. We implemented these algorithms on a real mobile robot. Results are presented in which the robot builds the data structure online, and is able to use it without needing a global reference frame. Simulation results are shown to demonstrate how the robot is able to find interesting objects in the environment.

[1]  David J. Kriegman,et al.  Computing exact aspect graphs of curved objects: Algebraic surfaces , 1990, International Journal of Computer Vision.

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

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

[4]  Héctor H. González-Baños,et al.  Real-time combinatorial tracking of a target moving unpredictably among obstacles , 2002, Proceedings 2002 IEEE International Conference on Robotics and Automation (Cat. No.02CH37292).

[5]  Leonidas J. Guibas,et al.  Visibility Queries in Simple Polygons and Applications , 1998, ISAAC.

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

[7]  Rudolf Fleischer,et al.  Optimal Robot Localization in Trees , 2001, Inf. Comput..

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

[9]  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.

[10]  Gregory Dudek,et al.  Using Local Information in a Non-Local Way for Mapping Graph-Like Worlds , 1993, IJCAI.

[11]  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.

[12]  Keiji Nagatani,et al.  Topological simultaneous localization and mapping (SLAM): toward exact localization without explicit localization , 2001, IEEE Trans. Robotics Autom..

[13]  Gaurav S. Sukhatme,et al.  Incremental online topological map building with a mobile robot , 1999, Optics East.

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

[15]  Michel Devy,et al.  Incremental construction of a landmark-based and topological model of indoor environments by a mobile robot , 1996, Proceedings of IEEE International Conference on Robotics and Automation.

[16]  Frédéric Lerasle,et al.  Qualitative modeling of indoor environments from visual landmarks and range data , 2002, IEEE/RSJ International Conference on Intelligent Robots and Systems.

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

[18]  Wolfram Burgard,et al.  Robust Monte Carlo localization for mobile robots , 2001, Artif. Intell..