Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps
In moving target search, the objective is to guide a hunter agent to catch a moving prey. Even though in game applications maps are always available at developing time, current approaches to moving target search do not exploit preprocessing to improve search performance. In this paper, we propose MtsCopa, an algorithm that exploits precomputed information in the form of compressed path databases (CPDs), and that is able to guide a hunter agent in both known and partially known terrain. CPDs...[Show more]
|Collections||ANU Research Publications|
|Source:||IEEE Transactions on Computational Intelligence and AI in Games|
|01_Baier_Fast_Algorithm_for_Catching_a_2015.pdf||1.07 MB||Adobe PDF||Request a copy|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.