Topological simultaneous localization and mapping (SLAM): toward exact localization without explicit localization
Top Cited Papers
- 1 April 2001
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Robotics and Automation
- Vol. 17 (2) , 125-137
- https://doi.org/10.1109/70.928558
Abstract
This paper presents a new method for simultaneous localization and mapping that exploits the topology of the robot's free space to localize the robot on a partially constructed map. The topology of the environment is encoded in a topological map; the particular topological map used in this paper is the generalized Voronoi graph (GVG), which also encodes some metric information about the robot's environment, as well. In this paper, we present the low-level control laws that generate the GVG edges and nodes, thereby allowing for exploration of an unknown space. With these prescribed control laws, the GVG can be viewed as an arbitrator for a hybrid control system that determines when to invoke a particular low-level controller from a set of controllers all working toward the high-level capability of mobile robot exploration. The main contribution, however, is using the graph structure of the GVG, via a graph matching process, to localize the robot. Experimental results verify the described work.Keywords
This publication has 20 references indexed in Scilit:
- Probabilistic mapping of an environment by a mobile robotPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Sensor-Based Exploration: The Hierarchical Generalized Voronoi GraphThe International Journal of Robotics Research, 2000
- A Multiple-Hypothesis Approach to Concurrent Mapping and Localization for Autonomous Underwater VehiclesPublished by Springer Nature ,1998
- A robot exploration and mapping strategy based on a semantic hierarchy of spatial representationsRobotics and Autonomous Systems, 1991
- Voronoi diagrams—a survey of a fundamental geometric data structureACM Computing Surveys, 1991
- Robotic exploration as graph constructionIEEE Transactions on Robotics and Automation, 1991
- A 'retraction' method for learned navigation in unknown terrains for a circular robotIEEE Transactions on Robotics and Automation, 1991
- Constructing roadmaps of semi-algebraic sets I: CompletenessArtificial Intelligence, 1988
- Path-planning strategies for a point mobile automaton moving amidst unknown obstacles of arbitrary shapeAlgorithmica, 1987
- A “retraction” method for planning the motion of a discJournal of Algorithms, 1985