Efficient Strategy Synthesis for Patrolling Games and Further Infinite-Horizon Objectives – RNDr. David Klaška
RNDr. David Klaška
Doctoral thesis
Efficient Strategy Synthesis for Patrolling Games and Further Infinite-Horizon Objectives
Efficient Strategy Synthesis for Patrolling Games and Further Infinite-Horizon Objectives
Abstract:
Práce se zabývá patrolovacími hrami, což je formální model pro situace, kde pohyblivý obránce chrání zranitelné cíle před útočníkem. Navrhujeme efektivní algoritmus, který dokáže produkovat účinné konečněpaměťové strategie pro patrolovací hry s nekonečným horizontem a libovolnou topologií. Dále se zabýváme patrolovacími hrami ve speciálních situacích, jako je patrolování pomocí dronů, patrolování v …moreAbstract:
We study patrolling games, a formal model for the scenario where a mobile Defender protects vulnerable targets against an intrusion by an Attacker. We design an efficient algorithm capable of synthesizing effective finite-memory strategies for infinite-horizon patrolling games with an arbitrary topology. Moreover, we examine patrolling games in specific scenarios, such as patrolling with drones, patrolling …more
Language used: English
Date on which the thesis was submitted / produced: 28. 4. 2025
Identifier:
https://is.muni.cz/th/m1yq0/
Thesis defence
- Date of defence: 1. 8. 2025
- Supervisor: prof. RNDr. Antonín Kučera, Ph.D.
- Reader: doc. Mgr. Branislav Bošanský, Ph.D., Prof. Stefan Kiefer, Dr. rer. nat.
Citation record
ISO 690-compliant citation record:
KLAŠKA, David. \textit{Efficient Strategy Synthesis for Patrolling Games and Further Infinite-Horizon Objectives}. Online. Doctoral theses, Dissertations. Brno: Masaryk University, Faculty of Informatics. 2025. Available from: https://theses.cz/id/djw1pq/.
Full text of thesis
Contents of on-line thesis archive
Published in Theses:- světu
Other ways of accessing the text
Institution archiving the thesis and making it accessible: Masarykova univerzita, Fakulta informatikyMasaryk University
Faculty of InformaticsDoctoral programme / field:
Computer Science / Fundamentals of Computer Science
Theses on a related topic
-
Memory Distribution in Regular Patrolling Strategies
Vojtěch Kůr -
Efficient Synthesis of Finite-Memory Strategies in Patrolling Games
David Klaška -
Testing of quasi-Newton methods for patrolling strategy synthesis
Peter Dražkovec -
Memory Distribution in Regular Patrolling Strategies
Vojtěch Kůr -
From the World Cup to the Olympic Games in Brazil: Security and Safety Lessons Learned
Marián Bonk -
Methods for Designing Educational Cybersecurity Games
Miriam Gáliková -
Essays in behavioral game theory
Štěpán Veselý -
Game Theory in Waste Management
Ivan Eryganov