Informed anytime fast marching tree for asymptotically-optimal motion planning
journal contributionposted on 2020-05-15, 08:28 authored by Jing Xu, Kechen Song, Defu Zhang, Hongwen Dong, Yunhui Yan, Qinggang MengQinggang Meng
In many applications, it is necessary for motion planning planners to get high-quality solutions in high-dimensional complex problems. In this paper, we propose an anytime asymptotically-optimal sampling-based algorithm, namely Informed Anytime Fast Marching Tree (IAFMT*), designed for solving motion planning problems. Employing a hybrid incremental search and a dynamic optimal search, the IAFMT* fast finds a feasible solution, if time permits, it can efficiently improve the solution toward the optimal solution. This paper also presents the theoretical analysis of probabilistic completeness, asymptotic optimality, and computational complexity on the proposed algorithm. Its ability to converge to a high-quality solution with the efficiency, stability, and self-adaptability has been tested by challenging simulations and a humanoid mobile robot.
National Natural Science Foundation of China (51805078, 51374063)
National Key Research and Development Program of China (2017YFB0304200)
- Computer Science
Published inIEEE Transactions on Industrial Electronics
Pages5068 - 5077
PublisherInstitute of Electrical and Electronics Engineers (IEEE)
- AM (Accepted Manuscript)
Rights holder© IEEE
Publisher statementPersonal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.