Chih-Yuan Chiu and S. Shankar Sastry

EECS Department, University of California, Berkeley

Technical Report No. UCB/EECS-2021-76

May 14, 2021

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2021/EECS-2021-76.pdf

Simultaneous Localization and Mapping (SLAM) algorithms perform visual-inertial estimation via filtering or batch optimization methods. Empirical evidence suggests that filtering algorithms are computationally more efficient, while optimization methods are more accurate. This paper presents an optimization-based framework that unifies these approaches, and allows the flexible implementation of different design choices, e.g., selecting the number and types of variables maintained in the algorithm at each time. We mathematically prove that filtering methods, e.g., EKF SLAM and MSCKF, correspond to specific design choices in our generalized framework. Finally, we reformulate the MSCKF using our framework, implement the reformulation on challenging image sequences in a baseline SLAM dataset in simulation, and use the proposed re-interpretation to contrast the performance characteristics of the two classes of algorithms. Finally, we describe future extensions of our work to the dynamic SLAM problem and multi-agent planning problems.

Advisors: S. Shankar Sastry

---

BibTeX citation:

@mastersthesis{Chiu:EECS-2021-76,
    Author= {Chiu, Chih-Yuan and Sastry, S. Shankar},
    Title= {Simultaneous Localization and Mapping: A Rapprochement of Filtering and Optimization-Based Approaches},
    School= {EECS Department, University of California, Berkeley},
    Year= {2021},
    Month= {May},
    Url= {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2021/EECS-2021-76.html},
    Number= {UCB/EECS-2021-76},
    Abstract= {Simultaneous Localization and Mapping (SLAM) algorithms perform visual-inertial estimation via filtering or batch optimization methods. Empirical evidence suggests that filtering algorithms are computationally more efficient, while optimization methods are more accurate. This paper presents an optimization-based framework that unifies these approaches, and allows the flexible implementation of different design choices, e.g., selecting the number and types of variables maintained in the algorithm at each time. We mathematically prove that filtering methods, e.g., EKF SLAM and MSCKF, correspond to specific design choices in our generalized framework. Finally, we reformulate the MSCKF using our framework, implement the reformulation on challenging image sequences in a baseline SLAM dataset in simulation, and use the proposed re-interpretation to contrast the performance characteristics of the two classes of algorithms. Finally, we describe future extensions of our work to the dynamic SLAM problem and multi-agent planning problems.},
}

EndNote citation:

%0 Thesis
%A Chiu, Chih-Yuan 
%A Sastry, S. Shankar 
%T Simultaneous Localization and Mapping: A Rapprochement of Filtering and Optimization-Based Approaches
%I EECS Department, University of California, Berkeley
%D 2021
%8 May 14
%@ UCB/EECS-2021-76
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2021/EECS-2021-76.html
%F Chiu:EECS-2021-76