Computing Time-Dependent Policies for Patrolling Games with Mobile Targets

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F11%3A00183453" target="_blank" >RIV/68407700:21230/11:00183453 - isvavai.cz</a>

Result on the web

—

DOI - Digital Object Identifier

—

Result language

angličtina

Original language name

Computing Time-Dependent Policies for Patrolling Games with Mobile Targets

Original language description

We study how a mobile defender should patrol an area to protect multiple valuable targets from being attacked by an attacker. In contrast to existing approaches we allow the targets to move through the area according to a priori known deterministic movement schedules. We represent the patrol area by a graph of arbitrary topology and do not put any restrictions on the movement schedules. We assume the attacker can observe the defender and has full knowledge of the strategy the defender employs. We construct a game-theoretic formulation and seek defender's optimal randomized strategy in a Stackelberg equilibrium of the game. We formulate the computation of the strategy as a mathematical program whose solution corresponds to an optimal time-dependent Markov policy for the defender.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

IN - Informatics

OECD FORD branch

—

Project

—

Continuities

Z - Vyzkumny zamer (s odkazem do CEZ)<br>S - Specificky vyzkum na vysokych skolach

Publication year

2011

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

AAMAS 2011

ISBN

978-0-9826571-8-8

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

989-996

Publisher name

IFAAMAS

Place of publication

County of Richland

Event location

Taipei,

Event date

May 2, 2011

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—