Browse > Article
http://dx.doi.org/10.11627/jkise.2015.38.4.11

Search for Ground Moving Targets Using Dynamic Probability Maps  

Kim, Eun-Kyu (Department of Industrial Engineering, Hannam University)
Choi, Bong-Wan (Department of Industrial Engineering, Hannam University)
Yim, Dong-Soon (Department of Industrial Engineering, Hannam University)
Publication Information
Journal of Korean Society of Industrial and Systems Engineering / v.38, no.4, 2015 , pp. 11-21 More about this Journal
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.
Keywords
Dynamic Probability Maps; Ground Moving Targets; Search;
Citations & Related Records
Times Cited By KSCI : 6  (Citation Analysis)
연도 인용수 순위
1 Army HQs, ROK, FM 0-3, Anti-Infitration Operations, 2005.
2 Army HQs, ROK, Geospatial Analysis Guide, 2014.
3 Bang, S.N., Heo, J., Sohn, H.G., and Lee, Y.W., Analysis of Infiltration Route using Optimal Path finding Methods and Geospatial Information. Korean society of Civil Engineers Magazine, 2006, Vol. 26, No. 1, pp. 195-202.
4 Bang, S.N., Sohn, H.G., Kim, S.P., Kim, C.J., and Heo, J., Analysis of Optimal Infiltration Route using Genetic Algorithm. Korean Journal of Remote Sensing, 2011, Vol. 27, No. 1, pp. 59-68.   DOI
5 Benkoski, S., Monticino, M., and Weisinger, J., A survey of the search theory literature. Naval Research Logistics, 1991, Vol. 38, pp. 469-494.   DOI
6 Brown, S.S., Optimal search for a moving target in discrete time and space. Operations Research, 1980, Vol. 28, No. 6, pp. 1275-1286.   DOI
7 Cho, S.J., A Study on the Target Search Logic in the ASW Decision Support System. Journal of Korea Institute of Military Science and Technology, 2010, Vol. 13, No. 5, pp. 824-830.
8 Dell, R.F., Eagle, J., Martins, J., and Santos, A., Using multiple searchers in constrained path, moving target search problem. Naval Research, Logistics, 1996, Vol. 43, pp. 463-480.   DOI
9 Eagle, J.N. and Yee, J., An Optimal Branch-And-Bound procedure for a constrained path, moving target search problem. Operations Research, 1990, Vol. 38, No. 1, pp. 110-114.   DOI
10 Hong, S.P., Cho, S.J., Park, M.J., and Lee, M.G., Optimal search-relocation trade-off in Markovian-target searching. Computers and Operations Research, 2009, Vol. 36, pp. 2097-2104.   DOI
11 Hong, S.P., Cho, S.J., and Park, M.J., A Pseudo-Polynomial heuristic for path-constrained discrete-time Markovian target search. European Journal of Operational Research, 2009, Vol. 193, pp. 351-364.   DOI
12 Hohzaki, R., Iida, K., and Kiyama, M., Randomized look strategy for a moving target when a search path is given. Journal of Operations Research Society of Japan, 1998, Vol. 41, No. 3, pp. 374-386.   DOI
13 Koopman, B.O., Search and screening, 2nd ed. Pergamon Press, Newyork, 1989.
14 Kim, C.M., Ahn, J.J., and Kim, B.S., Design of Probabilistic Model for Optimum Manpower Planning in R&D Development. Journal of the Korean Society for Quality Management, 2013, Vol. 41, No. 1, pp. 149-162.   DOI
15 Kim, K.T., Park, S.H., Cho, S.J., and Jeon, G.W., An Optimal Path Planning for Survival Rate Maximization of Submarine. Journal of the Military Operations Research Society of Korea, 2010, Vol. 36, No. 3, pp. 135-145.
16 Kim, K.T. and Jeon, G.W., A Path Planning to maximize Survivability for Unmanned Aerial Vehicle by using A*PS-PGA. Journal of the Society of Korea Industrial and Systems Engineering, 2011, Vol. 34, No. 3, pp. 24-34.
17 Kim, K.T., Nam, Y.K., and Cho, S.J., A Local path planning for Unmanned Aerial Vehicle on the Battlefield of Dynamic Threats. Journal of the Society of Korea Industrial and Systems Engineering, 2012, Vol. 35, No. 1, pp. 39-46.
18 Pollock, S.M., A simple model of search for a moving target, Operations Research, 1970, Vol. 18, pp. 883-903.   DOI
19 Kim, Y.T., Lee, E.G., and Kim, W.S., Effects of Geographic Information on the Performance of Multiple Ground Target Tracking System Using Multiple Sensors. Journal of Korea Navigation Institute, 1998, Vol. 2, No. 1, pp. 43-52.
20 Ohsumi, A., Optimal search for a Makovian target. Naval Research Logistics, 1991, Vol. 38, No. 4, pp. 531-554.   DOI
21 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, 1976, Vol. 2, pp. 259-264.
22 Richardson, H.R., Stone, L.D., and Wagner, D.H., Operations analysis during the underwater search for Scorpion. Naval Research Logistics Quarterly, 1971, Vol. 18, pp. 141-157.   DOI
23 Royset, J.O. and Sato, H., Route optimization for multiple searchers. Naval Research Logistics, 2010, Vol. 57, pp. 701-717.   DOI
24 Sin, N.H., Oh, M.H., Choe, H.R., Chung, D.Y., and Lee, Y.W., Analysis of Infiltration Area using prediction Model of Infiltration Risk based on Geospatial Information. Journal of Korea Institute of Military Science and Technology, 2009, Vol. 12, No. 2, pp. 199-205.
25 Stewart, T.J., Search for a moving target when searcher motion is restricted. Computer and Operations Research, 1979, Vol. 6, pp. 129-140.   DOI
26 Washburn, A.R., Search for a moving target : The FAB algorithm. Operations Research, 1983, Vol. 31, No. 4, pp. 739-751.   DOI