Skip navigation
Skip navigation

Fast Algorithm for Catching a Prey Quickly in Known and Partially Known Game Maps

Baier, Jorge; Botea, Adi; Harabor, Daniel; Hernandez, Carlos


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]

CollectionsANU Research Publications
Date published: 2015
Type: Journal article
Source: IEEE Transactions on Computational Intelligence and AI in Games
DOI: 10.1109/TCIAIG.2014.2337889


File Description SizeFormat Image
01_Baier_Fast_Algorithm_for_Catching_a_2015.pdf1.07 MBAdobe PDF    Request a copy

Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.

Updated:  19 May 2020/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator