Minimax Optimization of Continuous Search Efforts for the Detection of a Target - Inria - Institut national de recherche en sciences et technologies du numérique Accéder directement au contenu
Rapport (Rapport De Recherche) Année : 2001

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

Résumé

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.
Fichier principal
Vignette du fichier
RR-4194.pdf (582.85 Ko) Télécharger le fichier

Dates et versions

inria-00072428 , version 1 (24-05-2006)

Identifiants

  • HAL Id : inria-00072428 , version 1

Citer

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⟩
73 Consultations
48 Téléchargements

Partager

Gmail Facebook X LinkedIn More