2019 Third International Conference on Intelligent Computing in Data Sciences (ICDS) 2019
DOI: 10.1109/icds47004.2019.8942279
|View full text |Cite
|
Sign up to set email alerts
|

Parallel implementation of A* search algorithm for road network

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(1 citation statement)
references
References 9 publications
0
1
0
Order By: Relevance
“…where g(n) is the actual cost from node n to the initial node, and h(n) is the cost of the optimal path from the target node to n. The A* algorithm is widely used in the gaming industry [26], and with the development of artificial intelligence, the A* algorithm has since been improved and tailored for applications, including robot path planning, urban intelligent transportation, graph theory, and automatic control [27][28][29][30][31].…”
Section: A* Algorithmmentioning
confidence: 99%
“…where g(n) is the actual cost from node n to the initial node, and h(n) is the cost of the optimal path from the target node to n. The A* algorithm is widely used in the gaming industry [26], and with the development of artificial intelligence, the A* algorithm has since been improved and tailored for applications, including robot path planning, urban intelligent transportation, graph theory, and automatic control [27][28][29][30][31].…”
Section: A* Algorithmmentioning
confidence: 99%