• Title/Summary/Keyword: Simulation game

Search Result 571, Processing Time 0.031 seconds

Technological trend of VR/AR maintenance training and API Implementation Example based on Unity Engine (VR/AR 정비교육의 기술동향과 유니티 엔진기반의 API 구현사례)

  • Lee, Jee Sung;Kim, Byung Min;Choi, Kyu Hwa;Nam, Tae Hyun;Lim, Chang Joo
    • Journal of the Korean Society for Computer Game
    • /
    • v.31 no.4
    • /
    • pp.111-119
    • /
    • 2018
  • National agencies and corporations are making a lot of efforts to educate mechanics from high school to university and enterprise training center to train as skilled mechanic. but the theoretical training using textbooks and the training using equipment not used in the field did not provide proper maintenance training. And education using special equipment or assuming dangerous situation was very dangerous, so we were carrying out education with video or photo. In recent, there have been a number of cases in which effective training simulations have been researched and developed in order to experience situations and solve problems safely through simulation from simple maintenance to special maintenance by combining VR and AR. This paper describes the comparative study of the existing APIs such as Danuri VR, DisTi Engine and Remote AR for general purpose AR/VR contents. We also proposed a AR/VR API based on Unity 3D Engine for AR/VR maintenance contents. The API can be used for maintenance contents developers efficiently.

Game-Based Content Caching and Data Sponsor Scheme for the Content Network (콘텐츠 네트워크 환경에서 게임이론을 이용한 콘텐츠 캐싱 및 데이터 스폰서 기법)

  • Won, JoongSeop;Kim, SungWook
    • KIPS Transactions on Computer and Communication Systems
    • /
    • v.8 no.7
    • /
    • pp.167-176
    • /
    • 2019
  • Recently, as the types of services that can be enjoyed in mobile telecommunication networks such as social networks and video streaming are increasing, mobile users(MUs) can access mobile contents easily by consuming mobile data. However, under a mobile telecommunication environment, MUs have to pay a high data fee to a network service provider(SP) in order to enjoy contents. The 'data sponsor' technique, introduced as a way to solve this problem, has attracted attention as a breakthrough method for enhancing contents accessibility of MUs. In this paper, we propose an algorithm that determines the optimal discount rate through the Stackelberg game in the data sponsor environment. We also propose an algorithm to design edge caching, which caches highly popular content for MUs on edge server, through many-to-many matching game. Simulation results clearly indicate that the profit for CP's content consumption is improved by about 6~11%, and the profit of CP according to the ratio of edge caching is improved by about 12% than the other existing schemes under data sponsor environment.

Effectiveness Analysis and Utilization of Game System for Military Education and Training (국방 교육훈련을 위한 게임 효과분석 및 활용방안)

  • Park, Heungsoon;Lee, Yunho
    • Journal of Internet Computing and Services
    • /
    • v.23 no.1
    • /
    • pp.95-103
    • /
    • 2022
  • The goal of education and training in military is to foster strong combatants who can fight and defeat enemies. The Korean military is deeply aware of the importance of education & training, and has been introducing various advanced training systems so far. Despite these efforts, however, the military environment to maintain and strengthen the level of training is becoming increasingly difficult. In this study, it was conducted on the effectiveness analysis and utilization of the game system for military education & training through literature review. As a result of literature analysis, the introduction of the game system could be expected to have various effects throughout the cognitive and behavioral areas. Based on this effect analysis, the concept and shape of game system operation for each purpose were derived, and an improved plan using the game system was proposed.

DEVSIF Composer: A Synthesis Tool for Fast Interpretation of Simulation Models

  • Lee, Wan-Bok
    • Journal of information and communication convergence engineering
    • /
    • v.6 no.1
    • /
    • pp.59-63
    • /
    • 2008
  • The methods or algorithms which can accelerate simulation speed became of great importance, as the modeling and simulation methodology for discrete event systems is used in many areas such as model validation/verification and performance evaluation. This paper proposes a tool named, DEVSIF composer. The tool is made of an automated compiled simulation technology and it builds a new composed model which can be executed much fast by composing the component models together. Models are described by our new specification language DEVSIF, which is compatible with object-oriented language and supports representation of a hierarchical model structure. Experimental results demonstrates that DEVSIF composer enhances the simulation speed of a transformed DEVS model 5 times faster than that of the original ones in average.

Adapative Modular Q-Learning for Agents´ Dynamic Positioning in Robot Soccer Simulation

  • Kwon, Ki-Duk;Kim, In-Cheol
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.149.5-149
    • /
    • 2001
  • The robot soccer simulation game is a dynamic multi-agent environment. In this paper we suggest a new reinforcement learning approach to each agent´s dynamic positioning in such dynamic environment. Reinforcement learning is the machine learning in which an agent learns from indirect, delayed reward an optimal policy to choose sequences of actions that produce the greatest cumulative reward. Therefore the reinforcement learning is different from supervised learning in the sense that there is no presentation of input-output pairs as training examples. Furthermore, model-free reinforcement learning algorithms like Q-learning do not require defining or learning any models of the surrounding environment. Nevertheless ...

  • PDF

An Analysis of Player's Behavior Attributes on Social Network Game focused on the Genre of Management Simulation (소셜 네트워크 게임 플레이어의 행동속성 분석 -경영·시뮬레이션 장르를 중심으로-)

  • Kim, Mi-Jin;Kim, Yeong-Sil
    • Journal of Korea Game Society
    • /
    • v.12 no.3
    • /
    • pp.3-10
    • /
    • 2012
  • Social network game induces to continue participation among the players through asynchronous connection mode. This characteristic of SNG that is required active social connectedness and that is the main purpose of SNG. The player's behavior attributes related with social connectedness can be divided by the environmental conception. In this paper, the player's behavior is divided into two types : Social Connectedness(SC) and Non-Social Connectedness(NC). Each type is categorized in specific actions of players that is explored. Also, experimental data collected from player's playing-game is analyzed in the comparison of each behavior and the relation of playfulness. Those results have suggested the scope for designing a appliable model on SNG development and represented the guideline to verify speedy the massive player's behavior through simplifying the player's behavior derived in SNG play experiences.

Game Theory for Transmission Power Control of Cognitive Radio (CR의 송신 전력 제어를 위한 게임 이론 연구)

  • Hwang, In-Kwan;Lee, Ryoung-Kyoung;Cho, Hae-Keun;Lim, Yeon-Jun;Ko, Eun-Kyoung;Song, Myoung-Sun
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.18 no.4 s.119
    • /
    • pp.448-454
    • /
    • 2007
  • In this paper, the game theory based power control for CDMA system is studied, which has attained intensive interest as a core artificial intelligent technology fur cognitive Radio and its efficiency is evaluated using performance metrics such as system throughput and fairness. Utility Function for joint user centric and network centric power control is defined and simulation results show that game theory based power control is far better than closed loop power control. The contribution of this raper is to formalize the game theory based power control toward the cognitive radio that recognizes and adapts to the radio communication environments.

Automatic Map Generation without an Isolated Cave Using Cell Automata Enhanced by Binary Space Partitioning (이진 공간 분할로 보강된 셀 오토마타를 이용한 고립 동굴 없는 맵 자동 생성)

  • Kim, Ji-Min;Oh, Pyeong;Kim, Sun-Jeong;Hong, Seokmin
    • Journal of Korea Game Society
    • /
    • v.16 no.6
    • /
    • pp.59-68
    • /
    • 2016
  • Many researchers have paid attention to contents generation within the area of game artificial intelligence these days with various reasons. Efforts on automatic contents generation without game level designers' help were continuously progressed in various game contents. This study suggests an automatic map generation without an isolated cave using cellular automation enhanced by binary space partitioning(BSP). In other words, BSP makes it possible to specify the number of desired area and cellular automation reduces the time to search a path. Based upon our preliminary simulation results, we show the usefulness of our automatic map generation by applying the contents generation using cell automation, which is enhanced by BSP to games.

An Implementation of IEEE 1516.1-2000 Standard with the Hybrid Data Communication Method (하이브리드 데이터 통신 방식을 적용한 IEEE 1516.1-2000 표준의 구현)

  • Shim, Jun-Yong;Wi, Soung-Hyouk
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.37C no.11
    • /
    • pp.1094-1103
    • /
    • 2012
  • Recently, software industry regarding national defense increases system development of distributed simulation system of M&S based to overcome limit of resource and expense. It is one of key technologies for offering of mutual validation among objects and reuse of objects which are discussed for developing these systems. RTI, implementation of HLA interface specification as software providing these technologies uses Federation Object Model for exchanging information with joined federates in the federation and each federate has a characteristic that is supposed to have identical FOM in the federation. This technology is a software which is to provide the core technology which was suggested by the United state's military M&S standard framework. Simulator, virtual simulation, and inter-connection between military weapons system S/W which executes on network which is M&S's core base technology, and it is a technology which also can be used for various inter-connection between S/W such as game and on-line phone. These days although RTI is used in military war game or tactical training unit field, there is none in Korea. Also, it is used in mobile-game, distribution game, net management, robot field, and other civilian field, but the number of examples are so small and informalized. Through this developing project, we developed the core technique and RTI software and provided performance of COTS level to improve communication algorithms.

Fast algorithm for incorporating start and goal points into the map represented in a generalized visibility graph (출발점과 목표점을 일반화 가시성그래프로 표현된 맵에 포함하기 위한 빠른 알고리즘)

  • Yu, Kyeon-Ah;Jeon, Hyun-Joo
    • Journal of the Korea Society for Simulation
    • /
    • v.15 no.2
    • /
    • pp.31-39
    • /
    • 2006
  • The visibility graph is a well-known method for efficient path-finding with the minimum search space modelling the game world. The generalized visibility graph is constructed on the expanded obstacle boundaries to eliminate the "wall-hugging" problem which is a major disadvantage of using the visibility graph. The paths generated by the generalized visibility graph are guaranteed to be near optimal and natural-looking. In this paper we propose the method to apply the generalized visibility graph efficiently for game characters who moves among static obstacles between varying start and goal points. Even though the space is minimal once the generalized visibility graph is constructed, the construction itself is time-consuming in checking the intersection between every two links connecting nodes. The idea is that we build the map for static obstacles first and then incorporate start and goal nodes quickly. The incorporation of start and goal nodes is the part that must be executed repeatedly. Therefore we propose to use the rotational plane-sweep algorithm in the computational geometry for incorporating start and goal nodes efficiently. The simulation result shows that the execution time has been improved by 39%-68% according to running times in the game environment with multiple static obstacles.

  • PDF