2.50
Hdl Handle:
http://hdl.handle.net/10547/223781
Title:
Performance simulations of moving target search algorithms
Authors:
Loh, Peter K. K.; Prakash, Edmond C.
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.
Citation:
Loh, P.K.K. & Prakash, E.C. (2009) 'Performance simulations of moving target search algorithms', International Journal of Computer Games Technology, pp.1-6
Publisher:
Hindawi
Journal:
International Journal of Computer Games Technology
Issue Date:
2009
URI:
http://hdl.handle.net/10547/223781
DOI:
10.1155/2009/745219
Additional Links:
http://www.hindawi.com/journals/ijcgt/2009/745219/
Type:
Article
Language:
en
ISSN:
1687-7047; 1687-7055
Appears in Collections:
Centre for Computer Graphics and Visualisation (CCGV)

Full metadata record

DC FieldValue Language
dc.contributor.authorLoh, Peter K. K.en_GB
dc.contributor.authorPrakash, Edmond C.en_GB
dc.date.accessioned2012-05-15T11:08:44Z-
dc.date.available2012-05-15T11:08:44Z-
dc.date.issued2009-
dc.identifier.citationLoh, P.K.K. & Prakash, E.C. (2009) 'Performance simulations of moving target search algorithms', International Journal of Computer Games Technology, pp.1-6en_GB
dc.identifier.issn1687-7047-
dc.identifier.issn1687-7055-
dc.identifier.doi10.1155/2009/745219-
dc.identifier.urihttp://hdl.handle.net/10547/223781-
dc.description.abstractThe 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.en_GB
dc.language.isoenen
dc.publisherHindawien_GB
dc.relation.urlhttp://www.hindawi.com/journals/ijcgt/2009/745219/en_GB
dc.rightsArchived with thanks to International Journal of Computer Games Technologyen_GB
dc.subjectmoving target search algorithmsen
dc.subjectcomputer-generated botsen
dc.titlePerformance simulations of moving target search algorithmsen
dc.typeArticleen
dc.identifier.journalInternational Journal of Computer Games Technologyen_GB
All Items in UOBREP are protected by copyright, with all rights reserved, unless otherwise indicated.