39 citations · 53 across the 19 of their papers we have counts for
20 papers
Multiagent Stochastic Shortest Path Problem
Martin Jonáš, Antonín Kučera, Vojtěch Kůr +2
We introduce and study the multi-agent stochastic shortest path (MSSP) problem, in which agents strive to reach a target state, aiming to minimize the expected time to reach th…
Memory Assignment for Finite-Memory Strategies in Adversarial Patrolling Games
Vojtěch Kůr, Vít Musil, Vojtěch Řehák
Adversarial Patrolling games form a subclass of Security games where a Defender moves between locations, guarding vulnerable targets. The main algorithmic problem is constructing a…
Multiple Mean-Payoff Optimization under Local Stability Constraints
David Klaška, Antonín Kučera, Vojtěch Kůr +2
The long-run average payoff per transition (mean payoff) is the main tool for specifying the performance and dependability properties of discrete systems. The problem of constructi…
Who Let the Guards Out: Visual Support for Patrolling Games
Matěj Lang, Adam Štěpánek, Róbert Zvara +2
Effective security patrol management is critical for ensuring safety in diverse environments such as art galleries, airports, and factories. The behavior of patrols in these situat…
Optimizing Local Satisfaction of Long-Run Average Objectives in Markov Decision Processes
David Klaška, Antonín Kučera, Vojtěch Kůr +2
Long-run average optimization problems for Markov decision processes (MDPs) require constructing policies with optimal steady-state behavior, i.e., optimal limit frequency of visit…
Regstar: Efficient Strategy Synthesis for Adversarial Patrolling Games
David Klaška, Antonín Kučera, Vít Musil +1
We design a new efficient strategy synthesis method applicable to adversarial patrolling problems on graphs with arbitrary-length edges and possibly imperfect intrusion detection.…