RISS 학술연구정보서비스

검색
다국어 입력

http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

변환된 중국어를 복사하여 사용하시면 됩니다.

예시)
  • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
  • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
닫기
    인기검색어 순위 펼치기

    RISS 인기검색어

      KCI등재

      동적 확률지도를 이용한 지상 이동표적 탐색 = Search for Ground Moving Targets Using Dynamic Probability Maps

      한글로보기

      https://www.riss.kr/link?id=A101706982

      • 0

        상세조회
      • 0

        다운로드
      서지정보 열기
      • 내보내기
      • 내책장담기
      • 공유하기
      • 오류접수

      부가정보

      다국어 초록 (Multilingual 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.
      번역하기

      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, camo...

      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.

      더보기

      목차 (Table of Contents)

      • Abstract
      • 1. 서론
      • 2. 기존 연구 고찰
      • 3. 침투경로 분석
      • 4. 우선탐색지역 선정 위한 동적 확률지도생성
      • Abstract
      • 1. 서론
      • 2. 기존 연구 고찰
      • 3. 침투경로 분석
      • 4. 우선탐색지역 선정 위한 동적 확률지도생성
      • 5. 사례연구
      • 6. 결론
      • References
      더보기

      참고문헌 (Reference)

      1 방수남, "지형공간정보 및 최적탐색기법을 이용한 최적침투경로 분석" 대한토목학회 26 (26): 195-202, 2006

      2 신내호, "지형공간정보 기반의 침투위험도 예측 모델을 이용한 최적침투지역 분석" 한국군사과학기술학회 12 (12): 199-205, 2009

      3 김기태, "잠수함 생존율 극대화를 위한 최적 이동경로 계획" 한국국방경영분석학회 36 (36): 135-145, 2010

      4 방수남, "유전자 알고리즘을 이용한 최적침투경로 분석" 대한원격탐사학회 27 (27): 59-68, 2011

      5 김종만, "연구개발 부문 적정인력 산정을 위한 확률적 모형설계에 관한 연구" 한국품질경영학회 41 (41): 149-162, 2013

      6 김기태, "동적인 위협이 존재하는 전장에서의 무인 항공기 지역경로계획" 한국산업경영시스템학회 35 (35): 39-46, 2012

      7 조성진, "대잠전 의사결정지원 시스템에서 표적 탐색 논리 연구" 한국군사과학기술학회 13 (13): 824-830, 2010

      8 Dell, R. F., "Using multiple searchers in constrained path, moving target search problem" 43 : 463-480, 1996

      9 Stewart, T. J., "Search for a moving target when searcher motion is restricted" 6 : 129-140, 1979

      10 Washburn, A. R., "Search for a moving target : The FAB algorithm" 31 (31): 739-751, 1983

      1 방수남, "지형공간정보 및 최적탐색기법을 이용한 최적침투경로 분석" 대한토목학회 26 (26): 195-202, 2006

      2 신내호, "지형공간정보 기반의 침투위험도 예측 모델을 이용한 최적침투지역 분석" 한국군사과학기술학회 12 (12): 199-205, 2009

      3 김기태, "잠수함 생존율 극대화를 위한 최적 이동경로 계획" 한국국방경영분석학회 36 (36): 135-145, 2010

      4 방수남, "유전자 알고리즘을 이용한 최적침투경로 분석" 대한원격탐사학회 27 (27): 59-68, 2011

      5 김종만, "연구개발 부문 적정인력 산정을 위한 확률적 모형설계에 관한 연구" 한국품질경영학회 41 (41): 149-162, 2013

      6 김기태, "동적인 위협이 존재하는 전장에서의 무인 항공기 지역경로계획" 한국산업경영시스템학회 35 (35): 39-46, 2012

      7 조성진, "대잠전 의사결정지원 시스템에서 표적 탐색 논리 연구" 한국군사과학기술학회 13 (13): 824-830, 2010

      8 Dell, R. F., "Using multiple searchers in constrained path, moving target search problem" 43 : 463-480, 1996

      9 Stewart, T. J., "Search for a moving target when searcher motion is restricted" 6 : 129-140, 1979

      10 Washburn, A. R., "Search for a moving target : The FAB algorithm" 31 (31): 739-751, 1983

      11 Koopman, B. O., "Search and screening" Pergamon Press 1989

      12 Royset, J.O., "Route optimization for multiple searchers" 57 : 701-717, 2010

      13 Hohzaki, R., "Randomized look strategy for a moving target when a search path is given" 41 (41): 374-386, 1998

      14 Army HQs, "ROK, Geospatial Analysis Guide"

      15 Army HQs, "ROK, FM 0-3"

      16 Hong, S. P., "Optimal search-relocation trade-off in Markovian-target searching" 36 : 2097-2104, 2009

      17 Brown, S. S., "Optimal search for a moving target in discrete time and space" 28 (28): 1275-1286, 1980

      18 Ohsumi, A., "Optimal search for a Makovian target" 38 (38): 531-554, 1991

      19 Richardson, H. R., "Operations analysis during the underwater search for Scorpion" 18 : 141-157, 1971

      20 Kim, Y. T., "Effects of Geographic Information on the Performance of Multiple Ground Target Tracking System Using Multiple Sensors" 2 (2): 43-52, 1998

      21 Eagle, J.N., "An Optimal Branch-And-Bound procedure for a constrained path, moving target search problem" 38 (38): 110-114, 1990

      22 김기태, "A*PS-PGA를 이용한 무인 항공기 생존성 극대화 경로 계획" 한국산업경영시스템학회 34 (34): 24-34, 2011

      23 Benkoski, S., "A survey of the search theory literature" 38 : 469-494, 1991

      24 Pollock, S. M., "A simple model of search for a moving target" 18 : 883-903, 1970

      25 Pursiheimo, U., "A control theory approach in the theory of search when the motion of the target is conditionally deterministic with stochastic parameters" 2 : 259-264, 1976

      26 Hong, S. P., "A Pseudo-Polynomial heuristic for path-constrained discrete-time Markovian target search" 193 : 351-364, 2009

      더보기

      동일학술지(권/호) 다른 논문

      동일학술지 더보기

      더보기

      분석정보

      View

      상세정보조회

      0

      Usage

      원문다운로드

      0

      대출신청

      0

      복사신청

      0

      EDDS신청

      0

      동일 주제 내 활용도 TOP

      더보기

      주제

      연도별 연구동향

      연도별 활용동향

      연관논문

      연구자 네트워크맵

      공동연구자 (7)

      유사연구자 (20) 활용도상위20명

      인용정보 인용지수 설명보기

      학술지 이력

      학술지 이력
      연월일 이력구분 이력상세 등재구분
      2027 평가예정 재인증평가 신청대상 (재인증)
      2021-11-29 학회명변경 영문명 : 미등록 -> KOREAN SOCIETY OF INDUSTRIAL AND SYSTEMS ENGINEERING KCI등재
      2021-11-25 학술지명변경 외국어명 : Journal of Society of Korea Industrial and Systems Engineering -> Journal of Korean Society of Industrial and Systems Engineering KCI등재
      2021-01-01 평가 등재학술지 유지 (재인증) KCI등재
      2019-12-04 학술지명변경 한글명 : 산업경영시스템학회지 -> 한국산업경영시스템학회지
      외국어명 : Journal of the Society of Korea Industrial and Systems Engineering -> Journal of Society of Korea Industrial and Systems Engineering
      KCI등재
      2018-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2015-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2011-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2009-01-01 평가 등재학술지 유지 (등재유지) KCI등재
      2006-01-01 평가 등재학술지 선정 (등재후보2차) KCI등재
      2005-01-01 평가 등재후보 1차 PASS (등재후보1차) KCI등재후보
      2003-07-01 평가 등재후보학술지 선정 (신규평가) KCI등재후보
      더보기

      학술지 인용정보

      학술지 인용정보
      기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
      2016 0.34 0.34 0.3
      KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
      0.28 0.28 0.37 0.16
      더보기

      이 자료와 함께 이용한 RISS 자료

      나만을 위한 추천자료

      해외이동버튼