Conference paper
A comparison study on the reduction of search space using frame node technique for simulation and computer games
2011 International Conference on Machine Learning and Cybernetics, pp.1617-1621
IEEE
International Conference on Machine Learning and Cybernetics, ICMLC 2011 (Guilin, China, 10/07/2011–13/07/2011)
2011
Abstract
In simulation and computer game domains, two issues related to pathfinding problems are search algorithm and search space. This paper describes and compares four techniques used for the reduction of search space generation in 2-D simulation and game world environments. In order to improve the computational overheads, reducing size of search space is necessary. The size of search space is related to the number of nodes and edges. A high number of nodes and edges will have implications on the usage of computer memory. Therefore, reducing the number of nodes and edges will bring direct benefits to the memory usage and reduction of the search time. In this study, four techniques for the reduction of search space size are compared and investigated. In this paper, frame nodes used in the hierarchical adaptive flood filled (HAFF) technique is presented. This paper also presents the comparison results from the application of four hierarchical search spaces.
Details
- Title
- A comparison study on the reduction of search space using frame node technique for simulation and computer games
- Authors/Creators
- S. Pongphankae (Author/Creator) - Murdoch UniversityC.C. Fung (Author/Creator) - Murdoch University
- Publication Details
- 2011 International Conference on Machine Learning and Cybernetics, pp.1617-1621
- Conference
- International Conference on Machine Learning and Cybernetics, ICMLC 2011 (Guilin, China, 10/07/2011–13/07/2011)
- Publisher
- IEEE
- Identifiers
- 991005542040307891
- Copyright
- © 2011 IEEE
- Murdoch Affiliation
- School of Information Technology
- Language
- English
- Resource Type
- Conference paper
Metrics
322 File views/ downloads
92 Record Views