Autonomous robotic exploration using a utility function based on R,nyi's general theory of entropy

被引:51
作者
Carrillo, Henry [1 ]
Dames, Philip [2 ]
Kumar, Vijay [3 ]
Castellanos, Jose A. [4 ]
机构
[1] Univ Sergio Arboleda, Escuela Ciencias Exactas & Ingn, Bogota, Colombia
[2] Temple Univ, Dept Mech Engn, Philadelphia, PA 19122 USA
[3] Univ Penn, Grasp Lab, Philadelphia, PA 19104 USA
[4] Univ Zaragoza, I3A, Zaragoza, Colombia
关键词
Autonomous exploration; Graph SLAM; Entropy; ACTIVE SLAM; PARTICLE FILTERS; BELIEF SPACE; UNCERTAINTY; INFORMATION; OPTIMIZATION; COVARIANCE;
D O I
10.1007/s10514-017-9662-9
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper we present a novel information-theoretic utility function for selecting actions in a robot-based autonomous exploration task. The robot's goal in an autonomous exploration task is to create a complete, high-quality map of an unknown environment as quickly as possible. This implicitly requires the robot to maintain an accurate estimate of its pose as it explores both unknown and previously observed terrain in order to correctly incorporate new information into the map. Our utility function simultaneously considers uncertainty in both the robot pose and the map in a novel way and is computed as the difference between the Shannon and the R,nyi entropy of the current distribution over maps. R,nyi's entropy is a family of functions parameterized by a scalar, with Shannon's entropy being the limit as this scalar approaches unity. We link the value of this scalar parameter to the predicted future uncertainty in the robot's pose after taking an exploratory action. This effectively decreases the expected information gain of the action, with higher uncertainty in the robot's pose leading to a smaller expected information gain. Our objective function allows the robot to automatically trade off between exploration and exploitation in a way that does not require manually tuning parameter values, a significant advantage over many competing methods that only use Shannon's definition of entropy. We use simulated experiments to compare the performance of our proposed utility function to these state-of-the-art utility functions. We show that robots that use our proposed utility function generate maps with less uncertainty and fewer visible artifacts and that the robots have less uncertainty in their pose during exploration. Finally, we demonstrate that a real-world robot using our proposed utility function is able to successfully create a high-quality map of an indoor office environment.
引用
收藏
页码:235 / 256
页数:22
相关论文
共 66 条
[51]  
Renyi Alfred., 1960, 4th Berkeley Symposium on Mathematics, Statistics and Probability, V547, P547
[52]  
Shannon Claud C., 1964, MATH THEORY COMMUNIC
[53]   A method for selecting the bin size of a time histogram [J].
Shimazaki, Hideaki ;
Shinomoto, Shigeru .
NEURAL COMPUTATION, 2007, 19 (06) :1503-1527
[54]   Online control policy optimization for minimizing map uncertainty during exploration [J].
Sim, R ;
Dudek, G ;
Roy, N .
2004 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION, VOLS 1- 5, PROCEEDINGS, 2004, :1758-1763
[55]  
Smith R., 1990, Autonomous Robot Vehicles, P167
[56]  
Stachniss C., 2004, 2004 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE Cat. No.04CH37566), P1505
[57]  
Stachniss C., 2005, P ROB SCI SYST C RSS
[58]  
Stachniss C, 2009, SPRINGER TRAC ADV RO, V55, P3
[59]  
Thrun S., 2005, PROBABILISTIC ROBOTI
[60]   FLIRT - Interest Regions for 2D Range Data [J].
Tipaldi, Gian Diego ;
Arras, Kai O. .
2010 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2010, :3616-3622