A convex relaxation for approximate global optimization in simultaneous localization and mapping
Modern approaches to simultaneous localization and mapping (SLAM) formulate the inference problem as a high-dimensional but sparse nonconvex M-estimation, and then apply general first- or second-order smooth optimization methods to recover a local minimizer of the objective function. The performance...
Main Authors: | DuHadway, Charles, Rosen, David Matthew, Leonard, John J |
---|---|
Other Authors: | Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory |
Format: | Article |
Language: | en_US |
Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2017
|
Online Access: | http://hdl.handle.net/1721.1/107496 https://orcid.org/0000-0001-8964-1602 https://orcid.org/0000-0002-8863-6550 |
Similar Items
-
Simultaneous local and global state estimation for robotic navigation
by: Moore, David C., et al.
Published: (2010) -
Polyhedral approximation in mixed-integer convex optimization
by: Yamangil, Emre, et al.
Published: (2018) -
Simultaneous stochastic mapping and localization
by: Feder, Hans Jacob Sverdrup
Published: (2005) -
A Unifying Polyhedral Approximation Framework for Convex Optimization
by: Bertsekas, Dimitri P., et al.
Published: (2011) -
On the approximability of adjustable robust convex optimization under uncertainty
by: Bertsimas, Dimitris J., et al.
Published: (2014)