Informed anytime fast marching tree for asymptotically-optimal motion planning

Informed anytime fast marching tree for asymptotically-optimal motion planning

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 motio...

Full description

Saved in:
Bibliographic Details
Main Authors: Jing Xu, Kechen Song, Defu Zhang, Hongwen Dong, Yunhui Yan, Qinggang Meng
Format: Default Article
Published: 2020
Subjects:
Electrical & Electronic Engineering
Information and Computing Sciences
Engineering
Asymptotic optimality
fast marching tree
informed anytime algorithm
motion planning
Online Access:https://hdl.handle.net/2134/12302240.v1
Tags: Add Tag
No Tags, Be the first to tag this record!

Internet

https://hdl.handle.net/2134/12302240.v1

Similar Items