计算机科学
渐近最优算法
运动规划
稳健性(进化)
数学优化
算法
树(集合论)
适应性
采样(信号处理)
机器人
人工智能
数学
计算机视觉
基因
化学
数学分析
滤波器(信号处理)
生物
生物化学
生态学
作者
Jing Xu,Kechen Song,Hongwen Dong,Yunhui Yan
标识
DOI:10.1016/j.eswa.2019.113124
摘要
Practical applications favor anytime asymptotically-optimal algorithms that find and improve an initial solution toward the optimal solution as quickly as possible due to the algorithms may be terminated at any time. We present Batch-to-batch Informed Fast Marching Tree (BBI-FMT*), an anytime asymptotically-optimal sampling-based algorithm that is designed for solving complex motion planning problems. The proposed algorithm has the ability to fast find an initial low-cost solution by the batch sampling-based incremental search and the “lazy” optimal search, then it employs the batch informed sampling-based incremental search and the anytime optimal search to quickly improve the tree and achieve the optimal solution. The proposed anytime optimal search strategy integrates the “lazy” and “non-lazy” optimal search to efficiently improve the tree to the minimum-cost spanning tree in cluttered environments. This paper theoretically analyzes the proposed algorithm in depth and evaluates it by numerical experiments under a few challenging scenarios. The experimental results show that BBI-FMT* outperforms the state-of-the-art algorithms in the self-adaptability, robustness, convergence rate, and success rate of the planning. The proposed algorithm can be widely applied to intelligent robots with expert systems to improve the efficiency and stability of the motion planning and navigation modules which are the core modules in the expert systems.
科研通智能强力驱动
Strongly Powered by AbleSci AI