The Robotics Institute

Carnegie Mellon Robotics Institute

Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

Abstract

The problem of map building is the problem of determining the location of entities-of-interest in a global frame of reference. Over the last years, probabilistic methods have shown to be well suited for dealing with the uncertainties involved in mobile robot map building. In this paper we introduce a general probabilistic approach to concurrent mapping and localization. This method poses the mapping problem as a statistical maximum likelihood problem, and devises an efficient algorithm for search in likelihood space. We furthermore address the problem of using occupancy grid maps for path planning in highly dynamic environments. The approaches have been tested extensively and several experimental results are given in the paper.

Notes

Number of pages: 10

Text Reference

Dieter Fox, W. Burgard, and Sebastian Thrun, "Probabilistic Methods for Mobile Robot Mapping," Proc. of the IJCAI-99 Workshop on Adaptive Spatial Representations of Dynamic Environments, 1999.

BibTeX Reference

@inproceedings{Fox_1999_2662,
   author = "Dieter Fox and W. Burgard and Sebastian Thrun",
   title = "Probabilistic Methods for Mobile Robot Mapping",
   booktitle = "Proc. of the IJCAI-99 Workshop on Adaptive Spatial Representations of Dynamic Environments",
   year = "1999",
}

The Robotics Institute

Menu