期刊
IEEE ACCESS
卷 7, 期 -, 页码 162583-162597出版社
IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/ACCESS.2019.2950725
关键词
Path planning; localizability; map matching; mobile robot
资金
- National Natural Science Fund [61503043]
- Natural Science Foundation of Shaanxi Province [2019JLP-07, 2017JM7016]
- Foundation of Central University [310822172204, 3100102229103]
As a fundamental capability of mobile robots, path planning highly relies on the accurate localization of the robot. However, limited consideration for the localizability (which describes the capability of acquiring accurate localization) has been made in path planning. This brings a high risk of choosing a path that is optimal but results in the robot easily getting lost. There exist two key challenges to address this problem: 1) How to evaluate the localizability of a path and its impact on path planning. 2) How to balance the localizability of a path and the standard path planning criteria (e.g., shortest travel distance, obstacle-free path, etc.. To overcome the two challenges a new path evaluation method is required. So we first analyzed the uncertainty that comes from dead-reckoning and map matching. Then the localizability was estimated by the fusion of the uncertainty coming from both of them. Based on that, the impact of the localizability on the path planning task has been evaluated by an evaluation function. By combining the localizability evaluation function with traditional criteria (e.g., shortest length, obstacle-free path, etc.), a new path evaluation function for path planning is established. Both simulation and experimental studies show that the new path evaluation function can offer a balance between the localizability and the traditional criteria for path planning.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据