Please use this identifier to cite or link to this item:
logo share SHARE BASE
Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL | DATACITE

Stochastic state estimation for simultaneous localization and map building in mobile robotics

AuthorsAndrade-Cetto, Juan CSIC ORCID ; Vidal-Calleja, Teresa A.; Sanfeliu, Alberto CSIC ORCID
Issue Date2005
PublisherPro Literatur Verlag
AbstractThe study of stochastic models for Simultaneous Localization and Map Building (SLAM) in mobile robotics has been an active research topic for over fifteen years. Within the Kalman filter (KF) approach to SLAM, seminal work (Smith and Cheeseman, 1986) suggested that as successive landmark observations take place, the correlation between the estimates of the location of such landmarks in a map grows continuously. This observation was later ratified (Dissanayake et al., 2001) with a proof showing that the estimated map converges monotonically to a relative map with zero uncertainty. They also showed how the absolute accuracy of the map reaches a lower bound defined only by the initial vehicle uncertainty, and proved it for a one-landmark vehicle with no process noise. From an estimation theoretic point of view, we address these results as a consequence of partial observability. We show that error free reconstruction of the map state vector is not possible with typical measurement models, regardless of the vehicle model chosen, and show experimentally that the expected error in state estimation is proportional to the number of landmarks used. Error free reconstruction is only possible once full observability is guaranteed.
DescriptionEn Cutting Edge Robotics, 223-242. Advanced Robotic Systems Press, 2005.
Appears in Collections:(IRII) Libros y partes de libros

Files in This Item:
File Description SizeFormat
doc1.pdf882,13 kBAdobe PDFThumbnail
Show full item record
Review this work

Page view(s)

checked on May 24, 2022


checked on May 24, 2022

Google ScholarTM


WARNING: Items in Digital.CSIC are protected by copyright, with all rights reserved, unless otherwise indicated.