F. Dambreville, J.-P. Le Cadre. Minimax optimization of continuous search efforts for the detection of a target. Research Report IRISA, No 1403, June 2001.
Download paper:
Adobe portable document (pdf)
Copyright notice: This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.
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
@TechReport{Dambreville01a,
Author = {Dambreville, F. and Le Cadre, J.-P.},
Title = {Minimax optimization of continuous search efforts for the detection of a target},
Number = {1403},
Institution = {IRISA},
Month = {June},
Year = {2001}
}
Get EndNote Reference (.ref)
This document was translated automatically from BibTEX by bib2html (Copyright 2003 © Eric Marchand, INRIA, Vista Project).