Two phase solution for an intelligent moving target search problem based on a 0–1 linear model

References

• Brown, S. S. 1980. “Optimal Search for a Moving Target in Discrete Time and Space.” Operations Research 28 (6): 1275–1289.
   Web of Science ®Google Scholar
• Dambreville, F. 2001. “Optimisation de la gestion des capteurs et des informations pour un système de détection [Managment Sensors and Informations Optimization for Detection Systems].” PhD University of Rennes I.
   Google Scholar
• Dambreville, F., and J. P. Le Cadre. 2002a. “Search Game for Moving Target with Dynamically Generated Informations.” In 5th International Conference on Information Fusion, Annapolis, MD, USA, 243–250.
   Google Scholar
• Dambreville, F., and J. P. Le Cadre. 2002b. “Detection of a Markovian Target with Optimization of the Search Efforts Under Generalized Linear Constraints.” Naval Research Logistics 49 (2): 117–142.
   Web of Science ®Google Scholar
• Dambreville, F., C. Simonin, and J. P. Le Cadre. 2009. “A Hierarchical Approach for Planning a Multisensor Multizone Search for a Moving Target.” Computers and Operations Research 36: 2179–2192.
   Web of Science ®Google Scholar
• Dell, R. F., J. N. Eagle, G. H. A. Martins, and A. G. Santos. 1996. “Using Multiple Searchers in Constrained-path, Moving-target Search Problems.” Naval Research Logistics 43: 463–480.
   Web of Science ®Google Scholar
• Dixon, W. J., and F. J. Massey. 1957. Introduction to Statistical Analysis. 2nd ed. New York: McGraw-Hill. http://books.google.fr/books?id=9CVBAAAAIAAJ.
   Google Scholar
• Eagle, J. N. 1984. “The Optimal Search for a Moving Target When the Search Path is Constrained.” Operations Research 32: 1107–1115.
   Web of Science ®Google Scholar
• Eagle, J. N., and R. Yee. 1990. “An Optimal Branch-and-bound Procedure for the Constrained Path, Moving Target Search Problem.” Operations Research 38 (1): 110–114.
   Web of Science ®Google Scholar
• Fomin, F. V. 1999. “Note on a Helicopter Search Problem on Graphs.” Discrete Applied Mathematics 95: 241–249.
   Web of Science ®Google Scholar
• Fomin, F. V. 1998. “Helicopter Search Problems, Bandwidth and Pathwidth.” Discrete Applied Mathematics 85 (1): 59–70.
   Web of Science ®Google Scholar
• Gal, S. 1979. “Search Games with Mobile and Immobile Hider.” SIAM Journal on Control and Optimization 17 (1): 99–122.
   Web of Science ®Google Scholar
• Garnaev, A. Y. 1993. “A Remark on a Helicopter-submarine Game.” Naval Research Logistics 40: 745–753.
   Web of Science ®Google Scholar
• Garnaev, A. Y. 2000. “Search Games and Other Applications of Game Theory.” In Lecture Notes in Economics and Mathematical Systems Vol. 485, 1–145.
   Google Scholar
• Hohzaki, R. and K. Iida. 1999. “A Solution for a Two-person Zero-sum Game with a Concave Payoff Function.” In Nonlinear Analysis and Convex Analysis, edited by W. Takahashi and T. Tanaka, 157–166. London: World Science Publishing.
   Google Scholar
• Hohzaki, R. 2006. “Search Allocation Game.” European Journal of Operational Research 172: 101–119.
   Web of Science ®Google Scholar
• Hohzaki, R. 2007. “A Search Game Taking Account of Attributes of Searching Resources.” Naval Research Logistics 55 (1): 76–90.
   Web of Science ®Google Scholar
• Kan, Y. C. 1977. “Optimal Search of a Moving Target.” Operations Research 25 (5): 864–870.
   Web of Science ®Google Scholar
• Koopman, B, O. 1980. Search and Screening. New York: Pergamon Press.
   Google Scholar
• Koopman, B. O. 1956a. “The Theory of Search: Part I, Kinematic Bases.” Operations Research 4: 324–346.
   Web of Science ®Google Scholar
• Koopman, B. O. 1956b. “The Theory of Search: Part II, Target Detection.” Operations Research 4: 503–531.
   Web of Science ®Google Scholar
• Koopman, B. O. 1957. “The Theory of Search: Part III, the Optimum Distribution of Search Effort.” Operations Research 5: 613–626.
   Web of Science ®Google Scholar
• Krumbein, W. C., and A Graybill. 1965. An Introduction to Statistical Models in Geology. New York: McGraw-Hill.
   Google Scholar
• Lau, H., S. Huang, and G. Dissanayake. 2008. “Discounted Mean Bound for the Optimal Searcher Path Problem with Non-uniform Travel Times.” European Journal of Operations Research 190 (2): 23–33.
   Google Scholar
• Meinardi, J. J. 1964. A Sequentially Compouned Search Game. Theory of Games: Technique and Applications, 285–299. London: The English Universities Press.
   Google Scholar
• Nakai, T. 1988. “Search Models with Continuous Effort Under Various Criteria.” Journal of Operations Research Society of Japan 31: 335–351.
   Web of Science ®Google Scholar
• Nisse, N., and P. Fraigniaud. 2008. “Monotony Properties of Connected Visible Graph Searching.” Information and Computation 206 (12): 1383–1393.
   Web of Science ®Google Scholar
• Owen, G., and G. H. McCormick. 2008. “Finding a Moving Fugitive. A Game Theoretic Representation of Search.” Computers and Operations Research 35: 1944–1962.
   Web of Science ®Google Scholar
• Rodrigues, C. D., D. Quadri, and P. Michelon. 2009. “Un modèle bi-niveau pour le problème de la recherche d’unecible dynamique [A Bi-Level Model for a Moving Search Target Problem].” In Proceedings MajeSTIC 2009, Paper No. 512. Avginon, France.
   Google Scholar
• Royset, J. O., and H. Sato. 2010. “Route Optimization for Multiple Searchers.” Naval Research Logistics 57 (8): 701–717.
   Web of Science ®Google Scholar
• Sarker, B. R., and S. S. Gurav. 2005. “Route Planning for Automated Guided Vehicles in a Manufacturing Facility.” International Journal of Production Research 43 (21): 4659–4683.
   Google Scholar
• Thomas, L. C., and A. R. Washburn. 1991. “Dynamic Search Games.” Operations Research 39 (2): 415–422.
   Web of Science ®Google Scholar
• Washburn, A. R. 1983. “Search for a Moving Target: The FAB Algorithm.” Operations Research 31 (4): 739–751.
   Web of Science ®Google Scholar
• Washburn, A. R. 1998. “Branch and Bound Methods for a Search Problem.” Naval Research Logistics 45: 243–257.
   Web of Science ®Google Scholar
• Washburn, A. R. 2002. Search and Detection. 4th ed. Linthicum, MD: INFORMS.
   Google Scholar
• Washburn, A. R., and R. Hohzaki. 2001. “The Diesel Submarine Flaming Datum Problem.” Military Operations Research 4: 19–30.
   Google Scholar