1 |
J. Eagle, "The Optimal Search for a Moving Target When the Search Path is Constrained," Operations Research, Vol. 32, pp. 1107-1115, 1984.
DOI
|
2 |
G. H. Martins, "A New Branch-and-Bound Procedure for Computing Optimal Search Paths", Master's Thesis, Naval Postgraduate School, 1993.
|
3 |
H. Lau, "Optimal Search in Structured Environments," PhD Thesis, University of Technology, Sydney, 2007.
|
4 |
A. G. Santos, "Using Multiple Searchers to Locate a Randomly Moving Target," Master's Thesis, Naval Postgraduate School, 1993.
|
5 |
W. An, M. Mishra, C. Park, and K. R. Pattipati, "An Integrated Asset Allocation and Path Planning Method to Search for Targets in a Dynamic Environment," 15th International Command and Control Research and Technology Symposium, Santa Monica, CA, June 2010.
|
6 |
W. An, D. F. Martinez Ayala, D. Sidoti, M. Mishra, X. Han, K. R. Pattipati, E. D. Regnier, D. L. Kleinman and J. A. Hansen, "Dynamic Asset Allocation Approaches for Counter-Piracy Operations," 15th International Conference on Information Fusion, Singapore, July 2012.
|
7 |
S. Muthukrishnan, V. Poosala, and T. Suel, "On Rectangular Partitionings in Two Dimensions: Algorithms, Complexity and Applications," International Conference on Database Theory, Springer Berlin Heidelberg, 1999.
|
8 |
B. O. Koopman, "Search and Screening: General Principles with Historical Applications," Pergamon Press, New York, 1980.
|
9 |
W. L. Winston, "Operations Research," Fourth Edition, Brooks/Cole.
|