Paper Info
Title
Novel moving target search algorithms for computer gaming
Abstract
In a computer game, equipping a bot with a suitable algorithm to locate a human player is difficult. Besides the unpredictable moves made by the player, an unexplored map region poses additional constraints such as new obstacles and pathways that the bot needs to discover quickly. The design criteria of such moving target search (MTS) algorithms would typically need to consider computation efficiency and storage requirements. That is, the bot must appear to be “smart” and “quick” in order to enhance the playability and challenge posed by the game. These criteria, however, pose conflicting requirements. In this article, we study and evaluate the performance and behavior of two novel MTS algorithms, Fuzzy MTS and Abstraction MTS, against existing MTS algorithms in randomly generated mazes of increasing size. Simulations reveal that Fuzzy MTS and Abstraction MTS exhibit competitive performance even with large problem spaces.
Year
DOI
Venue
2009
10.1145/1541895.1541907
Computers in Entertainment
Keywords
Field
DocType
performance simulation,computer game,human player,abstraction mts exhibit,novel mts algorithm,game ai,target search algorithm,mts algorithm,computation efficiency,fuzzy mts,computer gaming,fuzzy,abstraction,competitive performance,additional constraint,moving target search,abstraction mts,search algorithm
Computer gaming,Moving target search,Abstraction,Computer science,Fuzzy logic,Algorithm,Artificial intelligence,Computation
Journal
Volume
Issue
Citations 
7
2
3
PageRank 
References 
Authors
0.38
5
2
Name
Order
Citations
PageRank
Peter K. K. Loh1639.70
Edmond C. Prakash210214.60