2016
DOI: 10.1007/s13272-016-0197-0
|View full text |Cite
|
Sign up to set email alerts
|

Integration of a visibility graph based path planning method in the ACT/FHS rotorcraft

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
7
0

Year Published

2018
2018
2021
2021

Publication Types

Select...
5
1

Relationship

0
6

Authors

Journals

citations
Cited by 9 publications
(7 citation statements)
references
References 10 publications
0
7
0
Order By: Relevance
“…the turning angle, the slope angle, and the flight height. The constraint function C is defined as 3 v=1 C v (P) = C collision (P) + C turning (P) + C slope (P) (10) where C collision (•) is used to penalize the routes that collide with the ground, C turning (•) penalizes the routes requiring larger turning angle than the maximum available turning angle, and C slope (•) penalizes the routes requiring slope angle beyond the given slope angle. The constraint function of a flight route is depicted in detail as follows:…”
Section: B Constrain Function Of Flight Routementioning
confidence: 99%
See 1 more Smart Citation
“…the turning angle, the slope angle, and the flight height. The constraint function C is defined as 3 v=1 C v (P) = C collision (P) + C turning (P) + C slope (P) (10) where C collision (•) is used to penalize the routes that collide with the ground, C turning (•) penalizes the routes requiring larger turning angle than the maximum available turning angle, and C slope (•) penalizes the routes requiring slope angle beyond the given slope angle. The constraint function of a flight route is depicted in detail as follows:…”
Section: B Constrain Function Of Flight Routementioning
confidence: 99%
“…At present, there are three classes of approaches to solve offline path planning problem. The first type is based on graph algorithms, such as Voronoi diagram [9] and Visibility Graph approach [10], [11]. However, the kinematic and dynamic constraints of UAV are unable to be taken into account based on graph algorithms.…”
Section: Introductionmentioning
confidence: 99%
“…As curves or straight lines are used for constructing PRMs, a robot may go anywhere in its free space. Visibility graph [15][16][17] and Voronoi diagram [18][19][20] are two typical road-map approaches, which have achieved better results with dramatically various types of roads. RRT algorithms randomly build a space-filling tree to efficiently handle problems with obstacles and differential constraints by searching nonconvex and high-dimensional spaces [21].…”
Section: Related Workmentioning
confidence: 99%
“…The takeoff planning was tested successfully in the ground-based system simulator which motivates future flight tests. The approach is planned from level flight at constant altitude to the final hover point [27,28]. The standard approach uses an airpath inclination angle between −8 • and −12 • .…”
Section: Path Planning Algorithmsmentioning
confidence: 99%