A Variable-Step RRT Path Planning Algorithm for Quadrotors in Below-Canopy

Rapidly-exploring random tree (RRT * ) algorithm has been widely applied to path planning problem for quadrotor, which takes a great amount of static and dynamic constraints into account. However, conventional RRT * algorithm is suffering low convergence rate and efficiency in below-canopy environme...

Full description

Saved in:
Bibliographic Details
Published in:IEEE access 2020, Vol.8, p.62980-62989
Main Authors: Liu, Ben, Feng, Wenzhao, Li, Tingting, Hu, Chunhe, Zhang, Junguo
Format: Article
Language:English
Subjects:
Algorithms
Barriers
below-canopy environment
Canopies
Convergence
Cost function
Curves
Efficiency
Euclidean geometry
Forestry
Fuzzy logic
Heuristic algorithms
Hyperbolic functions
Kinematics
Optimization
Path planning
Potential fields
quadrotor
Rotary wing aircraft
RRT
Sampling
variable-step
Vegetation
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Rapidly-exploring random tree (RRT * ) algorithm has been widely applied to path planning problem for quadrotor, which takes a great amount of static and dynamic constraints into account. However, conventional RRT * algorithm is suffering low convergence rate and efficiency in below-canopy environment, where is usually occupied with narrow aisles and uneven distributed obstacles. In order to enrich the forest information database and obtain information efficiently in blow-canopy, an improved variable-step RRT * algorithm has been proposed in this paper. In the proposed algorithm, the sampling nodes are determined by the target bias sampling strategy with variable probability. To further increase the efficiency of node generation and balance the searching time and security in areas with different obstacles densities, the event-triggered step size extension has been proposed according to hyperbolic tangent function. After that, both Euclidean distance and angle constraints are adopted in the cost function of node connection optimization. Then, the path is further optimized by path trimming and Bezier curves smooth method. Finally, the demonstration of the proposed algorithm is presented to show its efficiency, and the comparison result with existing RRT-like algorithms indicates that the performance of our algorithm is better than RRT, RRT * and DDRRT in terms of convergence and accuracy. Comparing to other classical path planning methods such as A * , Artificial potential field and Fuzzy-logic, our method also shows its superiority.
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2020.2983177