On guarding real terrains: The terrain guarding and the blocking path problems
Embargo Lift Date: 2023-07-31
102303-1 - 102303-17
Item Usage Stats
Locating a minimum number of guards on a terrain such that every point on the terrain is guarded by at least one of the guards is known as the Terrain Guarding Problem (TGP). In this paper, a realistic example of the terrain guarding problem is studied, involving the surveillance of a rugged geographical terrain by means of thermal cameras. A number of issues related to TGP are addressed with integer-programming models proposed to solve the problem. Also, a sensitivity analysis is carried out in which five fictitious terrains are created to see the effect of the resolution of the terrain, and of terrain characteristics, on coverage optimization and the required number of guards. Finally, a new problem, which is called the Blocking Path Problem (BPP), is introduced. BPP is about guarding a path on the terrain with a minimum number of guards such that the path blocks all possible infiltration routes. A discussion is provided about the relation of BPP to the Network Interdiction Problem (NIP), which has been studied extensively by the operations research community, and to the k-Barrier Coverage Problem, which has been studied under the Sensor Deployment Problem. BPP is solved via an integer-programming formulation based on a network paradigm.
KeywordsTerrain guarding problem
Blocking path problem
Network interdiction problem
K-barrier coverage problem
Finite dominating sets
Published Version (Please cite this version)https://doi.org/10.1016/j.omega.2020.102303
Showing items related by title, author, creator and subject.
Pilanci, Mert; Arıkan, Orhan; Oguz, B.; Pınar, Mustafa C. (IEEE, 2009)In many signal processing applications the core problem reduces to a linear system of equations. Coefficient matrix uncertainties create a significant challenge in obtaining reliable solutions. In this paper, we present a ...
A distance-limited continuous location-allocation problem for spatial planning of decentralized systems Gokbayrak, K.; Kocaman, A. S. (Elsevier, 2017)We introduce a new continuous location-allocation problem where the facilities have both a fixed opening cost and a coverage distance limitation. The problem has wide applications especially in the spatial planning of water ...
Karagözoğlu, E.; Rachmilevitch, S. (Elsevier, 2017)We introduce a new solution concept for 2-person bargaining problems, which can be considered as the dual of the Equal-Area solution (EA) (see Anbarcı and Bigelow (1994)). Hence, we call it the Dual Equal-Area solution ...