5 search results - page 1 / 1 » A Proof for the Approximate Sparsity of SLAM Information Mat... |
ICRA
2005
IEEE
13 years 9 months ago
2005
IEEE
— For the Simultaneous Localization and Mapping problem several efficient algorithms have been proposed that make use of a sparse information matrix representation (e.g. SEIF, T...
AROBOTS
2006
13 years 4 months ago
2006
This paper aims at a discussion of the structure of the SLAM problem. The analysis is not strictly formal but based both on informal studies and mathematical derivation. The first ...
MP
2002
13 years 3 months ago
2002
In this paper we describe an automatic procedure for successively reducing the set of possible nonzeros in a Jacobian matrix until eventually the exact sparsity pattern is obtained...
IJRR
2007
13 years 4 months ago
2007
Recent research concerning the Gaussian canonical form for Simultaneous Localization and Mapping (SLAM) has given rise to a handful of algorithms that attempt to solve the SLAM sc...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...