Title
Update Policy of Dense Maps: Efficient Algorithms and Sparse Representation
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 [6] or RANSAC [4].
Year
DOI
Venue
2007
10.1007/978-3-540-75404-6_3
SPRINGER TRACTS IN ADVANCED ROBOTICS
Keywords
Field
DocType
sparse representation,least square,monte carlo algorithm
Least squares,Computer vision,Moving parts,Computer science,RANSAC,Sparse approximation,Algorithm,Data association,Artificial intelligence,Robot,Simultaneous localisation and mapping,Occupancy grid mapping
Conference
Volume
ISSN
Citations 
42
1610-7438
14
PageRank 
References 
Authors
0.99
10
3
Name
Order
Citations
PageRank
Manuel Yguel11117.46
Olivier Aycard230926.57
Christian Laugier327118.03