Mark A. Paskin

EECS Department
University of California, Berkeley
Technical Report No. UCB/CSD-02-1198
September 2002

http://www2.eecs.berkeley.edu/Pubs/TechRpts/2002/CSD-02-1198.pdf

Simultaneous Localization and Mapping is a fundamental problem in mobile robotics: while a robot navigates in an unknown environment, it must incrementally build a map of its surroundings and localize itself within that map. Traditional approaches to the problem are based upon Kalman filters, but suffer from complexity issues: first, the belief state grows quadratically in the size of the map; and second, the filtering operation can take time quadratic in the size of the map. I present a linear-space filter that maintains a tractable approximation of the filtered belief state as a thin junction tree. The junction tree grows under measurement and motion updates and is periodically "thinned" to remain tractable. The time complexity of the filter operation is linear in the size of the map. I also present simple enhancements that permit constant-time approximate filtering.

BibTeX citation:

@techreport{Paskin:CSD-02-1198,
    Author = {Paskin, Mark A.},
    Title = {Thin Junction Tree Filters for Simultaneous Localization and Mapping},
    Institution = {EECS Department, University of California, Berkeley},
    Year = {2002},
    Month = {Sep},
    URL = {http://www2.eecs.berkeley.edu/Pubs/TechRpts/2002/5825.html},
    Number = {UCB/CSD-02-1198},
    Abstract = {Simultaneous Localization and Mapping is a fundamental problem in mobile robotics: while a robot navigates in an unknown environment, it must incrementally build a map of its surroundings and localize itself within that map.  Traditional approaches to the problem are based upon Kalman filters, but suffer from complexity issues: first, the belief state grows quadratically in the size of the map; and second, the filtering operation can take time quadratic in the size of the map. I present a linear-space filter that maintains a tractable approximation of the filtered belief state as a thin junction tree. The junction tree grows under measurement and motion updates and is periodically "thinned" to remain tractable. The time complexity of the filter operation is linear in the size of the map. I also present simple enhancements that permit constant-time approximate filtering.}
}

EndNote citation:

%0 Report
%A Paskin, Mark A.
%T Thin Junction Tree Filters for Simultaneous Localization and Mapping
%I EECS Department, University of California, Berkeley
%D 2002
%@ UCB/CSD-02-1198
%U http://www2.eecs.berkeley.edu/Pubs/TechRpts/2002/5825.html
%F Paskin:CSD-02-1198