Network flow formulation of optimal perimeter sensory coverage problem
In this article, the perimeter detection optimization problem in field surveillance and target tracking are discussed. The detection range of sensors is assumed to be circular or elliptical. Sensors are also assumed to be associated with a cost factor reflecting their operational characteristics and power usage. We show that the problem of optimal sensor selection can be reduced to a network flow problem and can then be solved using any existing classical methodology. This significantly reduces the computational time of sensory selection problem which in many cases needs to be solved in almost real time basis, every time that the dynamics of the field changes. The field dynamics could change due to such events as wind direction change and sensor failures.
If you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
As the access to this document is restricted, you may want to look for a different version under "Related research" (further below) or search for a different version of it.
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Ames, W.F. & Brezinski, C., 1993. "Integral inequalities and applications," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 35(2), pages 189-190.
When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:197:y:2009:i:1:p:77-83. See general information about how to correct material in RePEc.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Shamier, Wendy)
If references are entirely missing, you can add them using this form.