Return to search

Game tree search algorithms for the game of cops and robber

Moving target search has been given much attention during the last twenty years. It is a game in which multiple pursuers (cops) try to catch an evading agent (robber) and also known as the game of cops and robber.
Within this thesis we study a discrete alternating version played on a graph with given initial positions for the cops and the robber, providing a number of results for optimal and sub-optimal approaches to the game.

Identiferoai:union.ndltd.org:LACETR/oai:collectionscanada.gc.ca:AEU.10048/642
Date11 1900
CreatorsMoldenhauer, Carsten
ContributorsSchaeffer Jonathan (Computing Science), Sturtevant, Nathan (Computing Science), Mueller, Martin (Computing Science), Kouritzin, Mike (Mathematical and Statistical Sciences)
Source SetsLibrary and Archives Canada ETDs Repository / Centre d'archives des thèses électroniques de Bibliothèque et Archives Canada
LanguageEnglish
Detected LanguageEnglish
TypeThesis
Format1519334 bytes, application/pdf
Relationhttp://www.ifaamas.org/Proceedings/aamas09/pdf/02_Extended_Abstract/C_SP_0680.pdf, http://ijcai.org/papers09/Papers/IJCAI09-103.pdf

Page generated in 0.0017 seconds