.png){kind=icon}
Return
Analytical SLAM without linearization
.png){kind=icon}
OA
AI
DOI：10.1177/0278364917710541.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
This paper solves the classical problem of simultaneous localization and mapping (SLAM) in a fashion that avoids linearized approximations altogether. Based on the creation of virtual synthetic measurements, the algorithm uses a linear time-varying Kalman observer, bypassing errors and approximations brought by the linearization process in traditional extended Kalman filtering SLAM. Convergence rates of the algorithm are established using contraction analysis. Different combinations of sensor information can be exploited, such as bearing measurements, range measurements, optical flow, or time-to-contact. SLAM-DUNK, a more advanced version of the algorithm in global coordinates, exploits the conditional independence property of the SLAM problem, decoupling the covariance matrices between different landmarks and reducing computational complexity to O(n). As illustrated in simulations, the proposed algorithm can solve SLAM problems in both 2D and 3D scenarios with guaranteed convergence rates in a full nonlinear context.
Keywords:
Simultaneous localization and mapping
contraction analysis
virtual measurement
linear time-varying Kalman filter
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
5
Papers:
2.4K
Citations:
1.5W
Organization
No organization information available
Cited Papers
Modularity, evolution, and the binding problem: a view from stability theory.png)
NEURAL NETWORKS
NEURAL NETWORKSIF6.3
PREAI
ShareSaveShareSaveAn emended description of Neofusicoccum brasiliense and characterization of Neoscytalidium and Pseudofusicoccum species associated with tropical fruit plants in northeastern BrazilPhytotaxaOAAI
PhytotaxaIF0
OAAIShareSaveShareSaveShareSaveShareSave
View more