F-RRT: An improved path planning algorithm with improved initial solution and convergence rate

•A tree-extending algorithm for reducing the solution cost is presented.•Generating nodes essential to the optimal path with smaller samples.•Searching for ancestors of the nearest vertex instead of nodes around the random point.•Connecting the random point to the furthest vertex of the tree it can...

Full description

Bibliographic Details

Published in:	Expert systems with applications Vol. 184; p. 115457
Main Authors:	Liao, Bin, Wan, Fangyi, Hua, Yi, Ma, Ruirui, Zhu, Shenrui, Qing, Xinlin
Format:	Journal Article
Language:	English
Published:	New York Elsevier Ltd 01.12.2021 Elsevier BV
Subjects:	Algorithms Apexes Convergence Motion planning Optimal path planning Optimization Path planning Rapidly-exploring random tree (RRT) Sampling Sampling-based algorithms Path planning Rapidly-exploring random tree (RRT) Optimal path planning Sampling-based algorithms
ISSN:	0957-4174, 1873-6793
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!