Update Policy of Dense Maps: efficient algorithms and sparse representation

Manuel Yguel 1 Olivier Aycard 1 Christian Laugier 1
1 E-MOTION - Geometry and Probability for Motion and Action
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
Abstract : Providing a robot with a fully detailed map is one appealing key for the Simultaneous Localisation and Mapping (SLAM) problem. It gives the robot a lot of hints to solve either the data association or the localisation problem itself. The more details are in the map, the more chances are that different places may appear differently, solving ambiguities. The more landmarks are used, the more accurate are the algorithms that solve the localisation problem since in a least square sense an approximation of the solution is more precise. Last, it helps a lot in the presence of a few dynamic objects because these moving parts of the environment remain marginal in the amount of data used to model the map and can thus be filtered out. For instance, the moving objects can be detected or cancelled in the localisation procedure by robust techniques using Monte-Carlo algorithms or RANSAC .
Document type :
Conference papers
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/inria-00199713
Contributor : Christian Laugier <>
Submitted on : Wednesday, December 19, 2007 - 1:55:40 PM
Last modification on : Friday, January 4, 2019 - 1:23:32 AM
Long-term archiving on : Monday, April 12, 2010 - 8:29:59 AM

File

fsr_97.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00199713, version 1

Collections

Citation

Manuel Yguel, Olivier Aycard, Christian Laugier. Update Policy of Dense Maps: efficient algorithms and sparse representation. 6th International Conference on Field and Service Robotics - FSR 2007, Jul 2007, Chamonix, France. ⟨inria-00199713⟩

Share

Metrics

Record views

530

Files downloads

674