Exploration strategies are an important ingredient for map building with mobile robots. The traditional greedy exploration strategy is not directly applicable in unbounded outdoor environments, because it decides on the robot's actions solely based on the expected information gain and travel cost. As this value can be optimized by driving straight into unexplored space, this behavior often leads to degenerated maps. We propose two different techniques to regularize the value function of the exploration strategy, in order to explore compact areas in outdoor environments. We compare exploration speed and compactness of the maps with and without our extensions. © 2011 Springer-Verlag.
CITATION STYLE
Nieuwenhuisen, M., Schulz, D., & Behnke, S. (2011). Exploration strategies for building compact maps in unbounded environments. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7101 LNAI, pp. 33–43). https://doi.org/10.1007/978-3-642-25486-4_4
Mendeley helps you to discover research relevant for your work.