ICRA 2011 Paper Abstract


Paper TuP1-InteracInterac.20

Carlone, Luca (Politecnico di Torino), Aragues, Rosario (Universidad de Zaragoza, DIIS-I3A), Castellanos, Jose A. (University of Zaragoza), Bona, Basilio (Politecnico di Torino)

A First-Order Solution to Simultaneous Localization and Mapping with Graphical Models

Scheduled for presentation during the Poster Sessions "Interactive Session II: Systems, Control and Automation" (TuP1-InteracInterac), Tuesday, May 10, 2011, 13:40−14:55, Hall

2011 IEEE International Conference on Robotics and Automation, May 9-13, 2011, Shanghai International Conference Center, Shanghai, China

This information is tentative and subject to change. Compiled on April 2, 2020

Keywords SLAM, Service Robots, Wheeled Robots


In this work we investigate the problem of Simultaneous Localization And Mapping (SLAM) for the case in which the information acquired by the robot is modeled as a network of constraints in a graphical model. Analyzing the resulting formulation we propose a closed-form approach to tackle the problem, which is proved to retrieve a first-order approximation of the actual non-linear solution, under mild assumptions on the structure of the involved covariance matrices. The outcome of the analysis reveals several desirable properties of the proposed approach: no initial guess for optimization is needed and the technique is able to correctly estimate robot posterior also in presence of arbitrarily long loops. The approach is further validated by means of extensive simulations and real tests, and the consistency of the estimation process is also evaluated. We remark that this work is not intended to extend the already crowded literature on SLAM but is aimed at providing a consistent analytical insight, useful for efficiently attacking several open research issues, like active SLAM and exploration, for which the computational cost of simulating SLAM posterior still constitutes a troublesome bottleneck.



Technical Content © IEEE Robotics & Automation Society

This site is protected by copyright and trademark laws under US and International law.
All rights reserved. © 2002-2020 PaperCept, Inc.
Page generated 2020-04-02  12:40:25 PST  Terms of use