1 May 2008 A heuristic for deriving the optimal number and placement of reconnaissance sensors
Author Affiliations +
Proceedings Volume 6961, Intelligent Computing: Theory and Applications VI; 69610H (2008); doi: 10.1117/12.780282
Event: SPIE Defense and Security Symposium, 2008, Orlando, Florida, United States
Abstract
A key to mastering asymmetric warfare is the acquisition of accurate intelligence on adversaries and their assets in urban and open battlefields. To achieve this, one needs adequate numbers of tactical sensors placed in locations to optimize coverage, where optimality is realized by covering a given area of interest with the least number of sensors, or covering the largest possible subsection of an area of interest with a fixed set of sensors. Unfortunately, neither problem admits a polynomial time algorithm as a solution, and therefore, the placement of such sensors must utilize intelligent heuristics instead. In this paper, we present a scheme implemented on parallel SIMD processing architectures to yield significantly faster results, and that is highly scalable with respect to dynamic changes in the area of interest. Furthermore, the solution to the first problem immediately translates to serve as a solution to the latter if and when any sensors are rendered inoperable.
© (2008) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
S. Nanda, J. Weeks, M. Archer, "A heuristic for deriving the optimal number and placement of reconnaissance sensors", Proc. SPIE 6961, Intelligent Computing: Theory and Applications VI, 69610H (1 May 2008); doi: 10.1117/12.780282; https://doi.org/10.1117/12.780282
PROCEEDINGS
8 PAGES


SHARE
KEYWORDS
Sensors

Intelligent sensors

Reconnaissance

Computing systems

Data processing

Warfare

Computer programming

Back to Top