Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games

Investor logo

Warning

This publication doesn't include Faculty of Economics and Administration. It includes Faculty of Informatics. Official publication website can be found on muni.cz.
Authors

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

Year of publication 2021
Type Article in Proceedings
Conference Proceedings of 37th Conference on Uncertainty in Artificial Intelligence (UAI 2021)
MU Faculty or unit

Faculty of Informatics

Citation
Web https://proceedings.mlr.press/v161/klaska21a.html
Keywords adversarial security games; strategy synthesis
Description We design a new efficient strategy synthesis method applicable to adversarial patrolling problems on graphs with arbitrary-length edges and possibly imperfect intrusion detection. The core ingredient is an efficient algorithm for computing the value and the gradient of a function assigning to every strategy its "protection" achieved. This allows for designing an efficient strategy improvement algorithm by differentiable programming and optimization techniques. Our method is the first one applicable to real-world patrolling graphs of reasonable sizes. It outperforms the state-of-the-art strategy synthesis algorithm by a margin.
Related projects:

You are running an old browser version. We recommend updating your browser to its latest version.