Update Policy of Dense Maps: Efficient Algorithms and Sparse Representation
SPRINGER TRACTS IN ADVANCED ROBOTICS(2008)
摘要
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].
更多查看译文
关键词
sparse representation,least square,monte carlo algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要