TY - JOUR
T1 - Covering a line segment with variable radius discs
AU - Agnetis, Alessandro
AU - Grande, Enrico
AU - Mirchandani, Pitu B.
AU - Pacifici, Andrea
N1 - Funding Information:
The authors wish to acknowledge the support of the ATLAS Center at the University of Arizona where most of this research was conducted and the support of Waveband Inc. that partially funded this effort through its SBIR Contract ARMY03-T18 with the US Army.
PY - 2009/5
Y1 - 2009/5
N2 - The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing. Scope and purpose: Problems of locating facilities to cover sets of points on networks and planes have been widely studied. This paper focuses on a new covering problem that is motivated by an application where a line segment is to be kept under surveillance using different types of radars. Using reasonable assumptions, some nonlinear covering problems are formulated. Efficient exact algorithms and heuristics are developed and analyzed for "easy" and "hard" cases, respectively.
AB - The paper addresses the problem of locating sensors with a circular field of view so that a given line segment is under full surveillance, which is termed as the disc covering problem on a line. The cost of each sensor includes a fixed component f, and a variable component that is a convex function of the diameter of the field-of-view area. When only one type of sensor or, in general, one type of disc, is available, then a simple polynomial algorithm solves the problem. When there are different types of sensors, the problem becomes hard. A branch-and-bound algorithm as well as an efficient heuristic are developed for the special case in which the variable cost component of each sensor is proportional to the square of the measure of the field-of-view area. The heuristic very often obtains the optimal solution as shown in extensive computational testing. Scope and purpose: Problems of locating facilities to cover sets of points on networks and planes have been widely studied. This paper focuses on a new covering problem that is motivated by an application where a line segment is to be kept under surveillance using different types of radars. Using reasonable assumptions, some nonlinear covering problems are formulated. Efficient exact algorithms and heuristics are developed and analyzed for "easy" and "hard" cases, respectively.
KW - Mixed integer nonlinear programming
KW - Network covering problems
KW - Sensor location
UR - http://www.scopus.com/inward/record.url?scp=55749106378&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=55749106378&partnerID=8YFLogxK
U2 - 10.1016/j.cor.2008.02.013
DO - 10.1016/j.cor.2008.02.013
M3 - Article
AN - SCOPUS:55749106378
SN - 0305-0548
VL - 36
SP - 1423
EP - 1436
JO - Computers and Operations Research
JF - Computers and Operations Research
IS - 5
ER -