Solving the moving target search problem using indistinguishable searchers

2019 ◽  
Vol 275 (1) ◽  
pp. 45-52 ◽  
Author(s):  
François-Alex Bourque
Keyword(s):  
Search Problem ◽  
Moving Target ◽  
Target Search ◽  
Moving Target Search

Heuristic-Based Learning in Abstraction Moving Target Search

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

Moving target search optimization – A literature review

2019 ◽  
Vol 105 ◽  
pp. 132-140
Author(s):  
Manon Raap ◽  
Michael Preuß ◽  
Silja Meyer-Nieberg
Keyword(s):  
Literature Review ◽  
Moving Target ◽  
Target Search ◽  
Search Optimization ◽  
Moving Target Search

Heuristic-based learning in abstraction moving target search

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

scholarly journals Performance Simulations of Moving Target Search Algorithms

2009 ◽  
Vol 2009 ◽  
pp. 1-6 ◽  
Author(s):  
Peter K. K. Loh ◽  
Edmond C. Prakash
Keyword(s):  
Search Algorithms ◽  
Moving Target ◽  
Competitive Performance ◽  
Large Problem ◽  
Target Search ◽  
Moving Target Search ◽  
Novel Algorithm

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