Constrained minimax optimization of continuous search efforts for the detection of a stationary target |
| |
Authors: | Frédéric Dambreville Jean‐Pierre Le Cadre |
| |
Affiliation: | 1. Délégation Générale pour l'Armement, 16 Bis, Avenue Prieur de la C?te d'Or, 94114 Arcueil, FranceDélégation Générale pour l'Armement, 16 Bis, Avenue Prieur de la C?te d'Or, 94114 Arcueil, France;2. IRISA/CNRS, Campus de Beaulieu, 35042 Rennes Cedex, France |
| |
Abstract: | Analytical resolution of search theory problems, as formalized by B.O. Koopman, may be applied with some model extension to various resource management issues. However, a fundamental prerequisite is the knowledge of the prior target density. Though this assumption has the definite advantage of simplicity, its drawback is clearly that target reactivity is not taken into account. As a preliminary step towards reactive target study stands the problem of resource planning under a min–max game context. This paper is related to Nakai's work about the game planning of resources for the detection of a stationary target. However, this initial problem is extended by adding new and more general constraints, allowing a more realistic modeling of the target and searcher behaviors. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007 |
| |
Keywords: | sensor and resource management target detection search game search theory resource allocation |
|
|