2014
DOI: 10.1002/asjc.960
|View full text |Cite
|
Sign up to set email alerts
|

UAV Path Planning in Mixed‐Obstacle Environment via Artificial Potential Field Method Improved by Additional Control Force

Abstract: This paper deals with a UAV path planning problem in the environment where both solid obstacles and soft obstacles exist. The artificial potential field approach is updated by introducing an additional control force and integrating it with the concept of receding horizon control for UAV trajectory optimization. The original problem is converted into a multi-objective optimization problem by regarding the involved additional control term as the optimization variable. Seeing as the establishment of an additional… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2016
2016
2023
2023

Publication Types

Select...
8

Relationship

0
8

Authors

Journals

citations
Cited by 38 publications
(27 citation statements)
references
References 27 publications
0
27
0
Order By: Relevance
“…The traditional path planning methods mainly include artificial potential field methods [31], Dijkstra algorithm [32], A * algorithm [33], and so on. Path planning is an NP-hard problem.…”
Section: Route Optimizationmentioning
confidence: 99%
“…The traditional path planning methods mainly include artificial potential field methods [31], Dijkstra algorithm [32], A * algorithm [33], and so on. Path planning is an NP-hard problem.…”
Section: Route Optimizationmentioning
confidence: 99%
“…When the actual distance between formation members meet the requirement of d ij < d e < θ d , The potential energy [25] between formations is mainly repulsive, and the perturbation matrix can be launched as…”
Section: ) Definition Of Potential Energy Field Between Uav and Obstmentioning
confidence: 99%
“…The search step varies dynamically according to the distance between the node and the threat, as shown in Fig.7, In the case threats, the adaptive step size can avoid re-selecting the sampling points, which saves the search space. The formula for changing the adaptive step size shown as (25) In (25), ρ max is the maximum search step. ρ min is the minimum search step, D is the distance between the node and the threat.…”
Section: A Ibi-rrt Algorithmmentioning
confidence: 99%
“…Although individual agents can be employed to accomplish various tasks, great benefits including low cost, robustness, scalability and easy maintenance can be achieved by multi‐agent coordination. Therefore, it owns broad applications, which include rendezvous, flocking, unmanned air vehicles, multi‐robot, complex networks and so on . Consensus, formation control, optimization, task assignment, and estimation are mainly studied in multi‐agent coordination, in which, the consensus problem has become a hot topic because of its wide applications.…”
Section: Introductionmentioning
confidence: 99%