Reduced state representation in delayed-state SLAM
Visualitza/Obre
Estadístiques de LA Referencia / Recolecta
Inclou dades d'ús des de 2022
Cita com:
hdl:2117/6377
Tipus de documentComunicació de congrés
Data publicació2009-10-11
EditorIEEE Press. Institute of Electrical and Electronics Engineers
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
Abstract
This paper introduces an approach that reduces
the size of the state and maximizes the sparsity of the information
matrix in exactly sparse delayed-state SLAM. We
propose constant time procedures to measure the distance
between a given pair of poses, the mutual information gain
for a given candidate link, and the joint marginals required for
both measures. Using these measures, we can readily identify
non redundant poses and highly informative links and use
only those to augment and to update the state, respectively.
The result is a delayed-state SLAM system that reduces both
the use of memory and the execution time and that delays
filter inconsistency by reducing the number of linearization
introduced when adding new loop closure links. We evaluate
the advantage of the proposed approach using simulations and
data sets collected with real robots.
CitacióIla, V.; Porta, J.; Andrade-Cetto, J. Reduced state representation in delayed-state SLAM. A: IEEE/RSJ International Conference on Intelligent Robots and Systems. "2009 IEEE/RSJ International Conference on Intelligent Robots and Systems". St. Louis: IEEE Press. Institute of Electrical and Electronics Engineers, 2009, p. 4919-4924.
ISBN978-1-4244-3804-4
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
1034-Reduced-state-representation.pdf | 453,8Kb | Visualitza/Obre |