A heuristic algorithm for minimax sensor location in the plane

Tom M. Cavalier, Whitney A. Conner, Enrique Del Castillo, Stuart I. Brown

Research output: Contribution to journalArticle

16 Citations (Scopus)

Abstract

This paper addresses the problem of locating a finite number of sensors to detect an event in a given planar region. The objective is to minimize the maximum probability of non-detection where the underlying region consists of a convex polygon. The sensor location problem has a multitude of applications, including the location of aircraft detection sensors, the placement of sentries along a border to detect enemy penetration, the detection of nuclear tests, and the detection of natural and hazardous man-made events. The problem is a difficult nonlinear nonconvex programming problem even in the case of two sensors. A fast heuristic based on Voronoi polygons is developed in this paper. The algorithm can quickly generate high-quality solutions. Computational experience is provided.

Original languageEnglish (US)
Pages (from-to)42-55
Number of pages14
JournalEuropean Journal of Operational Research
Volume183
Issue number1
DOIs
StatePublished - Nov 16 2007

Fingerprint

Heuristic algorithms
Minimax
Heuristic algorithm
Sensor
Sensors
Aircraft detection
Nonconvex Programming
Convex polygon
Voronoi
Location Problem
Nonlinear programming
Nonlinear Programming
Penetration
Placement
Polygon
Aircraft
Heuristics
Minimise

All Science Journal Classification (ASJC) codes

  • Modeling and Simulation
  • Management Science and Operations Research
  • Information Systems and Management

Cite this

Cavalier, Tom M. ; Conner, Whitney A. ; Del Castillo, Enrique ; Brown, Stuart I. / A heuristic algorithm for minimax sensor location in the plane. In: European Journal of Operational Research. 2007 ; Vol. 183, No. 1. pp. 42-55.
@article{7073c39628dd4548bfb6adafd6bd83fe,
title = "A heuristic algorithm for minimax sensor location in the plane",
abstract = "This paper addresses the problem of locating a finite number of sensors to detect an event in a given planar region. The objective is to minimize the maximum probability of non-detection where the underlying region consists of a convex polygon. The sensor location problem has a multitude of applications, including the location of aircraft detection sensors, the placement of sentries along a border to detect enemy penetration, the detection of nuclear tests, and the detection of natural and hazardous man-made events. The problem is a difficult nonlinear nonconvex programming problem even in the case of two sensors. A fast heuristic based on Voronoi polygons is developed in this paper. The algorithm can quickly generate high-quality solutions. Computational experience is provided.",
author = "Cavalier, {Tom M.} and Conner, {Whitney A.} and {Del Castillo}, Enrique and Brown, {Stuart I.}",
year = "2007",
month = "11",
day = "16",
doi = "10.1016/j.ejor.2006.10.055",
language = "English (US)",
volume = "183",
pages = "42--55",
journal = "European Journal of Operational Research",
issn = "0377-2217",
publisher = "Elsevier",
number = "1",

}

A heuristic algorithm for minimax sensor location in the plane. / Cavalier, Tom M.; Conner, Whitney A.; Del Castillo, Enrique; Brown, Stuart I.

In: European Journal of Operational Research, Vol. 183, No. 1, 16.11.2007, p. 42-55.

Research output: Contribution to journalArticle

TY - JOUR

T1 - A heuristic algorithm for minimax sensor location in the plane

AU - Cavalier, Tom M.

AU - Conner, Whitney A.

AU - Del Castillo, Enrique

AU - Brown, Stuart I.

PY - 2007/11/16

Y1 - 2007/11/16

N2 - This paper addresses the problem of locating a finite number of sensors to detect an event in a given planar region. The objective is to minimize the maximum probability of non-detection where the underlying region consists of a convex polygon. The sensor location problem has a multitude of applications, including the location of aircraft detection sensors, the placement of sentries along a border to detect enemy penetration, the detection of nuclear tests, and the detection of natural and hazardous man-made events. The problem is a difficult nonlinear nonconvex programming problem even in the case of two sensors. A fast heuristic based on Voronoi polygons is developed in this paper. The algorithm can quickly generate high-quality solutions. Computational experience is provided.

AB - This paper addresses the problem of locating a finite number of sensors to detect an event in a given planar region. The objective is to minimize the maximum probability of non-detection where the underlying region consists of a convex polygon. The sensor location problem has a multitude of applications, including the location of aircraft detection sensors, the placement of sentries along a border to detect enemy penetration, the detection of nuclear tests, and the detection of natural and hazardous man-made events. The problem is a difficult nonlinear nonconvex programming problem even in the case of two sensors. A fast heuristic based on Voronoi polygons is developed in this paper. The algorithm can quickly generate high-quality solutions. Computational experience is provided.

UR - http://www.scopus.com/inward/record.url?scp=34249073730&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34249073730&partnerID=8YFLogxK

U2 - 10.1016/j.ejor.2006.10.055

DO - 10.1016/j.ejor.2006.10.055

M3 - Article

VL - 183

SP - 42

EP - 55

JO - European Journal of Operational Research

JF - European Journal of Operational Research

SN - 0377-2217

IS - 1

ER -