Multi-robot mapping using manifold representations
- 1 January 2004
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 4 (10504729) , 4198-4203 Vol.4
- https://doi.org/10.1109/robot.2004.1308933
Abstract
This paper introduces a new method for representing two-dimensional maps, and shows how this representation may be applied to concurrent localization and mapping problems involving multiple robots. We introduce the notion of a manifold map; this representation takes maps out of the plane and onto a two-dimensional surface embedded in a higher-dimensional space. Compared with standard planar maps, the key advantage of the manifold representation is self-consistency: manifold maps do not suffer from the 'cross over' problem that planar maps commonly exhibit in environments containing loops. This self-consistency facilitates a number of important autonomous capabilities, including robust retro-traverse, lazy loop closure, active loop closure using robot rendezvous, and, ultimately, autonomous exploration. By way of validation, this paper also includes experimental results obtained using teams of two to four robots in environments ranging in size from 400 m/sup 2/ to 900 m/sup 2/.Keywords
This publication has 5 references indexed in Scilit:
- Localization for Mobile Robot Teams: A Distributed MLE ApproachPublished by Springer Nature ,2007
- A Probabilistic On-Line Mapping Algorithm for Teams of Mobile RobotsThe International Journal of Robotics Research, 2001
- A Probabilistic Approach to Concurrent Mapping and Localization for Mobile RobotsMachine Learning, 1998
- Globally Consistent Range Scan Alignment for Environment MappingAutonomous Robots, 1997
- A generic solution to polygon clippingCommunications of the ACM, 1992