Bayesian landmark learning for mobile robot localization

被引:103
作者
Thrun, S [1 ]
机构
[1] Carnegie Mellon Univ, Dept Comp Sci, Pittsburgh, PA 15213 USA
[2] Carnegie Mellon Univ, Inst Robot, Pittsburgh, PA 15213 USA
关键词
artificial neural networks; Bayesian analysis; feature extraction; landmarks; localization; mobile robots; positioning;
D O I
10.1023/A:1007554531242
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
To operate successfully in indoor environments, mobile robots must be able to localize themselves. Most current localization algorithms lack flexibility, autonomy, and often optimality, since they rely on a human to determine what aspects of the sensor data to use in localization (e.g., what landmarks to use). This paper describes a learning algorithm, called BaLL, that enables mobile robots to learn what features/landmarks are best suited for localization, and also to train artificial neural networks for extracting them from the sensor data. A rigorous Bayesian analysis of probabilistic localization is presented, which produces a rational argument for evaluating features, for selecting them optimally, and for training the networks that approximate the optimal solution. In a systematic experimental study, BaLL outperforms two other recent approaches to mobile robot localization.
引用
收藏
页码:41 / 76
页数:36
相关论文
共 70 条
[1]  
[Anonymous], AUTONOMOUS ROBOT VEH
[2]  
[Anonymous], 1974, APPL OPTIMAL ESTIMAT
[3]  
[Anonymous], 1960, MARKOV CHAINS STATIO, DOI DOI 10.1007/978-3-642-49686-8
[4]  
[Anonymous], THESIS TECHNION HAIF
[5]  
[Anonymous], 1989, P IEEE
[6]  
[Anonymous], 1995, HDB BRAIN THEORY NEU
[7]  
BETKE M, 1993, SCR94TR474
[8]  
Borenstein J., 1996, NAVIGATING MOBILE RO
[9]  
BUHMANN J, 1995, AI MAG, V16, P31
[10]  
Burgard W, 1996, PROCEEDINGS OF THE THIRTEENTH NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE, VOLS 1 AND 2, P896