Advanced Search
DSpace@MIT

SE-Sync: A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Group

Research and Teaching Output of the MIT Community

Show simple item record

dc.contributor.advisor John Leonard
dc.contributor.author Rosen, David M. en_US
dc.contributor.author Carlone, Luca en_US
dc.contributor.author Bandeira, Afonso S. en_US
dc.contributor.author Leonard, John J. en_US
dc.contributor.other Marine Robotics en
dc.date.accessioned 2017-02-07T23:00:06Z
dc.date.available 2017-02-07T23:00:06Z
dc.date.issued 2017-02-05
dc.identifier.uri http://hdl.handle.net/1721.1/106885
dc.description.abstract Many important geometric estimation problems naturally take the form of synchronization over the special Euclidean group: estimate the values of a set of unknown poses given noisy measurements of a subset of their pairwise relative transforms. Examples of this class include the foundational problems of pose-graph simultaneous localization and mapping (SLAM) (in robotics), camera motion estimation (in computer vision), and sensor network localization (in distributed sensing), among others. This inference problem is typically formulated as a nonconvex maximum-likelihood estimation that is computationally hard to solve in general. Nevertheless, in this paper we present an algorithm that is able to efficiently recover certifiably globally optimal solutions of the special Euclidean synchronization problem in a non-adversarial noise regime. The crux of our approach is the development of a semidefinite relaxation of the maximum-likelihood estimation whose minimizer provides an exact MLE so long as the magnitude of the noise corrupting the available measurements falls below a certain critical threshold; furthermore, whenever exactness obtains, it is possible to verify this fact a posteriori, thereby certifying the optimality of the recovered estimate. We develop a specialized optimization scheme for solving large-scale instances of this semidefinite relaxation by exploiting its low-rank, geometric, and graph-theoretic structure to reduce it to an equivalent optimization problem defined on a low-dimensional Riemannian manifold, and then design a Riemannian truncated-Newton trust-region method to solve this reduction efficiently. Finally, we combine this fast optimization approach with a simple rounding procedure to produce our algorithm, SE-Sync. Experimental evaluation on a variety of simulated and real-world pose-graph SLAM datasets shows that SE-Sync is capable of recovering certifiably globally optimal solutions when the available measurements are corrupted by noise up to an order of magnitude greater than that typically encountered in robotics and computer vision applications, and does so more than an order of magnitude faster than the Gauss-Newton-based approach that forms the basis of current state-of-the-art techniques. en_US
dc.format.extent 49 pages, 20 figures en_US
dc.relation.ispartofseries MIT-CSAIL-TR-2017-002
dc.subject Simultaneous localization and mapping (SLAM) en_US
dc.subject Maximum-likelihood estimation en_US
dc.subject Convex relaxation en_US
dc.subject Low-rank semidefinite programming en_US
dc.subject Riemannian optimization en_US
dc.title SE-Sync: A Certifiably Correct Algorithm for Synchronization over the Special Euclidean Group en_US
dc.date.updated 2017-02-07T23:00:06Z


Files in this item

Name Size Format Description
MIT-CSAIL-TR-2017 ... 1.123Mb PDF

This item appears in the following Collection(s)

Show simple item record

MIT-Mirage