Strategy Representation Analysis for Patrolling Games
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00195299" target="_blank" >RIV/68407700:21230/12:00195299 - isvavai.cz</a>
Result on the web
<a href="http://www.aaai.org/ocs/index.php/SSS/SSS12/paper/viewPaper/4312" target="_blank" >http://www.aaai.org/ocs/index.php/SSS/SSS12/paper/viewPaper/4312</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Strategy Representation Analysis for Patrolling Games
Original language description
This paper considers the problem of patrolling multiple targets in a Euclidean environment by a single patrolling unit. We use game-theoretic approach and model the problem as a two-player zero-sum game in the extensive form. Based on the existing work in the domain of patrolling we propose a novel mathematical non-linear program for finding strategies in a discretized problem, in which we introduce a general concept of internal states of the patroller. We experimentally evaluate game value for the patroller for various graphs and strategy representations. The results suggest that adding internal states for the patroller yields better results in comparison to adding choice nodes in the used discretization.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
JC - Computer hardware and software
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/LH11051" target="_blank" >LH11051: Formal models and effective algorithms for the intelligent protection of transport infrastructures.</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2012
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů