- patrolOverlook
Submitted manuscript, 1.23 MB, PDF document

- http://onlinelibrary.wiley.com/doi/10.1002/nav.21603/abstract
Final published version

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Published

In: Naval Research Logistics, Vol. 61, No. 8, 2014, p. 557-576.

Research output: Contribution to Journal/Magazine › Journal article › peer-review

Lin, K, Atkinson, M & Glazebrook, K 2014, 'Optimal patrol to uncover threats in time when detection is imperfect', *Naval Research Logistics*, vol. 61, no. 8, pp. 557-576. https://doi.org/10.1002/nav.21603

Lin, K., Atkinson, M., & Glazebrook, K. (2014). Optimal patrol to uncover threats in time when detection is imperfect. *Naval Research Logistics*, *61*(8), 557-576. https://doi.org/10.1002/nav.21603

Lin K, Atkinson M, Glazebrook K. Optimal patrol to uncover threats in time when detection is imperfect. Naval Research Logistics. 2014;61(8):557-576. Epub 2014 Oct 21. doi: 10.1002/nav.21603

@article{79441e422b7f4170a7a963703c90867d,

title = "Optimal patrol to uncover threats in time when detection is imperfect",

abstract = "Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes.",

keywords = "surveillance, infrastructure protection , search and detection , Lagrangian relaxation , approximate dynamic programming",

author = "Kyle Lin and Michael Atkinson and Kevin Glazebrook",

year = "2014",

doi = "10.1002/nav.21603",

language = "English",

volume = "61",

pages = "557--576",

journal = "Naval Research Logistics",

issn = "0894-069X",

publisher = "John Wiley and Sons Inc.",

number = "8",

}

TY - JOUR

T1 - Optimal patrol to uncover threats in time when detection is imperfect

AU - Lin, Kyle

AU - Atkinson, Michael

AU - Glazebrook, Kevin

PY - 2014

Y1 - 2014

N2 - Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes.

AB - Consider a patrol problem, where a patroller traverses a graph through edges to detect potential attacks at nodes. An attack takes a random amount of time to complete. The patroller takes one time unit to move to and inspect an adjacent node, and will detect an ongoing attack with some probability. If an attack completes before it is detected, a cost is incurred. The attack time distribution, the cost due to a successful attack, and the detection probability all depend on the attack node. The patroller seeks a patrol policy that minimizes the expected cost incurred when, and if, an attack eventually happens. We consider two cases. A random attacker chooses where to attack according to predetermined probabilities, while a strategic attacker chooses where to attack to incur the maximal expected cost. In each case, computing the optimal solution, although possible, quickly becomes intractable for problems of practical sizes. Our main contribution is to develop efficient index policies—based on Lagrangian relaxation methodology, and also on approximate dynamic programming—which typically achieve within 1% of optimality with computation time orders of magnitude less than what is required to compute the optimal policy for problems of practical sizes.

KW - surveillance

KW - infrastructure protection

KW - search and detection

KW - Lagrangian relaxation

KW - approximate dynamic programming

U2 - 10.1002/nav.21603

DO - 10.1002/nav.21603

M3 - Journal article

VL - 61

SP - 557

EP - 576

JO - Naval Research Logistics

JF - Naval Research Logistics

SN - 0894-069X

IS - 8

ER -