Abstract
Many instances of the mobile robot guidance mapping problem exhibit a topology that can be represented as a graph of nodes (observations) connected by edges (poses). We show that a cycle basis of this pose network can be used to generate the independent constraint equations in a natural constrained optimization formulation of the mapping problem. Explicit reasoning about the loop topology of the network can automatically generate such a cycle basis in linear time. Furthermore, in many practical cases, the pose network has sparse structure and the associated equations can then be solved in time linear in the number of images. This approach can be used to construct globally consistent maps on very large scales in very limited computation. While the technique is applicable to mapbuilding in general, and even optimization in general, it is illustrated here for batch processing of 2D ladar scans into a mobile robot guidance map.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kelly, A., Unnikrishnan, R. (2005). Efficient Construction of Globally Consistent Ladar Maps Using Pose Network Topology and Nonlinear Programming. In: Dario, P., Chatila, R. (eds) Robotics Research. The Eleventh International Symposium. Springer Tracts in Advanced Robotics, vol 15. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11008941_8
Download citation
DOI: https://doi.org/10.1007/11008941_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23214-8
Online ISBN: 978-3-540-31508-7
eBook Packages: EngineeringEngineering (R0)