Details

Autor(en) / Beteiligte

• Grisetti, G.
• Lodi Rizzini, D.
• Stachniss, C.
• Olson, E.
• Burgard, W.

Titel

Online constraint network optimization for efficient maximum likelihood map learning

Ist Teil von

• 2008 IEEE International Conference on Robotics and Automation, 2008, p.1880-1885

Ort / Verlag

IEEE

Erscheinungsjahr

2008

Quelle

IEEE Xplore

Beschreibungen/Notizen

• In this paper, we address the problem of incrementally optimizing constraint networks for maximum likelihood map learning. Our approach allows a robot to efficiently compute configurations of the network with small errors while the robot moves through the environment. We apply a variant of stochastic gradient descent and use a tree-based parameterization of the nodes in the network. By integrating adaptive learning rates in the parameterization of the network, our algorithm can use previously computed solutions to determine the result of the next optimization run. Additionally, our approach updates only the parts of the network which are affected by the newly incorporated measurements and starts the optimization approach only if the new data reveals inconsistencies with the network constructed so far. These improvements yield an efficient solution for this class of online optimization problems. Our approach has been implemented and tested on simulated and on real data. We present comparisons to recently proposed online and offline methods that address the problem of optimizing constraint network. Experiments illustrate that our approach converges faster to a network configuration with small errors than the previous approaches.