Skip to search boxSkip to navigationSkip to main content

Performance simulations of moving target search algorithms

  • Edmond C. Prakash
    ,
  • Peter K. K. Loh
Research Output: Contribution to journal Article Peer-review

Open access

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.

Publication Information

Output type

Research Output: Contribution to journal Article Peer-review

Original language

English

Journal (Volume, Issue Number)

International Journal of Computer Games Technology

Publication milestones

  • Published - 01/12/2008

Publication status

Published - 01/12/2008

ISSN

1687-7047

External Publication IDs

  • handle.net: 10547/223781
  • Scopus: 70349398540

Access to documents

Publication metrics

Metrics

Download statistics
Download count
1

PlumX, opens in new tab

Usage
33
14
Captures
15