Paper
26 November 2001 Distribution of continuous search effort for the detection of a target with optimal moving strategy
Frederic Dambreville, Jean-Pierre Le Cadre
Author Affiliations +
Abstract
Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management and data fusion issues. Such method is based on a probabilistic prior about the target. Even so, this approximation forbids any reactive behavior of the target. As a preliminary step towards reactive target study stands the problem of resource placement under a minimax game context. Nakai gave an elegant solution of the game placement of resources for the detection of a stationary target. In this paper, our interest focuses however on the minimax detection of a moving target. A new method is developed and confronted to Nakai’s work.
© (2001) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Frederic Dambreville and Jean-Pierre Le Cadre "Distribution of continuous search effort for the detection of a target with optimal moving strategy", Proc. SPIE 4473, Signal and Data Processing of Small Targets 2001, (26 November 2001); https://doi.org/10.1117/12.492754
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Target detection

Visibility

Detection and tracking algorithms

Evolutionary algorithms

Optimization (mathematics)

Algorithm development

Data fusion

Back to Top