Abstract

This paper addresses the problem of exploration and mapping of an unknown environment by multiple robots. The mapping algorithm is an on-line approach to likelihood maximization that uses hill climbing to find maps that are maximally consistent with sensor data and odometry. The exploration algorithm explicitly coordinates the robots. It tries to maximize overall utility by minimizing the potential for overlap in information gain amongst the various robots. For both the exploration and mapping algorithms, most of the computations are distributed. The techniques have been tested extensively in real-world trials and simulations. The results demonstrate the performance improvements and robustness that accrue from our multirobot approach to exploration. 1

Keywords

RobotComputer scienceMobile robotHuman–computer interactionArtificial intelligence

Related Publications

Publication Info

Year
2000
Type
article
Pages
852-858
Citations
494
Access
Closed

External Links

Citation Metrics

494
OpenAlex

Cite This

Reid Simmons, David Apfelbaum, Wolfram Burgard et al. (2000). Coordination for Multi-Robot Exploration and Mapping. , 852-858.