Abstract
We address the problem of merging multiple noisy maps in the rescue environment. The problem is tackled by performing a stochastic search in the space of possible map transformations, i.e. rotations and translations. The proposed technique, which performs a time variant Gaussian random walk, turns out to be a generalization of other search techniques like hill-climbing or simulated annealing. Numerical examples of its performance while merging partial maps built by our rescue robots are provided. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Carpin, S., & Birk, A. (2005). Stochastic map merging in rescue environments. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 3276, pp. 483–490). Springer Verlag. https://doi.org/10.1007/978-3-540-32256-6_43
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.