Some Viewpoints about the Optimization of the Management of Detection Resources for the Search of a Moving Target. Quelques Aperçus sur l'Optimisation de la Répartition des Efforts de Recherche d'une Cible

Some Viewpoints about the Optimization of the Management of Detection Resources for the Search of a Moving Target

Quelques Aperçus sur l'Optimisation de la Répartition des Efforts de Recherche d'une Cible

J.-P. Le Cadre

IRISA/CNRS, Campus de Beaulieu, 35042, Rennes, France

Page: 
355-374
|
Received: 
19 May 2004
|
Accepted: 
N/A
|
Published: 
30 September 2005
| Citation

OPEN ACCESS

Abstract: 

We present here various point of views about the optimization of search effort for detecting a target.An important aim is to show the diversity of possible approaches.Algorithmic difficulties are emphasized.Various modelling are also considered as well as their implications for defining and solving the search problem.

Résumé

On expose ici quelques aperçus sur l'optimisation de la répartition des efforts de recherche d'une cible. Il s'agit de mettre en évidence la diversité des approches proposées. On examine plus particulièrement les difficultés algorithmiques. Diverses modélisations du problème sont aussi considérées.

Keywords: 

Detection,target,optimization,games,network,search theory. 

Mots clés

Détection,cible,optimisation,jeux,réseaux,effort de recherche.

Remerciements
1. Search Theory: Présentation Générale
2. Probabilité de Détection d'une Cible en Mouvement
3. Formulations Élémentaires du Problème de Répartition Optimale de l'Effort de Recherche
4. Recherche Multi-Périodes pour la Détection d'une Cible Markovienne (Brown)
5. Application au Problème de Recherche d'Information
6. Recherche d'une Cible Évoluant dans un Réseau
7. Jeu de Recherche Dynamique
8. Conclusions
Annexe A: les Conditions de KKT
  References

[1] S.J. BENKOVSKI, M.G. MONTICINO and J.R. WEISINGER, "A Survey of the Search Theory Literature". Naval Research Logistics, vol. 38, pp.469-491, 1991. 

[2] S.S. BROWN, Optimal Search for a Moving Target in Discrete Time and Space. Operations Research, vol. 28, n° 6, Nov.-December 1980, pp. 1275-1289. 

[3] F. DAMBREVILLE, Optimisation de la gestion des capteurs et des informations pour un système de détection. Thèse de doctorat de l'université de Rennes 1, novembre 2001. 

[4] F. DAMBREVILLE and J.-P. LE CADRE, Optimal Distribution of Continuous Search Effort for Detection of a Target in a Min-Max Game Context. ISIF Conference Fusion 2001, Montreal Can., Aug. 2001. 

[5] F. DAMBREVILLE and J.-P. LE CADRE, Detection of a Markovian Target with Optimization of the Search Efforts under Generalized Linear Constraints. Naval Research Logistics 49 (2), pp 117-142, 2002.

[6] F. DAMBREVILLE and J.-P. LE CADRE, Spatio-temporal multimode information management for moving target detection. Journal of Information Fusion, vol. 5, pp 169-178, 2004. 

[7] E. DUFLOS, M. de VILMORIN et P. VANHEEGHE, Détermination de stratégies de gestion dynamique optimale pour un radar à balayage electronique. Traitement du Signal 2002, vol. 19, no. 2, pp.  59-73. 

[8] J.N. EAGLE, Estimating the Probability of a Diffusing Target Encountering a Stationary Sensor. Naval Research Logistics,Vol. 34, pp. 43--51, 1987. 

[9] S. GAL, Search Games. Academic Press, New-York, 1980. 

[10] A. GARNAEV, “Search Games and Other Applications of Game Theory". Lecture Notes in Economics and Mathematical Systems. Springer Verlag 2000. 

[11] J. de GUENIN, Optimum Distribution of Efffort: an Extension of the Koopman Basic Theory. Operations Research, Jan-Feb. 1961, pp 1-7. 

[12] K. IIDA, Optimal Search Plan Minimizing the Expected Risk of the Search for a Target with Conditionally Deterministic Motion. Naval Research Logistics, vol.36, pp. 596-613, 1989. 

[13] K. IIDA, R. HOHZAKI and S. FURUI,A Search Game for a Mobile Target with the Conditionnally Deterministic Motion Defined by Paths. Journal of the Operations Research Society of Japan, vol. 39, n° 4, pp. 501-511, Dec. 1996. 

[14] K. IIDA, Studies on the Optimal Search Plan. Lecture Notes in Statistics, vol. 70, Springer-Verlag, 1992. 

[15] R. HOHZAKI, K. IIDA , "A search game when a search path is given". European Journal of Operational Research 124, pp 114-124, 2000. 

[16] B.O. KOOPMAN, Search and Screening. General Principles with Historical Applications. MORS Heritage Series,Alexandria,Virginia, 1999. 

[17] I. MOSKOWITZ and J. SIMMEN, Asymptotic Results in Search Theory. Naval Research Logistics, Vol. 36, pp. 577-596, 1989. 

[18] J.-P. LE CADRE and G. SOURIS, Seaching Tracks. IEEE Trans. on Aerospace & Electr. Systems, vol. 36, no. 4, pp. 1149-1166. 

[19] M. MUSKAT, The flow of Compressible Fluids through Porous Media and Some Problems in Heat Combustion. Physics, vol. 5, pp. 71-94, 1934. 

[20] T. NAKAI, Search Models with Continuous Effort Under Various Criteria. Journal of the Operations Research Society of Japan, vol. 31, n° 3, pp. 335 351, Sept. 1988. 

[21] D.H. WAGNER, W. CHARLES MYLANDER and T.J. SANDERS, Naval Operations Analysis, 3rd edition. Naval Institute Press, Annapolis, MD, 1999. 

[22] M. SAKAGUCHI, "A two-Sided resource Allocation Game in Search for a Stationary Object". Math. Japonica, vol. 32, n° 6, pp. 979-991, 1987. 

[23] M. SISLIOGLU, A Mathematical Model for Calculating Detection Probability of a Diffusive Target. Master's Thesis, Naval Postgraduate School, Monterey, CA, 1984.

[24] G. SOURIS et J.-P. LE CADRE, Un panorama des méthodes d'optimisation de l'effort de recherche en détection. Traitement du Signal 1999-Volume  16, n° 6, pp 404-424. 

[25] L.D. STONE, Theory of Optimal Search,2nd ed. Operations Research Society of America, ORSA Books,Arlington, VA, 1989. 

[26] W.R. STROMQUIST and L.D. STONE, Constrained Optimization of Functionals with search Theory Applications. Mathematics of Operations Research, vol. 6, n° 4, pp. 518-529, Nov. 1981. 

[27] L.D. STONE, Necessary and Sufficient Conditions for Optimal Search Plans for Moving Targets. Mathematics of Operations Research, vol. 4, n° 4, Nov. 1979, pp. 431-440. 

[28] L.C. THOMAS and A.R. WASHBURN, "Dynamic Search Games". Operations Research, vol. 39, no. 3, pp 415-422, May-June 1991. 

[29] A.R. WASHBURN, Search and Detection,2 nd ed. Operations Research Society of America, ORSA Books,Arlington, VA, 1989.

[30] A.R. WASHBURN, Two Persons Zero-Sum Games,2nd ed. Topics in Operations Research, INFORMS, 1994. 

[31] A.R. WASHBURN, Search for a Moving Target: the FAB algorithm. Operations Research, vol. 31, n° 4,July-Aug., 1983, pp. 739-751. 

[32] A.R. WASHBURNand K. WOOD,Two-person Zero-Sum Games for Network Interdiction. Operations Research, vol. 43, n° 2, May-April, 1995, pp. 243-251. 

[33] A.R. WASHBURN, Search and Detection. MAS ORSA Books, Arlington VA, 1989. 

[34] R.K. Wood, "Deterministic Network Interdiction". Mathl. Comput. Modelling, Vol. 17, n° 2, pp 1-18, 1993.