Journal of the Korea Institute of Military Science and Technology (한국군사과학기술학회지)

The Korea Institute of Military Science and Technology (한국군사과학기술학회)
권호 표지
DOI QR코드

DOI QR Code

A Methodology for Partitioning a Search Area to Allocate Multiple Platforms

구역분할 알고리즘을 이용한 다수 탐색플랫폼의 구역할당 방법

  • An, Woosun (Test & Evaluation Group, Naval Force Analysis) ;
  • Cho, Younchol (Test & Evaluation Group, Naval Force Analysis) ;
  • Lee, Chansun (Analysis and Evaluation Center, Agency for Defense Development)
  • 안우선 (해군 전력분석시험평가단) ;
  • 조윤철 (해군 전력분석시험평가단) ;
  • 이찬선 (국방과학연구소 분석평가실)
  • Received : 2017.09.14
  • Accepted : 2018.02.23
  • Published : 2018.04.05
Download PDF
⟨ Previous Next ⟩

Abstract

In this paper, we consider a problem of partitioning a search area into smaller rectangular regions, so that multiple platforms can conduct search operations independently without requiring unnecessary coordination among themselves. The search area consists of cells where each cell has some prior information regarding the probability of target existence. The detection probability in particular cell is evaluated by multiplying the observation probability of the platform and the target existence probability in that cell. The total detection probability within the search area is defined as the cumulative detection probability for each cell. However, since this search area partitioning problem is NP-Hard, we decompose the problem into three sequential phases to solve this computationally intractable problem. Additionally, we discuss a special case of this problem, which can provide an optimal analytic solution. We also examine the performance of the proposed approach by comparing our results with the optimal analytic solution.

Keywords

References

  1. J. Eagle, "The Optimal Search for a Moving Target When the Search Path is Constrained," Operations Research, Vol. 32, pp. 1107-1115, 1984. https://doi.org/10.1287/opre.32.5.1107
  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.