Multi-Robot Mapping using Manifold Representations
Andrew Howard, Gaurav S. Sukhatme, Maja J. Matarić
- Year
- 2006
- Citations
- 47
Abstract
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 selfconsistency facilitates a number of important autonomous capabilities, including robust retro-traverse, lazy loop closure, active loop closure using robot rendezvous, and, ultimately, autonomous exploration. This paper introduces the basic concepts of the manifold representation and shows how it may be used to solve multi-robot mapping problems. By way of validation, we include experimental results obtained using teams of two to four robots in environments ranging in size from 400 m 2 to 900 m 2. (a)
Keywords
Related papers
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002