Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Artículo científico |
| Sprache: | en |
| Veröffentlicht: |
Universidade Federal de Santa Maria
2015
|
| Schlagworte: | |
| Online-Zugang: | https://www.redalyc.org/articulo.oa?id=467547683030 |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866578264778080256 |
|---|---|
| author | Azad Noori |
| author_facet | Azad Noori |
| contents | Simulation and Comparison of Efficency in Pathfinding algorithms in Games Azad Noori Farzad Moradi Estudios Ambientales JPS HPA IDA BIDDFS There are several routes to go from point A to point B in many computer games and computer player have to choose the best rou te. To do this, the pathfinding algorithms is u sed. Currently, several algorithms have been proposed for routing in games so that the general challenges of them is high consumption of memory and a long Execution time. Due to these problems, the development and introduction of n ew algorithms will be con tinued. At the first part of this article, in addition to basic and important used algorithms, the new algorithm BIDDFS is introduced. In the second part, these algorithms in the various modes, are simulated on 2D - Grid, and compared based on their efficen cy (memory consumption and execution time) , Simulated algorithms include: Dijkstra, Iddfs, Biddfs, Bfs (Breadth), Greedy Best First Search, Ida*, A*, Jump point search, HPA*. 2015 artículo científico 0100-8307 https://www.redalyc.org/articulo.oa?id=467547683030 en http://www.redalyc.org/revista.oa?id=4675 Ciência e Natura application/pdf Universidade Federal de Santa Maria Ciência e Natura (Brasil) Num.6-2 Vol.37 |
| format | Artículo científico |
| id | redalyc_467547683030 |
| language | en |
| publishDate | 2015 |
| publisher | Universidade Federal de Santa Maria |
| spellingShingle | Simulation and Comparison of Efficency in Pathfinding algorithms in Games Azad Noori Estudios Ambientales JPS HPA IDA BIDDFS Simulation and Comparison of Efficency in Pathfinding algorithms in Games Azad Noori Farzad Moradi Estudios Ambientales JPS HPA IDA BIDDFS There are several routes to go from point A to point B in many computer games and computer player have to choose the best rou te. To do this, the pathfinding algorithms is u sed. Currently, several algorithms have been proposed for routing in games so that the general challenges of them is high consumption of memory and a long Execution time. Due to these problems, the development and introduction of n ew algorithms will be con tinued. At the first part of this article, in addition to basic and important used algorithms, the new algorithm BIDDFS is introduced. In the second part, these algorithms in the various modes, are simulated on 2D - Grid, and compared based on their efficen cy (memory consumption and execution time) , Simulated algorithms include: Dijkstra, Iddfs, Biddfs, Bfs (Breadth), Greedy Best First Search, Ida*, A*, Jump point search, HPA*. 2015 artículo científico 0100-8307 https://www.redalyc.org/articulo.oa?id=467547683030 en http://www.redalyc.org/revista.oa?id=4675 Ciência e Natura application/pdf Universidade Federal de Santa Maria Ciência e Natura (Brasil) Num.6-2 Vol.37 |
| title | Simulation and Comparison of Efficency in Pathfinding algorithms in Games |
| topic | Estudios Ambientales JPS HPA IDA BIDDFS |
| url | https://www.redalyc.org/articulo.oa?id=467547683030 |