2019 IEEE 3rd Advanced Information Management, Communicates, Electronic and Automation Control Conference (IMCEC) 2019
DOI: 10.1109/imcec46724.2019.8983841
|View full text |Cite
|
Sign up to set email alerts
|

AGV Path Planning based on Improved A-star Algorithm

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

0
32
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
6
4

Relationship

0
10

Authors

Journals

citations
Cited by 56 publications
(32 citation statements)
references
References 4 publications
0
32
0
Order By: Relevance
“…A* algorithm is not only the most effective direct search method for solving the shortest path, but also a common heuristic algorithm for many other problems. Therefore, a good heuristic function based on environment selection is crucial [ 49 ].…”
Section: Three-dimensional Distance Vector-hop (3ddv-hop) and A* Amentioning
confidence: 99%
“…A* algorithm is not only the most effective direct search method for solving the shortest path, but also a common heuristic algorithm for many other problems. Therefore, a good heuristic function based on environment selection is crucial [ 49 ].…”
Section: Three-dimensional Distance Vector-hop (3ddv-hop) and A* Amentioning
confidence: 99%
“…Traditional path planning algorithms including artificial potential field method [1], A* algorithm [2] [3], Simulated Annealing algorithm (SA) [4], and so on. These traditional path planning methods are not suitable for complex environments with various constraints.…”
Section: Introductionmentioning
confidence: 99%
“…A two-stage ant colony algorithm is also proposed to solve it [1] . Based on the characteristics of the A* algorithm, Zheng et al optimize a node search method and use an angle evaluation cost function to find the path with the least inflection point [2] . Jerald and Asokan implement a non-traditional optimization technique called the adaptive genetic algorithm to do simultaneous scheduling [3] .…”
Section: Introductionmentioning
confidence: 99%