2023
DOI: 10.3390/drones7030192
|View full text |Cite
|
Sign up to set email alerts
|

Speed-First: An Aggressive Gradient-Based Local Planner for Quadrotor Faster Flight

Abstract: Autonomous flight for quadrotors is maturing with the development of real-time local trajectory planning. However, the current local planning method is too conservative to waste the agility of the quadrotors. So in this paper, we have focused on aggressive local trajectory planning and proposed a gradient-based planning method to rapidly plan faster executable trajectories while ensuring it is collision-free. A distance gradient information generation strategy is proposed, which finds a collision-free Hybrid-A… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2024
2024
2024
2024

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(1 citation statement)
references
References 15 publications
0
1
0
Order By: Relevance
“…Although the traditional A* algorithm can calculate the shortest path, it is limited by the fixed search direction and the fixed search-step size, and the obtained path may lack smoothness. Only the distance factor can be calculated, while other factors cannot be calculated [36][37][38]. Xie et al used flexible search angle and variable search-step size, and then represented the distribution of obstacles in the form of an artificial potential field distribution, added the distance to the obstacles to the heuristic function of the A* algorithm, which could make the ship's sea-path planning away from obstacles, and finally obtained a safe sea ship A* path-planning algorithm [39].…”
Section: Introductionmentioning
confidence: 99%
“…Although the traditional A* algorithm can calculate the shortest path, it is limited by the fixed search direction and the fixed search-step size, and the obtained path may lack smoothness. Only the distance factor can be calculated, while other factors cannot be calculated [36][37][38]. Xie et al used flexible search angle and variable search-step size, and then represented the distribution of obstacles in the form of an artificial potential field distribution, added the distance to the obstacles to the heuristic function of the A* algorithm, which could make the ship's sea-path planning away from obstacles, and finally obtained a safe sea ship A* path-planning algorithm [39].…”
Section: Introductionmentioning
confidence: 99%