2017
DOI: 10.2514/1.g002607
|View full text |Cite
|
Sign up to set email alerts
|

Reciprocal Geometric Conflict Resolution on Unmanned Aerial Vehicles by Heading Control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2018
2018
2024
2024

Publication Types

Select...
7
1
1

Relationship

1
8

Authors

Journals

citations
Cited by 22 publications
(11 citation statements)
references
References 14 publications
0
11
0
Order By: Relevance
“…[18] apply a speed change method to solve conflicts but are limited by frontal conflicts and uncertainties. In a similar way, [19], [20] use speed and heading changes restricted to 2D; hence they do not consider any altitude change. In the AgentFly project, [21], [22] propose decentralized algorithms for collision avoidance based on game theory, but they do not consider a realistic UTM setting with task allocation or static obstacles.…”
Section: B Conflict Detection and Resolution (Cdr)mentioning
confidence: 99%
“…[18] apply a speed change method to solve conflicts but are limited by frontal conflicts and uncertainties. In a similar way, [19], [20] use speed and heading changes restricted to 2D; hence they do not consider any altitude change. In the AgentFly project, [21], [22] propose decentralized algorithms for collision avoidance based on game theory, but they do not consider a realistic UTM setting with task allocation or static obstacles.…”
Section: B Conflict Detection and Resolution (Cdr)mentioning
confidence: 99%
“…However, when the UAVs are outside the coordination set, since they are executing the single-agent level control law, collision avoidance is not guaranteed. In real applications, some collision avoidance algorithms such as [40] can be employed.…”
Section: And Entersmentioning
confidence: 99%
“…In recent years, many scholars have probed deep into collision avoidance approaches from different aspects [4]- [7]. Among them, the popular real-time collision avoidance algorithms include A * [8]- [9] and rapid-exploring random tree (RRT) [10]- [13], geometry-based method [14]- [17], artificial potential field (APF) [18]- [24]. The A * algorithm is a widely used heuristic search algorithm that introduces the global information to check every possible node in the shortest path, and estimates the distance of the current node to the destination, which reflects how possible it is for the current node to fall in the shortest path.…”
Section: Introductionmentioning
confidence: 99%
“…Jenie et al [16] put forward a real-time collision avoidance method based on conflict geometry, which is a tacticallevel collision avoidance strategy that prevents excessive deviation from the planned path. To solve conflicts in complex scenes, Yang et al [17] introduced spatial mapping to convert nonlinear safety distance to linear ones. However, these algorithms are not well suitable for reactive collision avoidance in dynamic airspace.…”
Section: Introductionmentioning
confidence: 99%