Optimal patrol to uncover threats in time when detection is imperfect

DOI10.1002/nav.21603zbMath1411.90175OpenAlexW2106982477MaRDI QIDQ4632860

Michael P. Atkinson, Kyle Y. Lin, Kevin D. Glazebrook

Publication date: 2 May 2019

Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)

Full work available at URL: https://eprints.lancs.ac.uk/id/eprint/71021/1/patrolOverlook.pdf

zbMATH Keywords

surveillanceLagrangian relaxationapproximate dynamic programminginfrastructure protectionsearch and detection

Mathematics Subject Classification ID

Search theory (90B40) Markov and semi-Markov decision processes (90C40)

Related Items (10)

Optimizing periodic patrols against short attacks on the line and other networks ⋮ Technical Note—Optimal Patrol of a Perimeter ⋮ Continuous Patrolling Games ⋮ A Markov decision process model on dynamic routing for target surveillance ⋮ Defense and security planning under resource uncertainty and multi‐period commitments ⋮ A stochastic game framework for patrolling a border ⋮ Continuous patrolling and hiding games ⋮ An interdiction game on a queueing network with multiple intruders ⋮ On the dynamic allocation of assets subject to failure ⋮ Adversarial Patrolling in a Uniform

This page was built for publication: Optimal patrol to uncover threats in time when detection is imperfect