Title
A novel heat kernel based Monte Carlo localization algorithm
Abstract
A novel heat kernel based Monte Carlo localization (HK-MCL) algorithm is presented to solve the degeneracy problem of conventional Monte Carlo localization: real-time global localization requires the number of initial samples to be small, whereas global localization may fail if the number of initial samples is small. The degeneracy problem is solved by an optimization approach called heat kernel based perturbation (HK-perturbation), which moves the samples towards the high likelihood area. HK-perturbation integrates the average local density and importance weight of samples to determine each sample's perturbation probability. The strategy improves simulated annealing algorithm via an obvious form of temperature, both in time and space, with respect to average local density and importance weight of samples. Systematic empirical results in global localization based on sonar illustrate superior performance, when compared to other state-of-the-art updating of Monte Carlo localization.
Year
DOI
Venue
2004
10.1109/IROS.2004.1389783
IROS
Keywords
Field
DocType
monte carlo localization algorithm,perturbation techniques,heat kernel,simulated annealing algorithm,temperature,mobile robots,heat kernel based perturbation,path planning,monte carlo methods,real-time global localization,simulated annealing,monte carlo localization,real time
Monte Carlo method in statistical physics,Monte Carlo method,Markov chain Monte Carlo,Quasi-Monte Carlo method,Algorithm,Hybrid Monte Carlo,Dynamic Monte Carlo method,Monte Carlo integration,Monte Carlo molecular modeling,Mathematics
Conference
Volume
Issue
ISBN
3
null
0-7803-8463-6
Citations 
PageRank 
References 
0
0.34
5
Authors
3
Name
Order
Citations
PageRank
Dejun Wang100.34
JiaLi Zhao2484.68
Seok-cheol Kee312913.94