2009 Fifth International Joint Conference on INC, IMS and IDC 2009
DOI: 10.1109/ncm.2009.371
|View full text |Cite
|
Sign up to set email alerts
|

An Efficient Hardware Architecture of the A-star Algorithm for the Shortest Path Search Engine

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
4
0

Year Published

2011
2011
2022
2022

Publication Types

Select...
6
2
1

Relationship

0
9

Authors

Journals

citations
Cited by 21 publications
(4 citation statements)
references
References 2 publications
0
4
0
Order By: Relevance
“…For the testing location a starting point and an endpoint can be defined. We integrated a path planning algorithm [ 26 , 27 ], which calculates a path between these two points. For the AR navigation scenario, arrows were placed along the path.…”
Section: Methodsmentioning
confidence: 99%
“…For the testing location a starting point and an endpoint can be defined. We integrated a path planning algorithm [ 26 , 27 ], which calculates a path between these two points. For the AR navigation scenario, arrows were placed along the path.…”
Section: Methodsmentioning
confidence: 99%
“…To summarize, see Table 3 for a list of A* and its variants used in path planning within static and dynamic contexts. Importantly, the A* algorithm is computationally efficient [43,44]. This makes it suitable for applications deployed in static environments.…”
Section: Function Equationmentioning
confidence: 99%
“…[8], a time window method based task assignment and the A‐star algorithm Ref. [9] based path planning are jointly proposed, the conflict problem of AGVs has been solved, but, the path environment is just formulated through using a very simply way, which is unrealistic and reduces the capability of the work; in Ref. [10], an algebraic algorithm is used to plan the path for the AGVs, however, in this paper, task assignment has not been considered and the path environment is just presented by using an acyclic graph; in Ref.…”
Section: Introductionmentioning
confidence: 99%