Algorithms for optimizing the placement of stationary monitors

摘要: This article examines the problem of placing stationary monitors in a continuous space, with goal minimizing an adversary’s maximum probability traversing origin–destination route without being detected. The arises, for instance, defending against transport illicit material through some area interest. In particular, we consider deployment whose detecting intruder is function distance between monitor and intruder. Under assumption that detection probabilities are mutually independent, two-stage mixed-integer nonlinear programming formulation constructed problem. An algorithm provided optimally locates space. Then, this examined case where locations restricted to two different discretized subsets analysis provides optimization algorithms each derives bounds on worst-case optimality gap t...