• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.41-47
• /
• 2016

This paper considers simple polygon search problem. How many searchers find a mobile intruder that is arbitrarily faster than the searcher within polygon art gallery? This paper uses the visibility graph that is connected with edges for mutually visible vertices. Given visibility graph, we select vertex u that is conjunction ${\Delta}(G)$ in $N_G(v)$ for $d_G(v){\leq}4$. We decide 1-searchable if $1{\leq}{\mid}u{\mid}{\leq}2$ and 2-searchable if ${\mid}u{\mid}{\geq}3$. We also present searcher's shortest path. This algorithm is verified by varies 1 or 2-searchable polygons.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.43 no.1 s.343
• /
• pp.95-102
• /
• 2006

In this paper, we present the performance analysis and design of a multi-path searcher operating over Rayleigh fading channels when multiple transmit antennas are employed in the down-link of W-CDMA system. The simulation results for the receiver operating characteristics (ROC) for 1, 2, and 4 transmit antennas are presented to corroborate the theoretical analyses. We also propose a procedure to find the optimum parameters of double-dwell serial searcher according to the number of the multiple transmit antennas. Our analyses and simulations indicate that post-detection integration is not necessary when the number of transmit antennas is more than two. Finally, we found that increasing transmit diversity order does not necessarily improve the detection performance when the received pilot signal strength is relatively low. Therefore, this gives us a practical criterion on increasing transmit diversity order.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1355-1362
• /
• 2004

In this paper, we present the performance analysis of a multi-path searcher operating over Rayleigh fading channels when multiple transmit antennas are employed in the down-link of W-CDMA system. The simulation results for the receiver operating characteristics (ROC) for 1, 2, and 4 transmit antennas are presented to corroborate the theoretical analyses. We also propose a procedure to find the optimum parameters of double-dwell serial searcher according to the number of the multiple transmit antennas. Our analyses and simulations indicate that post-detection integration is not necessary when the number of transmit antennas is more than two. Finally, we found that increasing transmit diversity order does not necessarily improve the detection performance when the received pilot signal strength is relatively low. Therefore, this gives us a practical criterion on increasing transmit diversity order.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.38 no.4
• /
• pp.11-21
• /
• 2015

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.