2019 Chinese Automation Congress (CAC) 2019
DOI: 10.1109/cac48633.2019.8996720
|View full text |Cite
|
Sign up to set email alerts
|

Application of Improved Astar Algorithm in Global Path Planning of Unmanned Vehicles

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
11
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
5
4
1

Relationship

0
10

Authors

Journals

citations
Cited by 27 publications
(11 citation statements)
references
References 10 publications
0
11
0
Order By: Relevance
“…If the value of ℎ 𝑛 is low, the algorithm can obtain the shortest path, but the search operation is slow. If the value of ℎ 𝑛 is high, the search speed of A* algorithm will become faster, but the obtained path is not the optimal path [7]. Manhattan distance, Euclidean distance, Chebyshev distance, etc.…”
Section: Principle Of A* Algorithmmentioning
confidence: 99%
“…If the value of ℎ 𝑛 is low, the algorithm can obtain the shortest path, but the search operation is slow. If the value of ℎ 𝑛 is high, the search speed of A* algorithm will become faster, but the obtained path is not the optimal path [7]. Manhattan distance, Euclidean distance, Chebyshev distance, etc.…”
Section: Principle Of A* Algorithmmentioning
confidence: 99%
“…4 node, taking the No. 4 node to the safety exit, Since the solution of path planning is a string of node numbers from the start point to the end point, the length of the solution is different in different situations, so the firefly cannot move according to formula (3), so the reference 15 in this article is about the movement of the firefly Redesign.…”
Section: Algorithm Designmentioning
confidence: 99%
“…Zheng et al 11 combined the A * algorithm with the jump point search principle, and added the angle evaluation function to improve the search speed of the algorithm and make it find the optimal path faster. Xu et al 12 Aiming at the shortcomings of A* algorithm, such as low efficiency, poor real-time performance and no constraints, a constrained BB-A* algorithm is proposed. At the same time, restricted nodes and road sections are added in the search process of the algorithm, which makes it more meet the practical needs.…”
Section: Introductionmentioning
confidence: 99%