.png){kind=icon}
.png){kind=icon}
Return
Covering a line segment with variable radius discs
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2008.02.013.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
The paper addresses the problem of locating sensors with a circular field of view so that it 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 (here 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.
Keywords:
Sensor location
Network covering problems
Mixed integer nonlinear programming
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W
View more organizations