Paper Info
Title
Performance simulations of moving target search algorithms
Abstract
The design of appropriate moving target search (MTS) algorithms for computer-generated bots poses serious challenges as they have to satisfy stringent requirements that include computation and execution efficiency. In this paper, we investigate the performance and behaviour of existing moving target search algorithms when applied to search-and-capture gaming scenarios. As part of the investigation, we also introduce a novel algorithm known as abstraction MTS. We conduct performance simulations with a game bot and moving target within randomly generated mazes of increasing sizes and reveal that abstraction MTS exhibits competitive performance even with large problem spaces.
Year
DOI
Venue
2009
10.1155/2009/745219
Int. J. Computer Games Technology
Keywords
Field
DocType
performance simulation,game bot,abstraction mts,gaming scenario,target search,execution efficiency,computer-generated bots,competitive performance,target search algorithm,large problem space,search algorithm
Moving target search,Abstraction,Simulation,Computer science,Algorithm,Computation
Journal
Volume
ISSN
Citations 
2009,
1687-7047
6
PageRank 
References 
Authors
0.50
6
2
Name
Order
Citations
PageRank
Peter K. K. Loh1639.70
Edmond C. Prakash210214.60