Two phase solution for an intelligent moving target search problem based on a 0–1 linear model

2014 ◽  
Vol 52 (24) ◽  
pp. 7177-7192
Author(s):  
Boris Detienne ◽  
Dominique Quadri ◽  
Carlos-Diego Rodrigues
2009 ◽  
Author(s):  
Peter K. K. Loh ◽  
Rahul Bhasker ◽  
Edmond C. Prakash

2019 ◽  
Vol 105 ◽  
pp. 132-140
Author(s):  
Manon Raap ◽  
Michael Preuß ◽  
Silja Meyer-Nieberg

2009 ◽  
Author(s):  
Peter K. K. Loh ◽  
Rahul Bhasker ◽  
Edmond C. Prakash

2009 ◽  
Vol 2009 ◽  
pp. 1-6 ◽  
Author(s):  
Peter K. K. Loh ◽  
Edmond C. Prakash

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.


Sign in / Sign up

Export Citation Format

Share Document