Research on Complex Multiconstraint Path Planning Based on ACA Hybrid Algorithm

Aiming at the multiconstraint complex problem of path planning, a hybrid algorithm with fast convergence and fast obstacle avoidance is proposed. According to the actual aircraft, a multiconstrained path cost model with seven components is constructed and defined the parameters and penalty factors o...

Full description

Saved in:
Bibliographic Details
Published in:International journal of aerospace engineering 2022-06, Vol.2022, p.1-12
Main Authors: Wang, Hongyun, Gao, Min, Gao, Weiwei, Li, Wenzhao
Format: Article
Language:English
Subjects:
Aerospace engineering
Aircraft
Algorithms
Altitude
Artificial intelligence
Collaboration
Convergence
Cost function
Disadvantages
Obstacle avoidance
Optimization
Parameter sensitivity
Planning
Potential fields
Smoothness
Trajectory planning
Unmanned aerial vehicles
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Aiming at the multiconstraint complex problem of path planning, a hybrid algorithm with fast convergence and fast obstacle avoidance is proposed. According to the actual aircraft, a multiconstrained path cost model with seven components is constructed and defined the parameters and penalty factors of each part. To improve the sensitivity of each part of the trace planning cost function, according to the inconsistency of the cost index unit and measurement range, the expert scoring method is used to configure and normalize the index with weight. Make full advantage of the ACO algorithm and the artificial potential field algorithm to form the ACA hybrid algorithm, a pheromone heuristic function improvement method is proposed, and a control factor is introduced. The proposed model and planning algorithm are simulated based on the MATLAB platform environment, and it is shown by simulations that the hybrid algorithm has obvious advantages in terms of motion trajectory smoothness, number of iterations, and minimum path cost .It well solved the practical application problem of fast path planning convergence and fast avoiding obstacles in the complex environment.
ISSN:1687-5966
1687-5974
DOI:10.1155/2022/8406307