Pathfinding in Strategy Games and Maze Solving Using A* Search AlgorithmReportar como inadecuado




Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Pathfinding algorithm addresses the problemof finding the shortest path from source to destination and avoiding obstacles.One of the greatest challenges in the design of realistic ArtificialIntelligence AI in computer games is agent movement. Pathfinding strategiesare usually employed as the core of any AI movement system. In this work, A*search algorithm is used to find the shortest path between the source and destinationon image that represents a map or a maze. Finding a path through a maze is abasic computer science problem that can take many forms. The A* algorithm iswidely used in pathfinding and graph traversal. Different map and maze imagesare used to test the system performance 100 images for each map and maze. Thesystem overall performance is acceptable and able to find the shortest pathbetween two points on the images. More than 85% images can find the shortestpath between the selected two points.

KEYWORDS

Nawaf Hazim Barnouti, Sinan Sameer Mahmood Al-Dabbagh, Mustafa Abdul Sahib Naser

Cite this paper

Barnouti, N. , Al-Dabbagh, S. and Sahib Naser, M. 2016 Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm. Journal of Computer and Communications, 4, 15-25. doi: 10.4236-jcc.2016.411002.





Autor: Nawaf Hazim Barnouti, Sinan Sameer Mahmood Al-Dabbagh, Mustafa Abdul Sahib Naser

Fuente: http://www.scirp.org/



DESCARGAR PDF




Documentos relacionados