A constrained optimization approach to globally consistent mapping

Abstract

Mobile robot localization from large-scale appearance mosaics has been showing increasing promise as a low-cost, high-performance and infrastructure free solution to vehicle-guidance in man-made environments. The generation of the globally consistent high-resolution mosaics crucial to this procedure suffers from the same problem of loop-closure in cyclic environments that is commonly encountered in all map-building procedures. This paper presents a batch solution to the problem of reliably generating globally consistent mosaics at low computational cost, that simultaneously exploits the topological constraints among the observations and minimizes the total residual in observed features. An extension to a general scalable framework that facilitates an incremental online mapping strategy is also presented, along with results using simulated data and from real indoor environments.