English   español  
Please use this identifier to cite or link to this item: http://hdl.handle.net/10261/30510
logo share SHARE logo core CORE   Add this article to your Mendeley library MendeleyBASE

Visualizar otros formatos: MARC | Dublin Core | RDF | ORE | MODS | METS | DIDL
Exportar a otros formatos:

Information-based compact Pose SLAM

AuthorsIla, Viorela ; Porta, Josep M. ; Andrade-Cetto, Juan
KeywordsInformation filter
Information gain
Interval arithmetic
Atate recovery
Tree-based data association
Issue Date2010
PublisherInstitute of Electrical and Electronics Engineers
CitationIEEE Transactions on Robotics 26(1): 78-93 (2010).
AbstractPose SLAM is the variant of simultaneous localization and map building (SLAM) is the variant of SLAM, in which only the robot trajectory is estimated and where landmarks are only used to produce relative constraints between robot poses. To reduce the computational cost of the information filter form of Pose SLAM and, at the same time, to delay inconsistency as much as possible, we introduce an approach that takes into account only highly informative loop-closure links and nonredundant poses. This approach includes constant time procedures to compute the distance between poses, the expected information gain for each potential link, and the exact marginal covariances while moving in open loop, as well as a procedure to recover the state after a loop closure that, in practical situations, scales linearly in terms of both time and memory. Using these procedures, the robot operates most of the time in open loop, and the cost of the loop closure is amortized over long trajectories. This way, the computational bottleneck shifts to data association, which is the search over the set of previously visited poses to determine good candidates for sensor registration. To speed up data association, we introduce a method to search for neighboring poses whose complexity ranges from logarithmic in the usual case to linear in degenerate situations. The method is based on organizing the pose information in a balanced tree whose internal levels are defined using interval arithmetic. The proposed Pose-SLAM approach is validated through simulations, real mapping sessions, and experiments using standard SLAM data sets.
Publisher version (URL)http://dx.doi.org/10.1109/TRO.2009.2034435
Appears in Collections:(IRII) Artículos
Files in This Item:
File Description SizeFormat 
Information-based compact.pdf2,17 MBAdobe PDFThumbnail
Show full item record
Review this work

Related articles:

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