Proceedings of the 2015 International Conference on Electrical, Computer Engineering and Electronics 2015
DOI: 10.2991/icecee-15.2015.140
|View full text |Cite
|
Sign up to set email alerts
|

A optimization of A* algorithm to make it close to human pathfinding behavior

Abstract: A* algorithm is considered to be the optimal heuristic search algorithm over time. But the biggest drawback is the consumption of resources as the growth risk of the processing scale is a exponential level. This article based on common sense reasoning of artificial intelligence and the vector calculation of mathematics put forward three strategies to optimize the number of intermediate nodes and the calculation times of heuristic function. These strategies make the computer in the process of pathfinding closer… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
1
0
1

Year Published

2016
2016
2021
2021

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(2 citation statements)
references
References 5 publications
0
1
0
1
Order By: Relevance
“… Make modifications in the A* algorithm to make the agents' movement more human like. In [28] the authors show three strategies to optimize the A* algorithm that make it close to human pathfinding behavior.…”
Section: Future Workmentioning
confidence: 99%
“… Make modifications in the A* algorithm to make the agents' movement more human like. In [28] the authors show three strategies to optimize the A* algorithm that make it close to human pathfinding behavior.…”
Section: Future Workmentioning
confidence: 99%
“…Dalam pembahasannya disebutkan bahwa terdapat beberapa strategi dalam optimalisasi Algoritma A star yang didasarkan pada pendekatan dengan kebiasaan manusia. Pada prosesnya tidak semua Neighbor Node selalu diakses, hanya node-node yang menjadi Key Position antara Start dan Goal saja yang harus diakses [14].…”
Section: Jurnal Ini Berjudul a Optimization Of A* Algorithm Tounclassified