|
[1] Ahlswede R, Wegener I. Search problems. Salisbury: John Wiley, 1979
[2] Assaf D, Sharlin-Bilitzky A.Dynamic search for a moving target. J Appl Prob, 1994, 31: 438--457
[3] Benkoski S J, Monticino M G, Weisinger J R. A Survey of the search theory Literature. Nav Res Log Quart, 1991, 38: 469--494
[4] Brown S S. Optimal search for a moving target in discrete time and space. Operations Research. 1980, 28: 1275--128
[5] Eagle J N. The optimal search for a moving target when the search path is constrained. Operations Research, 1984, 32: 1107--1115
[6] Kan Y C. Optimal Search for a moving target. Operations Research, 1977, 25: 864--870
[7] Macphee I M, Jordan B P. Optimal search for a moving target. Probability in the Engineering and Information Sciences, 1995, 2: 159--182
[8] Moldenhauer C. Sturtevant N R. Optimal Solutions for Moving Target Search. 8th International Conference on Autonomous Agents and Multi-agent Systems, 2009: 1249--1252
[9] Nakai T. A Model of search for a target moving among three xoxes: Some special cases. J of Operations Reacher Society of Japan, 1973, 16: 151--162
[10] Pollock S M. A simple model of search for a moving target. Operations Research. 1970, 18: 883--903
[11] Ross S M. Introduction to stochastic dynamic programming. New York: Academic Press, 1983
[12] Schweitzer P J. Threshold probabilities when search for a moving target. Operations Research, 1971, 19: 707--709
[13] Singh S, Krishnamurthy V. The Optimal search for a Markovian target when the search path is constrained: The infinite-horizon Case. IEEE Transactions on automatic control, 2003, 48(3): 93--497
[14] Stone L D, Theory of optimal search. New York: Academic Press, 1975
[15] Weber R R. Optimal search for a randomly moving object. J Appl Prob, 1986, 23: 708--717
|