Skip to Main content Skip to Navigation

Minimax Optimization of Continuous Search Efforts for the Detection of a Target

Frédéric Dambreville 1 Jean-Pierre Le Cadre 1
1 VISTA - Vision spatio-temporelle et active
IRISA - Institut de Recherche en Informatique et Systèmes Aléatoires, Inria Rennes – Bretagne Atlantique
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. This report is related to Nakai's work about the game placement 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 subtle modeling of the target and resource behaviors.
Document type :
Complete list of metadata
Contributor : Rapport de Recherche Inria <>
Submitted on : Wednesday, May 24, 2006 - 9:56:23 AM
Last modification on : Thursday, January 7, 2021 - 4:29:09 PM
Long-term archiving on: : Sunday, April 4, 2010 - 11:07:13 PM


  • HAL Id : inria-00072428, version 1


Frédéric Dambreville, Jean-Pierre Le Cadre. Minimax Optimization of Continuous Search Efforts for the Detection of a Target. [Research Report] RR-4194, INRIA. 2001. ⟨inria-00072428⟩



Record views


Files downloads