This Article Full Text (PDF) References Alert me when this article is cited Alert me if a correction is posted Services Email this article to a friend Similar articles in this journal Similar articles in Web of Science Alert me to new issues of the journal Add to Saved Citations Download to citation manager Request Permissions Request Reprints Add to My Marked Citations Citing Articles Citing Articles via Google Scholar Citing Articles via Scopus Google Scholar Articles by Huang, W. H. Articles by Beevers, K. R. Search for Related Content Social Bookmarking                         What's this?

Topological Map Merging

Rensselaer Polytechnic Institute, Department of Computer Science, 110 8th Street, Troy, New York 12180, USA, whuang{at}cs.rpi.edu

Kristopher R. Beevers

Rensselaer Polytechnic Institute, Department of Computer Science, 110 8th Street, Troy, New York 12180, USA, beevek{at}cs.rpi.edu

When multiple robots cooperatively explore an environment, maps from individual robots must be merged to produce a single globally consistent map. This is a challenging problem when the robots do not have a common reference frame or global positioning. In this paper, we describe an algorithm for merging embedded topological maps. Topological maps provide a concise description of the navigability of an environment, and, with measurements easily collected during exploration, the vertices of the map can be embedded in a metric space. Our algorithm uses both the structure and the geometry of topological maps to determine the best correspondence between maps with single or multiple overlapping regions. Experiments with simulated and real-world data demonstrate the efficacy of our algorithm.

Key Words: topological mapping • map merging • multiple robot mapping • graph matching • image registration

The International Journal of Robotics Research, Vol. 24, No. 8, 601-613 (2005)
DOI: 10.1177/0278364905056348


CiteULike    Complore    Connotea    Del.icio.us    Digg    Reddit    Technorati    Twitter    What's this?