Multi-robot adversarial patrolling strategies via lattice paths
From MaRDI portal
Publication:2082517
DOI10.1016/j.artint.2022.103769OpenAlexW4289444512MaRDI QIDQ2082517
Publication date: 4 October 2022
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2022.103769
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Enumerating lattice paths touching or crossing the diagonal at a given number of lattice points
- Multi-robot area patrol under frequency constraints
- Maintaining the spirit of the reflection principle when the boundary has arbitrary integer slope
- Frequency-based multi-agent patrolling model and its area partitioning solution method for balanced workload
- Optimizing periodic patrols against short attacks on the line and other networks
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- Multi-robot adversarial patrolling: handling sequential attacks
- Adversarial patrolling with spatially uncertain alarm signals
- Linear Algebra for Computational Sciences and Engineering
- Patrolling Games
- Lattice Path Enumeration
- A continuous-time Markov Stackelberg security game approach for reasoning about real patrol strategies
This page was built for publication: Multi-robot adversarial patrolling strategies via lattice paths
