동적 확률지도를 이용한 지상 이동표적 탐색
Search for Ground Moving Targets Using Dynamic Probability Maps
1
조회
0
다운로드
1
인용
0
참고문헌
키워드
초록
In order to achieve success in ground operations, searching for moving targets is one of critical factors. Usually, the system of searching for adversary ground moving targets has complex properties which includes target’s moving characteristics, camouflage level, terrain, weather, available search time window, distance between target and searcher, moving speed, target’s tactics, etc. The purpose of this paper is to present a practical quantitative method for effectively searching for infiltrated moving targets considering aforementioned complex properties. Based upon search theories, this paper consists of two parts. One is infiltration route analysis, through terrain and mobility analysis. The other is building dynamic probability maps through Monte Carlo simulation to determine the prioritized searching area for moving targets. This study primarily considers ground moving targets’ moving pattern. These move by foot and because terrain has a great effect on the target’s movement, they generally travel along a constrained path. With the ideas based on the terrain’s effect, this study deliberately performed terrain and mobility analysis and built a constrained path. In addition, dynamic probability maps taking terrain condition and a target’s moving speed into consideration is proposed. This analysis is considerably distinct from other existing studies using supposed transition probability for searching moving targets. A case study is performed to validate the effectiveness and usefulness of our methodology. Also, this study suggests that the proposed approach can be used for searching for infiltrated ground moving target within critical time window. The proposed method could be used not only to assist a searcher’s mission planning, but also to support the tactical commander’s timely decision making ability and ensure the operations’ success.
Abstract
In order to achieve success in ground operations, searching for moving targets is one of critical factors. Usually, the system of searching for adversary ground moving targets has complex properties which includes target’s moving characteristics, camouflage level, terrain, weather, available search time window, distance between target and searcher, moving speed, target’s tactics, etc. The purpose of this paper is to present a practical quantitative method for effectively searching for infiltrated moving targets considering aforementioned complex properties. Based upon search theories, this paper consists of two parts. One is infiltration route analysis, through terrain and mobility analysis. The other is building dynamic probability maps through Monte Carlo simulation to determine the prioritized searching area for moving targets. This study primarily considers ground moving targets’ moving pattern. These move by foot and because terrain has a great effect on the target’s movement, they generally travel along a constrained path. With the ideas based on the terrain’s effect, this study deliberately performed terrain and mobility analysis and built a constrained path. In addition, dynamic probability maps taking terrain condition and a target’s moving speed into consideration is proposed. This analysis is considerably distinct from other existing studies using supposed transition probability for searching moving targets. A case study is performed to validate the effectiveness and usefulness of our methodology. Also, this study suggests that the proposed approach can be used for searching for infiltrated ground moving target within critical time window. The proposed method could be used not only to assist a searcher’s mission planning, but also to support the tactical commander’s timely decision making ability and ensure the operations’ success.
참고문헌 (26)
- Army HQs, "ROK, FM 0-3", Anti-Infitration Operations, ~ (2005)
- Army HQs, "ROK, Geospatial Analysis Guide", ~ (2014)
- 방수남, "지형공간정보 및 최적탐색기법을 이용한 최적침투경로 분석", 대한토목학회 논문집D, 26(1D), pp.195~202 (2006), 대한토목학회
- 방수남, "유전자 알고리즘을 이용한 최적침투경로 분석", 대한원격탐사학회지, 27(1), pp.59~68 (2011), 대한원격탐사학회
- Benkoski, S., "A survey of the search theory literature", Naval Research Logistics, 38, pp.469~494 (1991)
- Brown, S. S., "Optimal search for a moving target in discrete time and space", Operations Research, 28(6), pp.1275~1286 (1980)
- 조성진, "대잠전 의사결정지원 시스템에서 표적 탐색 논리 연구", 한국군사과학기술학회지, 13(5), pp.824~830 (2010), 한국군사과학기술학회
- Dell, R. F., "Using multiple searchers in constrained path, moving target search problem", Naval Research, Logistics, 43, pp.463~480 (1996)
- Eagle, J.N., "An Optimal Branch-And-Bound procedure for a constrained path, moving target search problem", Operations Research, 38(1), pp.110~114 (1990)
- Hong, S. P., "Optimal search-relocation trade-off in Markovian-target searching", Computers and Operations Research, 36, pp.2097~2104 (2009)
- Hong, S. P., "A Pseudo-Polynomial heuristic for path-constrained discrete-time Markovian target search", European Journal of Operational Research, 193, pp.351~364 (2009)
- Hohzaki, R., "Randomized look strategy for a moving target when a search path is given", Journal of Operations Research Society of Japan, 41(3), pp.374~386 (1998)
- Koopman, B. O., "Search and screening" (1989), Pergamon Press
- 김종만, "연구개발 부문 적정인력 산정을 위한 확률적 모형설계에 관한 연구", 품질경영학회지, 41(1), pp.149~162 (2013), 한국품질경영학회[DOI]
- 김기태, "잠수함 생존율 극대화를 위한 최적 이동경로 계획", 한국국방경영분석학회지, 36(3), pp.135~145 (2010), 한국국방경영분석학회
- 김기태, "A*PS-PGA를 이용한 무인 항공기 생존성 극대화 경로 계획", 산업경영시스템학회지, 34(3), pp.24~34 (2011), 한국산업경영시스템학회
- 김기태, "동적인 위협이 존재하는 전장에서의 무인 항공기 지역경로계획", 산업경영시스템학회지, 35(1), pp.39~46 (2012), 한국산업경영시스템학회
- Kim, Y. T., "Effects of Geographic Information on the Performance of Multiple Ground Target Tracking System Using Multiple Sensors", Journal of Korea Navigation Institute, 2(1), pp.43~52 (1998)
- Ohsumi, A., "Optimal search for a Makovian target", Naval Research Logistics, 38(4), pp.531~554 (1991)
- Pollock, S. M., "A simple model of search for a moving target", Operations Research, 18, pp.883~903 (1970)
- Pursiheimo, U., "A control theory approach in the theory of search when the motion of the target is conditionally deterministic with stochastic parameters", Applied Mathematics and Optimization, 2, pp.259~264 (1976)
- Richardson, H. R., "Operations analysis during the underwater search for Scorpion", Naval Research Logistics Quarterly, 18, pp.141~157 (1971)
- Royset, J.O., "Route optimization for multiple searchers", Naval Research Logistics, 57, pp.701~717 (2010)
- 신내호, "지형공간정보 기반의 침투위험도 예측 모델을 이용한 최적침투지역 분석", 한국군사과학기술학회지, 12(2), pp.199~205 (2009), 한국군사과학기술학회
- Stewart, T. J., "Search for a moving target when searcher motion is restricted", Computer and Operations Research, 6, pp.129~140 (1979)
- Washburn, A. R., "Search for a moving target : The FAB algorithm", Operations Research, 31(4), pp.739~751 (1983)