Optimizing periodic patrols against short attacks on the line and other networks
From MaRDI portal
Publication:1631529
DOI10.1016/j.ejor.2018.08.050zbMath1403.90392OpenAlexW2892193892MaRDI QIDQ1631529
Thomas F. Lidbetter, Steven Alpern, Katerina P. Papadaki
Publication date: 6 December 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: http://eprints.lse.ac.uk/90191/1/Alpern_Optimizing%20periodic%20patrols_2018.pdf
Related Items (8)
Stochastic strategies for patrolling a terrain with a synchronized multi-robot system ⋮ Technical Note—Optimal Patrol of a Perimeter ⋮ Continuous Patrolling Games ⋮ Optimal patrolling strategies for trees and complete networks ⋮ A stochastic game framework for patrolling a border ⋮ A search problem on a bipartite network ⋮ Multi-robot adversarial patrolling strategies via lattice paths ⋮ Adversarial Patrolling in a Uniform
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Infiltration games on arbitrary graphs
- On the infiltration game
- Patrolling security games: definition and algorithms for solving large instances with single patroller and single intruder
- Patrolling a perimeter
- A Graph Patrol Problem with Random Attack Times
- Patrolling Games
- On the optimal detection of an underwater intruder in a channel using unmanned underwater vehicles
- Patrolling a Border
- On patrolling a channel
- Models of sensor operations for border surveillance
- A continuous game of ambush
- Optimal patrol to uncover threats in time when detection is imperfect
- Security routing games with multivehicle Chinese postman problem
- A fast infiltration game onn arcs
- Technical Note—An Ambush Game with a Fat Infiltrator
- An Ambush Game with an Unknown Number of Infiltrators
This page was built for publication: Optimizing periodic patrols against short attacks on the line and other networks
