Performance simulations of moving target search algorithms
| dc.contributor.author | Loh, Peter K. K. | en_GB |
| dc.contributor.author | Prakash, Edmond C. | en_GB |
| dc.date.accessioned | 2012-05-15T11:08:44Z | |
| dc.date.available | 2012-05-15T11:08:44Z | |
| dc.date.issued | 2009 | |
| dc.identifier.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 | en_GB |
| dc.identifier.issn | 1687-7047 | |
| dc.identifier.issn | 1687-7055 | |
| dc.identifier.doi | 10.1155/2009/745219 | |
| dc.identifier.uri | http://hdl.handle.net/10547/223781 | |
| dc.description.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. | |
| dc.language.iso | en | en |
| dc.publisher | Hindawi | en_GB |
| dc.relation.url | http://www.hindawi.com/journals/ijcgt/2009/745219/ | en_GB |
| dc.rights | Archived with thanks to International Journal of Computer Games Technology | en_GB |
| dc.subject | moving target search algorithms | en |
| dc.subject | computer-generated bots | en |
| dc.title | Performance simulations of moving target search algorithms | en |
| dc.type | Article | en |
| dc.identifier.journal | International Journal of Computer Games Technology | en_GB |
| html.description.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. |
