Adaptive SLAM algorithm with sampling based on state uncertainty
Inst. of Artificial Intell. & Robot., Xi'an Jiaotong Univ., Xi'an, ChinaElectronics Letters (Impact Factor: 0.93). 03/2011; 47(4):284 - 286. DOI: 10.1049/el.2010.3476
Source: IEEE Xplore
Since the uncertainty of a robot state changes over time, proposed is an adaptive simultaneous localisation and mapping (SLAM) algorithm based on the Kullback-Leibler distance (KLD) sampling and Markov chain Monte Carlo (MCMC) move step. First, it can adaptively determine the number of required particles by calculating the KLD between the posterior distribution approximated by particles and the true posterior distribution at each step. Secondly, it introduces the MCMC move step to increase the particle variety. Both simulation and experimental results demonstrate that the proposed algorithm can obtain more robust and precise results by computing the number of required particles more accurately than previous algorithms.
Data provided are for informational purposes only. Although carefully collected, accuracy cannot be guaranteed. The impact factor represents a rough estimation of the journal's impact factor and does not reflect the actual current impact factor. Publisher conditions are provided by RoMEO. Differing provisions from the publisher's actual policy or licence agreement may be applicable.