An Optimized Data Association Solution for SLAM
Chunxia Zhao
- 发表年份
- 2009
- 引用次数
- 5
摘要
Joint compatibility branch and bound(JCBB) owns some disadvantages like highly computational complexity. Three improvements are introduced to optimize JCBB's performance on accuracy and computational complexity.Firstly,data association accuracy is improved with the help of mutual exclusion rule and optimization rule.Secondly,the data association is limited in potential local region,which is determined by robot pose and sensor measurement range.Thirdly,data association is adaptively realized in a divisive manner.Simulation results indicate that optimized JCBB(OJCBB) can ensure accuracy and reduce computational complexity simultaneously.Experimental results with Victoria Park Dataset indicate that the OJCBB data association results are reliable,and the computational efficiency of OJCBB is much better than mat of JCBB.
关键词
相关论文
Statistical Learning Theory
Yuhai Wu, Vladimir Vapnik
1999
Artificial intelligence: a modern approach
1995
Applied Nonlinear Control
Jean-Jacques Slotine, Weiping Li
1991
A new optimizer using particle swarm theory
R.C. Eberhart, James Kennedy
2002