-
摘要: The research of robot localization aims at accuracy, simplicity and robustness. This article improves the performance of particle filters in robot localization via the utilization of novel adaptive technique. The proposed algorithm introduces probability retracing to initialize particle sets, uses consecutive window filtering to update particle sets, and refreshes the size of particle set according to the estimation state. Extensive simulations show that the proposed algorithm is much more effective than the traditional particle filters. The proposed algorithm successfully solves the nonlinear, non-Gaussian state estimation problem of robot localization.Abstract: The research of robot localization aims at accuracy, simplicity and robustness. This article improves the performance of particle filters in robot localization via the utilization of novel adaptive technique. The proposed algorithm introduces probability retracing to initialize particle sets, uses consecutive window filtering to update particle sets, and refreshes the size of particle set according to the estimation state. Extensive simulations show that the proposed algorithm is much more effective than the traditional particle filters. The proposed algorithm successfully solves the nonlinear, non-Gaussian state estimation problem of robot localization.
-
Key words:
- Robot localization /
- particle filters /
- K-L distance /
- probability retrieval
计量
- 文章访问数: 2612
- HTML全文浏览量: 68
- PDF下载量: 2095
- 被引次数: 0