Pathfinding in Strategy Games and Maze Solving Using A* Search Algorithm
| Autor: | Sinan Sameer Mahmood Al-Dabbagh, Mustafa Abdul Sahib Naser, Nawaf Hazim Barnouti |
|---|---|
| Rok vydání: | 2016 |
| Předmět: |
business.industry
Computer science 02 engineering and technology 010402 general chemistry 01 natural sciences 0104 chemical sciences Image (mathematics) Search algorithm Graph traversal Core (graph theory) Shortest path problem Path (graph theory) 0202 electrical engineering electronic engineering information engineering 020201 artificial intelligence & image processing Artificial intelligence Overall performance Pathfinding business |
| Zdroj: | Journal of Computer and Communications. :15-25 |
| ISSN: | 2327-5227 2327-5219 |
| DOI: | 10.4236/jcc.2016.411002 |
| Popis: | Pathfinding algorithm addresses the problem of finding the shortest path from source to destination and avoiding obstacles. One of the greatest challenges in the design of realistic Artificial Intelligence (AI) in computer games is agent movement. Pathfinding strategies are 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 destination on image that represents a map or a maze. Finding a path through a maze is a basic computer science problem that can take many forms. The A* algorithm is widely used in pathfinding and graph traversal. Different map and maze images are used to test the system performance (100 images for each map and maze). The system overall performance is acceptable and able to find the shortest path between two points on the images. More than 85% images can find the shortest path between the selected two points. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|