• Proceedings of the Korea Society of Design Studies Conference
• /
• 2003.05a
• /
• pp.216-217
• /
• 2003

• Journal of Korea Game Society
• /
• v.10 no.3
• /
• pp.83-92
• /
• 2010

The command that game users give should be reflected to the game immediately and should be transferred to several objects at once. Also, all game users who participate in game should keep the same progress situation in Real-Time Strategy game. But it takes a certain amount of time to get the command pass to other users, and it is important issue that many commands are synchronized in a short amount of time on server of RTS game. Therefore we propose a scheme for an efficient synchronization based on event locking method on RTS game in this paper. We design and implement the gaming server applying to our proposed scheme. Also, we show efficiency of our proposed scheme by performance analysis in this paper.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2019.07a
• /
• pp.87-88
• /
• 2019

제안 방법은 유니티 5엔진을 이용하여 횡스크롤 실시간 전략(RTS, Real Time Simulation) 게임은 여러공격로에서 상대방과 서로 여러 거점을 점령하여 실시간으로 전략을 겨루는 게임의 개발을 목표로 한다. 제안 게임은 횡스크롤의 장점인 조작법의 단순함을 살리며 플레이어가 실시간으로 전략을 겨룰 수 있도록 개발 한다. 게임을 처음 접하는 플레이어와 게임을 많이 플레이하여 숙련도가 높은 플레이어 양 쪽에게 모두 장점으로 작용 한다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.6
• /
• pp.943-950
• /
• 2002

Real time strategy game is a computer game genre of Playing with human or computer opponents in real time It differs from turn-type computer games in the game process method. Turn type games, such as chess, allow only one Player to move at a time. Real time strategy games allow two or more Players to move simultaneously. Therefore, in real time strategy computer games, the game components' movement plans must be calculated very quickly in order to not disturb other processes such as gathering resources, building structures, and combat activities. There are many approaches, which can reduce the amount of memory required for calculating path, search space, and reactive time of components. (or units). However, existing path finding algorithms tend to concentrate on achieving optimal Paths that are not as important or crucial in real time strategy game. This Paper introduces Dynamic Heuristic Af(DHA*) algorithm which is capable of reducing search space and reactive time of game units and compares with A* algorithm using static heuristic weighting.

• Proceedings of the Korean Society of Computer Information Conference
• /
• 2017.07a
• /
• pp.60-61
• /
• 2017

모바일 게임 시장은 매년 시장 규모가 확대되고 있으며, 대중의 관심 또한 꾸준히 높아지고 있다. 모바일 게임은 대체로 조작이 간단하고 장소에 따른 제약이 없기 때문에 접근하기 쉽다는 특징을 가지고 있으며 이 때문에 앞으로도 모바일 게임 시장의 전망은 밝다고 할 수 있다. 본 논문에서는 모바일 게임에서 가장 성공한 장르 중 하나인 소셜 네트워크 게임 중에서도 RTS 장르의 게임을 기획, 설계 구현한 것에 대해 다루었다.

• Journal of Korea Multimedia Society
• /
• v.12 no.12
• /
• pp.1761-1768
• /
• 2009

In this paper, we implemented online real time strategy game using hand as the mouse in augmented reality. Also, we introduced the algorithm for detecting hand direction, finding fingertip of the index finger and counting the number of fingers for interaction between users and the virtual objects. The proposed method increases the reality of the game by combining the real world and the virtual objects. Retinex algorithm is used to remove the effect of illumination change. The implementation of the virtual reality in the online environment enables to extend the applicability of the proposed method to the areas such as online education, remote medical treatment, and mobile interactive games.

• Journal of the Korea Convergence Society
• /
• v.11 no.10
• /
• pp.45-51
• /
• 2020

Recently, many games provide data related to the users' game play, and there have been a few studies that predict opponent move by combining machine learning methods. This study predicts opponent move using match data of a real-time strategy game named ClashRoyale and a multi-label classification based on machine learning. In the initial experiment, binary card properties, binary card coordinates, and normalized time information are input, and card type and card coordinates are predicted using random forest and multi-layer perceptron. Subsequently, experiments were conducted sequentially using the next three data preprocessing methods. First, some property information of the input data were transformed. Next, input data were converted to nested form considering the consecutive card input system. Finally, input data were predicted by dividing into the early and the latter according to the normalized time information. As a result, the best preprocessing step was shown about 2.6% improvement in card type and about 1.8% improvement in card coordinates when nested data divided into the early.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2008.11a
• /
• pp.1280-1283
• /
• 2008

The network performance of MOGs(Multiplayer Online Games) can be measured by the amount of network loads and the response times on user inputs. This paper introduces a frame locking algorithm and a game turn algorithm that have been used for game synchronization in the area of RTS(Real-time Strategy Simulation) Games, a kind of MOG; the results of performance evaluation of these two algorithms are also given. In addition, a server architecture for MOG servers in which replacing synchronization algorithms can be done easily for pursuing efficient performance evaluation, is also introduced.

• 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.

• Journal of Korea Game Society
• /
• v.7 no.4
• /
• pp.93-104
• /
• 2007

In the complex real-time multi-agent system such as game environment, dynamic task allocations are repeatedly performed to achieve a goal in terms of system efficiency. In this research, we present a task allocation scheme suitable for the real-time multi-agent environment. The scheme is to optimize the task allocation by complementing existing coordination agent with $A^*$ algorithm. The coordination agent creates a status graph that consists of nodes which represent the combinations of tasks and agents, and refines the graph to remove nodes of non-execution tasks and agents. The coordination agent performs the selective utilization of the $A^*$ algorithm method and the greedy method for real-time re-allocation. Then it finds some paths of the minimum cost as optimized results by using $A^*$ algorithm. Our experiments show that the coordination agent with $A^*$ algorithm improves a task allocation efficiency about 25% highly than the coordination agent only with greedy algorithm.