Minimizing Expected Intrusion Detection Time in Adversarial Patrolling

Logo poskytovatele

Varování

Publikace nespadá pod Fakultu sociálních studií, ale pod Fakultu informatiky. Oficiální stránka publikace je na webu muni.cz.

Autoři

KLAŠKA David KUČERA Antonín MUSIL Vít ŘEHÁK Vojtěch

Rok publikování 2022
Druh Článek ve sborníku
Konference 21st International Conference on Autonomous Agents and Multiagent Systems, AAMAS 2022.
Fakulta / Pracoviště MU

Fakulta informatiky

Citace
www Paper URL
Doi http://dx.doi.org/10.5555/3535850.3536068
Klíčová slova Security Games; Adversarial Patrolling
Popis In adversarial patrolling games, a mobile Defender strives to discover intrusions at vulnerable targets initiated by an Attacker. The Attacker’s utility is traditionally defined as the probability of completing an attack, possibly weighted by target costs. However, in many real-world scenarios, the actual damage caused by the Attacker depends on the time elapsed since the attack’s initiation to its detection. We introduce a formal model for such scenarios, and we show that the Defender always has an optimal strategy achieving maximal protection. We also prove that finite-memory Defender’s strategies are sufficient for achieving protection arbitrarily close to the optimum. Then, we design an efficient strategy synthesis algorithm based on differentiable programming and gradient descent.We evaluate the efficiency of our method experimentally.
Související projekty:

Používáte starou verzi internetového prohlížeče. Doporučujeme aktualizovat Váš prohlížeč na nejnovější verzi.