Search plan for multiple moving targets with search priorities incorporated탐지 우선순위를 고려한 복수 이동표적의 탐지계획

Cited 0 time in webofscience Cited 0 time in scopus
  • Hit : 455
  • Download : 0
This thesis deals with an one-searcher multi-target search problem where targets with different detection priorities move in Markov processes in each discrete time over a given space search area, and the total number of search time intervals is fixed. A limited search resource is available in each search time interval and an exponential detection function is assumed. The searcher can obtain a target detection award, if detected, which represents the detection priority of target and is non-increasing with time. The objective is to establish the optimal search plan which allocates the search resource effort over the search areas in each time interval in order to maximize the total detection award. in the analysis, it is shown that the given problem can be decomposed into intervalwise individual search problems each being treated as a single stationary target problem for each time interval. Thus, an iterative procedure is derived to solve a sequence of stationary target problems. The computational results show that the proposed algorithm guarantees optimality.
Advisors
Sung, Chang-Supresearcher성창섭researcher
Description
한국과학기술원 : 산업공학과,
Publisher
한국과학기술원
Issue Date
2004
Identifier
238286/325007  / 020023062
Language
eng
Description

학위논문(석사) - 한국과학기술원 : 산업공학과, 2004.2, [ iii, 37 p. ]

Keywords

SEARCH PRIORITY; MULTIPLE MOVING TARGETS; SEARCH PLAN; MARKOV PROCESS; 탐지 우선순위; 이동표적; 탐지계획; DETECTION

URI
http://hdl.handle.net/10203/41729
Link
http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=238286&flag=dissertation
Appears in Collection
IE-Theses_Master(석사논문)
Files in This Item
There are no files associated with this item.

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0