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

• Journal of the Korean Operations Research and Management Science Society
• /
• v.15 no.2
• /
• pp.71-83
• /
• 1990

This paper concerns the analyses of dynamic adjustments in noncooperative games where the market informations are given at discrete time intervals. During the game period, the market informations are given at discrete time intervals. During the game period, the inventories initially stored by players are to be released one day based to the completely competitive market so as to maximize each player's revenue, where players' parameters are unknown one another. Game results have shown that the continuous dynamic adjustment does not necessarily assure the better revenue, and if a player thinks that his parameter is underestimated by hig opponent, then he is better overestimate his opponent's parameter.

• Journal of Korea Game Society
• /
• v.4 no.3
• /
• pp.55-64
• /
• 2004

A dynamic graph is suitable for representing and managing dynamic changable obstacles or terrain information in 2D/3D games such as RPG and Strategy Simulation Games. We propose a dynamic hierarchical graph model with fixed level to perform a quick A* path finding. We divide a graph into subgraphs by using space classification and space model, and construct a hierarchical graph. And then we perform a quick path fading on the graph by using our dynamic graph operators. With our experiments we show that this graph model has efficient properties for finding path in a dynamic game environment.

• Journal of Korea Game Society
• /
• v.10 no.2
• /
• pp.67-80
• /
• 2010

Investigating the trend of online gamers plays an important role in forecasting, marketing and making policy decision in gaming industry. In this regards, various studies on gamers' trend and characteristics have been conducted. However, these precedent studies show limitation that they're static analysis since they are usually based on the surveys at a certain point. Therefore, this paper aims to identify some implications on forthcoming directions of gaming industry by analyzing dynamic trend of gamers based on the 8 years(from 2002 to 2009) of data from White Paper on Korean Games. Major implications found in this paper are as follows. Negative perception of games increases as the number of gamers increases. Among juveniles, games became a substitute for TV and the amount of time they play games depends on the existence and type of popular games of that time. Also, most item trading is intensively done by a small number of gamers.

• Journal of Korea Game Society
• /
• v.6 no.1
• /
• pp.3-10
• /
• 2006

In computer games, the level design and balance of characters are the key features for developing interesting games. Level designers make decision to change the parameters and opponent behaviors in order to avoid the player getting extremely frustrated with the improper level. Generally, opponent behavior is defined by static script, this causes the games to have static difficulty level and static environment. Therefore, it is difficult to keep track of the user playing interest, because a player can easily adapt to changeless repetition. In this paper, we propose a dynamic scripting method that able to maintain the level designers' intention where user enjoys the game by adjusting the opponent behavior while playing the game. The player's countermeasure pattern for dynamic level design is modeled using a Gaussian Mixture Model (GMM). The proposed method is applied to a shooting game, and the experimental results maintain the degree of interest intended by the level designer.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.363-366
• /
• 2010

Currently social games with an emphasis on the relationship between the friends, especially women customers, have contributed to the expansion of game market attracting large audiences. Though recent interest in social games and the explosive propagation of social game into game industry, scholarly research for social game is insufficient. The objective of the study is to explore the success factors for successful social games. We suggest the guidelines for development of social game. Commercial success of social games and the number of users with the best game, farmville, were investigated for understanding key success factors in social game field. As a result, social interaction, simple interface, non-dynamic methods, instrumental rationality factors have been identified. This study will expect the guideline in order to develop a successful social games.

• ETRI Journal
• /
• v.39 no.2
• /
• pp.181-190
• /
• 2017

The movements of the human body are difficult to capture owing to the complexity of the three-dimensional skeleton model and occlusion problems. In this paper, we propose a motion capture system that tracks dynamic human motions in real time. Without using external markers, the proposed system adopts multiple depth sensors (Microsoft Kinect) to overcome the occlusion and body rotation problems. To combine the joint data retrieved from the multiple sensors, our calibration process samples a point cloud from depth images and unifies the coordinate systems in point clouds into a single coordinate system via the iterative closest point method. Using noisy skeletal data from sensors, a posture reconstruction method is introduced to estimate the optimal joint positions for consistent motion generation. Based on the high tracking accuracy of the proposed system, we demonstrate that our system is applicable to various motion-based training programs in dance and Taekwondo.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1989.10a
• /
• pp.45-50
• /
• 1989

The above theorm states that much larger classes of differential games have an equilibrium. The most severe assumption is the second one. It requires that state dynamic equations be linear on his own control variables. But, the dynamic programming approach applied in the above is hardly implementable for the purpose of computation. It is very difficult to solve (SP$_{it}$) directly. Notice, however, the problem can be transformed into a Hamiltonian maximization problem which is easy to solve if initial conditions are given. In this way, it is possible to design a solution algorithm to problems with nonlinear constraints. The above two theorems probide a basis for such an algorithm.m.

• Journal of Korea Game Society
• /
• v.1 no.1
• /
• pp.42-48
• /
• 2001

Collision is a brief dynamic event consisting of the close approach of two or more objects or particles resulting in an abrupt change of momentum or exchange of energy because of interaction. Collisions play very important role in computer graphics, computer games and animations fields. Collisions can supply active interaction between cyberspace and real world and give much interests for making nice games so reasonable collision detection algorithms are needed. Collision detection algorithms should satisfy being fast and accuracy. In this paper, we survey the 2D collision detection algorithms between geometric models. We present several methods and system available for collision detection.

• Journal of the Korea Society of Computer and Information
• /
• v.28 no.12
• /
• pp.89-96
• /
• 2023

In this paper, we propose a GPU-based method for real-time processing of dynamic re-meshing required for tearing cloth. Thin shell materials are used in various fields such as physics-based simulation/animation, games, and virtual reality. Tearing the fabric requires dynamically updating the geometry and connectivity, making the process complex and computationally intensive. This process needs to be fast, especially when dealing with interactive content. Most methods perform re-meshing through low-resolution simulations to maintain real-time, or rely on an already segmented pattern, which is not considered dynamic re-meshing, and the quality of the torn pattern is low. In this paper, we propose a new GPU-optimized dynamic re-meshing algorithm that enables real-time processing of high-resolution fabric tears. The method proposed in this paper can be used for virtual surgical simulation and physics-based modeling in games and virtual environments that require real-time, as it allows dynamic re-meshing rather than pre-split meshes.