Update Policy of Dense Maps: efficient algorithms and sparse representationReport as inadecuate

Update Policy of Dense Maps: efficient algorithms and sparse representation - Download this document for free, or read online. Document in PDF available to download.

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 .

Author: Manuel Yguel - Olivier Aycard - Christian Laugier -

Source: https://hal.archives-ouvertes.fr/


Related documents