Kalman filtering: theory and practice
Kalman filtering: theory and practice
Monte Carlo localization: efficient position estimation for mobile robots
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Robust Monte Carlo localization for mobile robots
Artificial Intelligence
Communications of the ACM - Robots: intelligence, versatility, adaptivity
Monte Carlo Localization with Mixture Proposal Distribution
Proceedings of the Seventeenth National Conference on Artificial Intelligence and Twelfth Conference on Innovative Applications of Artificial Intelligence
Robust global localization using clustered particle filtering
Eighteenth national conference on Artificial intelligence
Active mobile robot localization
IJCAI'97 Proceedings of the Fifteenth international joint conference on Artifical intelligence - Volume 2
A global localization approach based on Line-segment Relation Matching technique
Robotics and Autonomous Systems
Kullback-Leibler divergence-based global localization for mobile robots
Robotics and Autonomous Systems
Hi-index | 0.00 |
In order to achieve the autonomy of mobile robots, effective localization is a necessary prerequisite. In this paper, we propose an improved Monte Carlo localization using self-adaptive samples, abbreviated as SAMCL. This algorithm employs a pre-caching technique to reduce the on-line computational burden. Further, we define the concept of similar energy region (SER), which is a set of poses (grid cells) having similar energy with the robot in the robot space. By distributing global samples in SER instead of distributing randomly in the map, SAMCL obtains a better performance in localization. Position tracking, global localization and the kidnapped robot problem are the three sub-problems of the localization problem. Most localization approaches focus on solving one of these sub-problems. However, SAMCL solves all these three sub-problems together thanks to self-adaptive samples that can automatically separate themselves into a global sample set and a local sample set according to needs. The validity and the efficiency of our algorithm are demonstrated by experiments carried out with different intentions. Extensive experiment results and comparisons are also given in this paper.