The Research on Optimal Search Path for a Moving Target in a fixed Area
碩士 === 國防管理學院 === 國防決策科學研究所 === 91 === We building an anti-submarine model to estimate the maximized detect probability with restrict search effort. A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/48865350692492253099 |
| id |
ndltd-TW-091NDMC1683012 |
|---|---|
| record_format |
oai_dc |
| spelling |
ndltd-TW-091NDMC16830122016-06-22T04:20:05Z http://ndltd.ncl.edu.tw/handle/48865350692492253099 The Research on Optimal Search Path for a Moving Target in a fixed Area 固定區域移動目標最佳搜索方式之研究 簡慧超 碩士 國防管理學院 國防決策科學研究所 91 We building an anti-submarine model to estimate the maximized detect probability with restrict search effort. A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher is provided with the initial target distribution and intelligence on historical target tracks. This track information is in the form of a transition matrix which assigns a probability of the target moving from one discrete cell in the search area to another during one time period. The searcher’s problem is to select search path to maximize the probability of detecting the target by some specified time. 孟昭宇 2003 學位論文 ; thesis 48 zh-TW |
| collection |
NDLTD |
| language |
zh-TW |
| format |
Others
|
| sources |
NDLTD |
| description |
碩士 === 國防管理學院 === 國防決策科學研究所 === 91 === We building an anti-submarine model to estimate the maximized detect probability with restrict search effort. A search is conducted for a target moving in discrete time among a finite number of cells according to a known Markov process. The searcher is provided with the initial target distribution and intelligence on historical target tracks. This track information is in the form of a transition matrix which assigns a probability of the target moving from one discrete cell in the search area to another during one time period. The searcher’s problem is to select search path to maximize the probability of detecting the target by some specified time.
|
| author2 |
孟昭宇 |
| author_facet |
孟昭宇 簡慧超 |
| author |
簡慧超 |
| spellingShingle |
簡慧超 The Research on Optimal Search Path for a Moving Target in a fixed Area |
| author_sort |
簡慧超 |
| title |
The Research on Optimal Search Path for a Moving Target in a fixed Area |
| title_short |
The Research on Optimal Search Path for a Moving Target in a fixed Area |
| title_full |
The Research on Optimal Search Path for a Moving Target in a fixed Area |
| title_fullStr |
The Research on Optimal Search Path for a Moving Target in a fixed Area |
| title_full_unstemmed |
The Research on Optimal Search Path for a Moving Target in a fixed Area |
| title_sort |
research on optimal search path for a moving target in a fixed area |
| publishDate |
2003 |
| url |
http://ndltd.ncl.edu.tw/handle/48865350692492253099 |
| work_keys_str_mv |
AT jiǎnhuìchāo theresearchonoptimalsearchpathforamovingtargetinafixedarea AT jiǎnhuìchāo gùdìngqūyùyídòngmùbiāozuìjiāsōusuǒfāngshìzhīyánjiū AT jiǎnhuìchāo researchonoptimalsearchpathforamovingtargetinafixedarea |
| _version_ |
1718317082581401600 |