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 journalArticlepeer-review

19 Scopus citations


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
Issue number1
StatePublished - Nov 16 2007

All Science Journal Classification (ASJC) codes

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


Dive into the research topics of 'A heuristic algorithm for minimax sensor location in the plane'. Together they form a unique fingerprint.

Cite this