运动规划
全球定位系统
同时定位和映射
计算机科学
规划师
路径(计算)
机器人
Dijkstra算法
人工智能
移动机器人
图形
滤波器(信号处理)
最短路径问题
数学优化
计算机视觉
数学
理论计算机科学
电信
程序设计语言
作者
Zhang Shi,Rongxin Cui,Weisheng Yan,Yinglin Li
标识
DOI:10.1109/tie.2023.3288187
摘要
Robot exploration in GPS-denied environments is a significant challenge due to the lack of reliable localization strategies. In this article, we propose a dual-layer planning approach with pose SLAM for autonomous robot exploration, which consists of local and global planners. The local planner uses the iteratively built local tree to generate candidate paths, and assesses the optimal path using a utility function that trades off exploration efficiency with localization accuracy. When the local planner is unable to return the admissible paths, the global planner is engaged to search an incrementally built graph for a path, which can reposition the robot to a previously identified valuable pose. For global path searching, we improve the Dijkstra algorithm and propose a cost function that considers localization uncertainty to generate a path with low localization error. In addition, we present a mixed filter on Lie group to estimate state information of paths for planners online. Finally, the proposed method is evaluated in challenging simulations and real-world environments. Comparison experiments show that our method is more efficient than the existing methods in exploring GPS-denied environments.
科研通智能强力驱动
Strongly Powered by AbleSci AI