Update Policy of Dense Maps: efficient algorithms and sparse representation - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Communication Dans Un Congrès Année : 2007

Update Policy of Dense Maps: efficient algorithms and sparse representation

Résumé

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 .
Fichier principal
Vignette du fichier
fsr_97.pdf (1.18 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

inria-00199713 , version 1 (19-12-2007)

Identifiants

  • HAL Id : inria-00199713 , version 1

Citer

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⟩
264 Consultations
850 Téléchargements

Partager

Gmail Facebook X LinkedIn More