×

Modeling sequential searches with ancillary target dependencies. (English) Zbl 1189.90072

Summary: We develop a mathematical modeling approach to evaluate the effectiveness of a Bayesian search for objects in cases where the target exhibits ancillary dependencies. These dependencies occur in situations where there are multiple search passes of the same region, and they represent a change in search probability from that predicted using an assumption of independent scans. This variation from independent scans is typically found in situations of advanced detection processing due to fusion and/or collaboration between searchers. The framework developed is based upon the evaluation of a recursion process over spatial search cells, and the dependencies appear as additive utility components within the recursion. We derive expressions for evaluating this utility and illustrate in detail some specific instantiations of the dependency. Computational examples are provided to demonstrate the capabilities of the method.

MSC:

90B40 Search theory
PDFBibTeX XMLCite
Full Text: DOI EuDML Link

References:

[1] B. O. Koopman, Search and Screening: General Principles with Historical Application, Pergamon Press, Elmsford, NY, USA, 2nd edition, 1980. · Zbl 0677.90037
[2] S. J. Benkoski, M. G. Monticino, and J. R. Weisinger, “A survey of the search theory literature,” Naval Research Logistics, vol. 38, no. 4, pp. 469-494, 1991. · Zbl 0731.90043 · doi:10.1002/1520-6750(199108)38:4<469::AID-NAV3220380404>3.0.CO;2-E
[3] T. Nakai, “Search models with continuous effort under various criteria,” Journal of the Operations Research Society of Japan, vol. 31, no. 3, pp. 335-352, 1988. · Zbl 0657.90056
[4] A. R. Washburn, Search and Detection, INFORMS, Linthicum, Md, USA, 4th edition, 2002.
[5] L. D. Stone, Theory of Optimal Search, ORSA Books, Arlington, Va, USA, 2nd edition, 1989. · Zbl 0685.90060
[6] K. Iida, Studies on the Optimal Search Plan, vol. 70 of Lecture Notes in Statistics, Springer, Berlin, Germany, 1992. · Zbl 0837.90076
[7] K. E. Trummel and J. R. Weisinger, “The complexity of the optimal searcher path problem,” Operations Research, vol. 34, no. 2, pp. 324-327, 1986. · Zbl 0615.90072 · doi:10.1287/opre.34.2.324
[8] M. Kress, R. Szechtman, and J. S. Jones, “Efficient employment of non-reactive sensors,” Military Operations Research, vol. 13, no. 4, pp. 45-57, 2008.
[9] D. Grace, “Brownian Reber search theory for the Advanced Unmanned Search System (AUSS),” Tech. Rep. 1532, Naval Command Control and Ocean Surveillance Center, San Diego, Calif, USA, 1992, http://www.dtic.mil/.
[10] B. A. Kish, D. R. Jacques, and M. Pachter, “Optimal control of sensor threshold for autonomous wide-area-search munitions,” Journal of Guidance, Control, and Dynamics, vol. 30, no. 5, pp. 1239-1248, 2007. · doi:10.2514/1.18782
[11] J. M. Cozzolino, “Sequential search for an unknown number of objects of nonuniform size,” Operations Research, vol. 20, no. 2, pp. 293-308, 1972. · Zbl 0333.90026 · doi:10.1287/opre.20.2.293
[12] H. Luss, “Multiperiod search models for an unknown number of valuable objects,” Decision Sciences, vol. 6, no. 3, pp. 430-438, 1975. · doi:10.1111/j.1540-5915.1975.tb01032.x
[13] M. Mangel and C. W. Clark, “Uncertainty, search, and information in fisheries,” Journal du Conseil-Conseil International pour l’Exploration de la Mer, vol. 41, no. 1, pp. 93-103, 1983.
[14] D. V. Kalbaugh, “Optimal search density for a stationary target among stationary false targets,” Operations Research, vol. 41, no. 2, pp. 310-318, 1993. · Zbl 0771.90058 · doi:10.1287/opre.41.2.310
[15] H. R. Richardson and B. Belkin, “Optimal search with uncertain sweep width,” Operations Research, vol. 20, pp. 764-784, 1972. · Zbl 0335.90031 · doi:10.1287/opre.20.4.764
[16] I. Yan and G. L. Blankenship, “Search for randomly moving targets I: estimation,” in Proceedings of the Command and Control Research and Technology Symposium (ICCRTS ’87), pp. 786-791, Washington, DC, USA, 1987.
[17] T. H. Chung and J. W. Burdick, “Multi-agent probabilistic search in a sequential decision-theoretic framework,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA ’08), pp. 146-151, Pasadena, Calif, USA, May 2008. · doi:10.1109/ROBOT.2008.4543200
[18] K. V. Ling and K. W. Lim, “Receding horizon recursive state estimation,” IEEE Transactions on Automatic Control, vol. 44, no. 9, pp. 1750-1753, 1999. · Zbl 0958.93014 · doi:10.1109/9.788546
[19] S. I. Roumeliotis and G. A. Bekey, “Bayesian estimation and Kalman filtering: a unified framework for mobile robot localization,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA ’00), vol. 3, pp. 2985-2992, San Francisco, Calif, USA, April 2000.
[20] E.-M. Wong, F. Bourgault, and T. Furukawa, “Multi-vehicle Bayesian search for multiplelost targets,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA ’03), pp. 3169-3174, Barcelona, Spain, 2003.
[21] T. Furukawa, F. Bourgault, B. Lavis, and H. F. Durrant-Whyte, “Recursive Bayesian search-and-tracking using coordinate UAVs for lost targets,” in Proceedings of the IEEE International Conference on Robotics and Automation (ICRA ’06), pp. 2521-2526, Orlando, Fla, USA, May 2006. · doi:10.1109/ROBOT.2006.1642081
[22] J. G. Baylog and T. A. Wettergren, “Search path evaluation incorporating object placement structure,” Tech. Rep. NUWC-NPT 11845, 2007, http://www.dtic.mil/.
[23] A. Papoulis, Probability, Random Variables, and Stochastic Processes, McGraw-Hill, New York, NY, USA, 3rd edition, 1991. · Zbl 0191.46704
[24] T. A. Wettergren, “Performance of search via track-before-detect for distributed sensor networks,” IEEE Transactions on Aerospace and Electronic Systems, vol. 44, no. 1, pp. 314-325, 2008. · doi:10.1109/TAES.2008.4517006
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.