• Proceedings of the Korean Society of Computer Information Conference
• /
• 2016.01a
• /
• pp.267-269
• /
• 2016

본 논문에서는 언리얼 엔진4의 Behavior Tree(행동 트리)를 이용하여 NPC의 다양한 상태와 움직임을 가진 어드벤처 게임 AI를 설계 및 개발하였고, 그 효율성을 분석하였다. Behavior Tree는 상태와 행동을 계층적으로 나누어 AI의 행동을 결정하는 알고리즘으로 FSM(Finite State Machine, 유한상태기계)과 비교하여 유지보수와 행동 규칙 검증의 어려움을 해결하는 데 장점이 있음을 확인하였다.

• ETRI Journal
• /
• v.32 no.1
• /
• pp.22-32
• /
• 2010

The pervasive game environments have activated explosive growth of the Internet over recent decades. Thus, understanding Internet traffic characteristics and precise classification have become important issues in network management, resource provisioning, and game application development. Naturally, much attention has been given to analyzing and modeling game traffic. Little research, however, has been undertaken on the classification of game traffic. In this paper, we perform an interpretive traffic analysis of popular game applications at the transport layer and propose a new classification method based on a simple decision tree, called an alternative decision tree (ADT), which utilizes the statistical traffic characteristics of game applications. Experimental results show that ADT precisely classifies game traffic from other application traffic types with limited traffic features and a small number of packets, while maintaining low complexity by utilizing a simple decision tree.

• Journal of Korea Game Society
• /
• v.11 no.6
• /
• pp.61-70
• /
• 2011

In this paper, we propose a defense NPC control model in the soccer game by applying the Decision Tree learning algorithm. The proposed model extracts the direction patterns and the action patterns generated by many soccer game users, and applies these patterns to the Decision Tree learning algorithm. Then, the proposed model decides the direction and the action according to the learned Decision Tree. Experimental results show that the proposed model takes some time to learn the Decision Tree while the proposed model takes 0.001-0.003 milliseconds to decide the direction and the action based on the learned Decision Tree. Therefore, the proposed model can control NPC in the soccer game system in real time. Also, the proposed model achieves higher accuracy than a previous model (Letia98); because the proposed model can utilize current state information, its analyzed information, and previous state information.

• Journal of Korea Game Society
• /
• v.13 no.4
• /
• pp.25-34
• /
• 2013

Spatial partitioning trees are needed for processing collision detections efficiently. In order to select split planes for spatial partitioning trees, the tree balance and the number of polygons overlapped with the split plane should be considered. In this paper, the heuristic algorithm controlling weight values of tree build criteria is proposed for spatial partitioning trees of 3D games. As the weight values are changed, tree build time, T-junction elimination time which can cause visual artifacts in splitting polygons overlapped with the split plane, rendering speed (frame per second: FPS) according to tree balance are analysed under 3D game simulations.

• Journal of Korea Game Society
• /
• v.11 no.2
• /
• pp.39-44
• /
• 2011

Computer games need game formulas which express game rules by mathematical functions because the game rules are automatically processed by computers. The game formulas are usually multi-variable functions. So the design of a game formula is a complex and difficult problem because it is the same problem of the design of a multi-variable function which should satisfy the related game rules. In this paper we propose a new method which can systematically design game formulas. The purposed method is the decomposing of tree structure for a game formula by analyzing the tree structure of the operands which have single-variable functions on the lowest levels. So the design method can change the complex and difficult problem of the design of a multi-variable function to the simple and easy problem of the design of the single-variable function which should satisfy the related game rules.

• Journal of Korea Game Society
• /
• v.13 no.2
• /
• pp.49-58
• /
• 2013

In this study, a tree growth model is designed to represent a variety of trees consisting of a outdoor terrain of game efficiently and naturally. The proposed tree growth model is an integrated tree growth model, and is configured using the following approaches: (1) the tree modeling method based on growth volume and the convolution sums of divisor functions, which is used to model a variety kind of trees more intuitively and naturally; (2) a rendering method using a level of detail of branch based on instancing for real-time processing of numerous trees with complicated structures; and (3) a combination of the above methods to efficiently implement a game landscape. The natural and diverse growths of trees that emerged using the proposed tree growth model is evaluated through experimentation, along with the possibility of implementing the natural game landscape and the efficiency of real-time processing.

• Journal of Korea Game Society
• /
• v.20 no.5
• /
• pp.53-64
• /
• 2020

Supporting NNS method in KD-Tree algorithm is essential in multidimensional data applications. In this paper, we propose HD-Tree, a high-performance Lock-Free KD-Tree that supports NNS in situations where reads and writes occurs concurrently. HD-Tree reduced the number of synchronization nodes used in NNS and requires less atomic operations during Lock-Free method execution. Comparing with existing algorithms, in a multi-core system with 8 core 16 thread, HD-Tree's performance has improved up to 95% on NNS and 15% on modifying in oversubscription situation.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.6
• /
• pp.1228-1234
• /
• 2007

In this paper, we develop the thinking extension education program for the gifted students of information and prove the validity and effectiveness of the proposed model by presenting the Tic-tac-toe problem as the practical example of the information-gifted students. This model consists of four phases which has the game tree as data structure and the search of game lee as control structure. And the search of game tree becomes the basis of the thinking extension education program. This model gives the help for students to learn representing the problem as tree structure and solving the problem of tree structure using the search method of game tree. The internal ability of the information-gifted for thinking extension of this education program contains the fluency, perceptiveness, originality, power of concentration, imaginative power, analyzing skills, pattern recognition, space sense, synthesizing, problem-solving.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.27 no.2
• /
• pp.259-266
• /
• 2017

In modern society, IT technology based systems are introduced and operated in various fields such as home, industry, and finance. To ensure the safety of society, IT systems introduced throughout society should be protected from cyber attacks. Understanding and checking the current security status of the system is one of the important tasks to response effectively against cyber attacks. In this paper, we analyze limitations of Game Theory and Attack Tree methodologies used to inspect for security vulnerabilities. Based on this, we propose a security vulnerability quantification method that complements the limitations of both methodologies. This provides a more objective and systematic way to inspect for security weaknesses.

• Journal of Korea Multimedia Society
• /
• v.25 no.2
• /
• pp.432-439
• /
• 2022

This paper introduces deliberative behavior tree using utility theory. The proposed approach combine the strengths of behavior trees and utility theory to implement complex behavior of AI agents in an easier and more concise way. To achieve this goal, we devised and implemented three types of additional behavior tree nodes, which evaluate utility values of its own node or its subtree while traversing and selecting its child nodes based on the evaluated values. In order to validate our approach, we implemented a sample scenario using conventional behavior tree and our proposed deliberative tree respectively. And then we compared and analyzed the simulation results.