• Journal of the Korea Institute of Military Science and Technology
• /
• v.25 no.4
• /
• pp.390-400
• /
• 2022

Military deception is an action executed to deliberately mislead enemy's decision by deceiving friendly forces intention. In the lessons learned from war history, deception appears to be a critical factor in the battlefield for successful operations. As training using war-game simulation is growing more important, it is become necessary to implement military deception in war-game model. However, there is no logics or rules proven to be effective for CGF(Computer Generated Forces) to conduct deception behavior automatically. In this study, we investigate methodologies for CGF to learn and conduct military deception using Reinforcement Learning. The key idea of the research is to define a new criterion called a "deception index" which defines how agent learn the action of deception considering both their own combat objectives and deception objectives. We choose Korea Marine Corps Amphibious Demonstrations to show applicability of our methods. The study has an unique contribution as the first research that describes method of implementing deception behavior.

• Journal of Korea Game Society
• /
• v.18 no.5
• /
• pp.59-66
• /
• 2018

In this paper, one of the traditional game, Gonu game, is implemented and experimented. The Minimax algorithm was applied as a technique to implement the Gonu game. We proposed an evaluation function to implement game in Minimax algorithm. We analyze the efficiency of algorithm for alpha beta pruning to improve the performance after implementation of Gonu game. Weights were analyzed for optimal analysis that affected the win or loss of the game. For the weighting analysis, a competition of human and computer was performed. We also experimented with computer and computer. As a result, we proposed a weighting value for optimal attack and defense.

• Proceedings of the Korea Information Assurance Society Conference
• /
• 2004.05a
• /
• pp.219-225
• /
• 2004

There is increasing tension in the Korean Peninsula from the US' putting the NK's nuclear issue along the line of war in Iraq. However, there is worsening in ROK's field exercise condition from decresing defense financial supports, being difficlut to obtain enough space for volumable exercises, and securities and circumstances issues. With acknowleging those problems, CPX(Command Post Exercise), namely war game exercise which is more economical and scientific exercise has earned its attention as the best alternative measure of field exercise war game exercise has already been applyied to independent, joint, and combined exercises. However, the current war game system contains lots of problems in terms of security. Defense network uses dedicated line isolated with internet and secure data through network level encoding. It is vulerable to get attack during war game exercise or from credited network. System security is also subject to reinforced. This research is performed focusing on network and system level securities, and through it, the author will show the effective and optimized security solution for war game system.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10b
• /
• pp.474-479
• /
• 1993

A study about two-dimensional pursuit-evasion dynamic games is presented and discussed. A pursuer tries to intercept an evader by a strategy based on proportional navigation guidance, while the evader tries to maximize a miss distance by the optimal control. The study is applied to a ball game and an air-combat game. The results show the same features exist in both games, therefore the study will be able to apply for general two dimensional dynamic games. In the ball game, the study is extended to cases where a goal exists, while in the air-combat game, some three-dimensional problems are solved and the results are also shown.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.4
• /
• pp.1-9
• /
• 2013

We propose a heuristic algorithm for war-game model that is appropriate for warfare in which the maneuver of the attacker is relatively certain. Our model is based on a multi-weapon extention of the Lanchester's square law. However, instead of dealing with the differential equations, we use a multi-period linear approximation which not only facilitates a solution method but also reflects discrete natures of warfare. Then our game model turns out to be a continuous game known to have an ${\varepsilon}$-Nash equilibrium for all ${\varepsilon}{\geq}0$. Therefore, our model approximates an optimal warfare strategies for both players as well as an efficient reinforcement of area defense system that guarantees a peaceful equilibrium. Finally, we report the performance of a practical best-response type heuristic for finding an ${\varepsilon}$-Nash equilibrium for a real-scale problem.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2015.01a
• /
• pp.5-8
• /
• 2015

모바일 게임 시장이 날이 갈수록 발전하고 성장하는 가운데 Unity 게임 엔진은 하나의 코드로 여러 플랫폼에서 동작하도록 하여 게임 개발이 전문가들만이 개발할 수 있는 영역이 아닌 누구나 쉽게 개발할 수 있도록 해주는 환경으로 인기를 받고 있다. 이에 따라 Unity 엔진을 이용하여 퍼즐 게임과 타워 디펜스 장르를 합친 퍼즐디펜스로 복합장르를 적용한 게임을 개발하였다.

• International Journal of Aeronautical and Space Sciences
• /
• v.17 no.2
• /
• pp.204-213
• /
• 2016

A differential game theory based approach is used to develop an automated maneuver generation algorithm for Within Visual Range (WVR) air-to-air combat of unmanned combat aerial vehicles (UCAVs). The algorithm follows hierarchical decisionmaking structure and performs scoring function matrix calculation based on differential game theory to find the optimal maneuvers against dynamic and challenging combat situation. The score, implying how much air superiority the UCAV has, is computed from the predicted relative geometry, relative distance and velocity of two aircrafts. Security strategy is applied at the decision-making step. Additionally, a barrier function is implemented to keep the airplanes above the altitude lower bound. To shorten the simulation time to make the algorithm more real-time, a moving horizon method is implemented. An F-16 pseudo 6-DOF model is used for realistic simulation. The combat maneuver generation algorithm is verified through three dimensional simulations.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.01a
• /
• pp.77-78
• /
• 2019

게임엔진을 이용한 FPS 디펜스 게임은 유니티3D 엔진을 사용하여 개발 하였으며 1인칭 시점으로 제한시간동안 몰려오는 적군을 막아내며 목표물을 지키는 게임이다. 많은 오브젝트를 관리하기 위해서 오브젝트 풀링을 사용하여 오브젝트가 생성-제거의 반복시 메모리에 부담을 주게되는 것을 씬 시작시 가용할 오브젝트를 불러온 뒤에 필요시에만 사용 하는 방법으로 메모리의 부담을 적게 하였고 플레이 기록을 랭킹으로 하여 사용자 간에 경쟁심을 유발 할 수 있도록 하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.12
• /
• pp.5819-5840
• /
• 2018

Considering the topology of hierarchical tree structure, each cluster in WSNs is faced with various attacks launched by malicious nodes, which include network eavesdropping, channel interference and data tampering. The existing intrusion detection algorithm does not take into consideration the resource constraints of cluster heads and sensor nodes. Due to application requirements, sensor nodes in WSNs are deployed with approximately uncorrelated security weights. In our study, a novel and versatile intrusion detection system (IDS) for the optimal defense strategy is primarily introduced. Given the flexibility that wireless communication provides, it is unreasonable to expect malicious nodes will demonstrate a fixed behavior over time. Instead, malicious nodes can dynamically update the attack strategy in response to the IDS in each game stage. Thus, a multi-stage intrusion detection game (MIDG) based on Bayesian rules is proposed. In order to formulate the solution of MIDG, an in-depth analysis on the Bayesian equilibrium is performed iteratively. Depending on the MIDG theoretical analysis, the optimal behaviors of rational attackers and defenders are derived and calculated accurately. The numerical experimental results validate the effectiveness and robustness of the proposed scheme.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2021.07a
• /
• pp.539-540
• /
• 2021

본 논문에서는 랜덤 생성 알고리즘을 도입한 디펜스 게임을 제안한다. 기존의 디펜스 게임은 지형물의 변형 및 확장이 불가능하다. 그것에 착안하여 지형물들의 위치가 랜덤으로 생성되는 시스템을 도입하였다. 본 게임은 지형물이 랜덤으로 생성되지만, 난이도에 따라 연속적으로 생성될 수 있는 지형물의 개수를 차별화하고, 사용자가 추가로 설치할 수 있는 지형물의 개수에 제한을 두었다. 또한 조작 가능한 캐릭터를 생성해 적을 공격할 수 있게 구현하여 사용자의 몰입도를 높여줄 것으로 기대한다.