Metrics
92 Record Views
Conference proceeding
A Faster Alternative to Traditional A* Search: Dynamically Weighted BDBOP
ICAI 2016 : proceedings of the 2016 International Conference on Artificial Intelligence
International Conference on Artificial Intelligence, ICAI 2009 : WORLDCOMP'09, 18th (Las Vegas, NV, USA, 07/25/2016–07/28/2016)
01/01/2016
Abstract
Video games are becoming more computationally complex. This requires video game designers to carefully allocate resources in order to achieve desired performance. This paper describes the development of a new alternative to traditional A* that decreases the time to find a path in three-dimensional environments. We developed a system using Unity 5.1 that allowed us to run multiple search algorithms on different environments. These tests allowed us to find the strengths and weaknesses of the variations of traditional A*. After analyzing these strengths, we defined a new alternative algorithm named Dynamically Weighted BDBOP that performed faster than A* search in our experiments. Using this search, video game developers can focus the limited resources on more complex tasks.
Related links
Details
- Title
- A Faster Alternative to Traditional A* Search
- Publication Details
- ICAI 2016 : proceedings of the 2016 International Conference on Artificial Intelligence
- Resource Type
- Conference proceeding
- Conference
- International Conference on Artificial Intelligence, ICAI 2009 : WORLDCOMP'09, 18th (Las Vegas, NV, USA, 07/25/2016–07/28/2016)
- Publisher
- CSREA Press; United States
- Copyright
- © CSREA 2016
- Identifiers
- 99380461297206600
- Academic Unit
- Office of Teaching, Learning, and Technology; College of Arts, Social Sciences, and Humanities; Center for Cybersecurity and AI
- Language
- English