详细信息

Autonomous Exploration and Map Construction of a Mobile Robot Based on the TGHM Algorithm  ( SCI-EXPANDED收录 EI收录)  

文献类型:期刊文献

英文题名:Autonomous Exploration and Map Construction of a Mobile Robot Based on the TGHM Algorithm

作者:Liu, Shuang[1];Li, Shenghao[1];Pang, Luchao[1];Hu, Jiahao[1];Chen, Haoyao[2];Zhang, Xiancheng[1]

机构:[1]East China Univ Sci & Technol, Sch Mech & Power Engn, Shanghai 200030, Peoples R China;[2]Harbin Inst Technol Shenzhen, Sch Mech Engn & Automat, Shenzhen 518055, Peoples R China

年份:2020

卷号:20

期号:2

外文期刊名:SENSORS

收录:;EI(收录号:20200408086779);WOS:【SCI-EXPANDED(收录号:WOS:000517790100164)】;

基金:This research was sponsored by the National Key Research and Development Program of China (2018YFC1902405), the National Natural Science Foundation of China (No. U1713206, 51975214, and 51725503), Innovation Program of Shanghai Municipal Education Commission (2019-01-07-00-02-E00068), and Shenzhen Peacock Team Program (NO. KQTD20140630150243062).

语种:英文

外文关键词:LIDAR detection; space exploration; topology; simultaneous localization and mapping

摘要:An a priori map is often unavailable for a mobile robot in a new environment. In a large-scale environment, relying on manual guidance to construct an environment map will result in a huge workload. Hence, an autonomous exploration algorithm is necessary for the mobile robot to complete the exploration actively. This study proposes an autonomous exploration and mapping method based on an incremental caching topology-grid hybrid map (TGHM). Such an algorithm can accomplish the exploration task with high efficiency and high coverage of the established map. The TGHM is a fusion of a topology map, containing the information gain and motion cost for exploration, and a grid map, representing the established map for navigation and localization. At the beginning of one exploration round, the method of candidate target point generation based on geometry rules are applied to extract the candidates quickly. Then, a TGHM is established, and the information gain is evaluated for each candidate topology node on it. Finally, the node with the best evaluation value is selected as the next target point and the topology map is updated after each motion towards it as the end of this round. Simulations and experiments were performed to benchmark the proposed algorithm in robot autonomous exploration and map construction.

参考文献:

正在载入数据...

版权所有©华东理工大学 重庆维普资讯有限公司 渝B2-20050021-7 
渝公网安备 50019002500408号 违法和不良信息举报中心