2022
DOI: 10.1007/s10846-022-01662-9
|View full text |Cite
|
Sign up to set email alerts
|

Real-Time Efficient Trajectory Planning for Quadrotor Based on Hard Constraints

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
3
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(3 citation statements)
references
References 21 publications
0
3
0
Order By: Relevance
“…In particular, they can be divided into offline and online algorithms [8]. The offline algorithms plan the trajectory before the takeoff; hence, they need information about the environment (such as obstacles and fly-zones) in advance [9,10]. Even though they always guarantee a feasible trajectory, these algorithms find a limited range of application, since they cannot be applied in partially unknown and/or dynamic environments where moving vehicles or other obstacles can cause a change to the planned trajectory.…”
Section: Introductionmentioning
confidence: 99%
“…In particular, they can be divided into offline and online algorithms [8]. The offline algorithms plan the trajectory before the takeoff; hence, they need information about the environment (such as obstacles and fly-zones) in advance [9,10]. Even though they always guarantee a feasible trajectory, these algorithms find a limited range of application, since they cannot be applied in partially unknown and/or dynamic environments where moving vehicles or other obstacles can cause a change to the planned trajectory.…”
Section: Introductionmentioning
confidence: 99%
“…One is flight path planning performing at a global level. Some conventional and intelligent algorithms are used for global optimal path seeking according to selected criteria (e.g., energy consumption, flight time, or operational costs minimization) and the imposed UAV dynamic and kinematic characteristics constraints [3][4][5][6][7][8][9][10][11][12][13][14][15][16][17][18][19]. In this case, the main focus is economical path seeking.…”
mentioning
confidence: 99%
“…The A* algorithm is one of the most popular graph-searching methods, using discretized spatial nodes to calculate the cost value of each traversed node to obtain the feasible path, while a heuristic function is used to search for approximate optimal solutions based on empirical rules under acceptable computational costs to find solutions [9,10]. Moreover, there are some variants of A*, such as Anytime Repairing A* (ARA) [11], Jump Point Search (JPS) [12], and Theta* [13]. Most research efforts have focused on the trade balance between optimality and computational efficiency.…”
mentioning
confidence: 99%