A Multiobjective Evolutionary Algorithm for Surveillance Sensor Placement
Kamyoung Kim,
Alan T Murray and
Ningchuan Xiao
Additional contact information
Ningchuan Xiao: Department of Geography, The Ohio State University, 1036 Derby Hall, 154 North Oval Mall, Columbus, OH 43210, USA
Environment and Planning B, 2008, vol. 35, issue 5, 935-948
Abstract:
Automated or semiautomated surveillance monitoring involves movement tracking and sensor handoff. In order to track moving objects over a large area, sensor coverage needs to overlap significantly. Overlapping coverage can be modeled using the concept of backup coverage, a location modeling approach that seeks to maximize primary and backup coverage simultaneously. This kind of sensor placement problem belongs to the class of NP-hard combinatorial optimization problems, so computational difficulty is expected when solving large problem instances, not to mention the need for dealing with multiple objectives. Beyond this, backup coverage for supporting sensor placement actually brings about confounding problem instances for branch-and-bound approaches because of the trade-off between primary and backup coverage. To address these difficulties, this paper develops a multiobjective evolutionary algorithm for the backup coverage problem to support sensor placement. The solutions of this algorithm are evaluated in terms of computational requirements and solution quality.
Date: 2008
References: View references in EconPapers View complete reference list from CitEc
Citations:
Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b33139 (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:35:y:2008:i:5:p:935-948
DOI: 10.1068/b33139
Access Statistics for this article
More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().