• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권7호
• /
• pp.2454-2467
• /
• 2015

Increasing traffic and bandwidth requirements bring challenges to the next generation wireless networks (5G). As one of the main technology in 5G networks, Ultra-Dense Network (UDN) can be used to improve network coverage. In this paper, a radio over fiber based model is proposed to solve the load balancing problem in ultra-dense network. Stochastic differential game is introduced for the load balancing algorithm, and optimal load allocated to each access point (RAP) are formulated as Nash Equilibrium. It is proved that the optimal load can be achieved and the stochastic differential game based scheme is applicable and acceptable. Numerical results are given to prove the effectiveness of the optimal algorithm.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.946-948
• /
• 1996

In this paper, we consider a 2-dimensional pursuit-evasion game between a maneuvering target and a coasting missile using qualitative game theory. The optimal evasion algorithm of the target and the optimal guidance algorithm of the missile are determined and the barrier trajectories of this game are obtained through computer simulation. The optimal strategy of the missile and target is to turn toward the final line of sight direction using maximum input and maintain its direction. The capture set of the missile can be obtained by backward integration from the BUP.

• 대한산업공학회지
• /
• 제12권1호
• /
• pp.95-105
• /
• 1986

This paper presents an adaptive algorithm to generate a near-optimal closed-loop solution for a non-zero sum differential game by periodically updating the solutions of the two-point boundary-value problem. Applications to competitive advertising problem show that the adaptive algorithm can be used as an efficient tool to solve the differential game problem in which one player may take advantage of the other's non-optimal play.

• 산업경영시스템학회지
• /
• 제24권65호
• /
• pp.11-22
• /
• 2001

Recently, many studies on the supply chain management have been published due to increasing attention placed on the design and performance analysis of the supply chain as a whole. Using the Beer distribution game introduced in Sterman[1995], we develop a simple order-up-to-R inventory model to minimize sum of the inventory holding cost and shortage cost under probabilistic demand. We show that performance of the model is robust through extensive simulation experiment. Applying the model to serially connected supply chain, we observe that, if the unit shortage cost is relatively high, R value computed independently is an optimal solution.

• 한국게임학회 논문지
• /
• 제17권3호
• /
• pp.107-116
• /
• 2017

샌드박스 게임은 높은 자유도를 기반으로 사용자 스스로 다양한 플레이패턴을 재창조하며 만족을 배가시킨다. 이러한 창조적 과정은 '커스터마이징'과 '행동자율성'을 통한 놀이의 확장성에 기인한다. 이는 즐거움을 느끼는 요소가 과정지향적이라는 말로 대변될 수 있다. 본고는 샌드박스형 게임이 다중경쟁 환경에서 가지는 구조적한계를 규명하고자 한다. 스텐드어론 기반에서는 다양한 커스터마이징을 통한 자유도의 확장성이 유저에게 월드지속성에 강한 동기를 부여한다. 반면 MMORPG와 같은 온라인 샌드박스 게임물에서는 다수유저의 경쟁 우위를 점하고자하는 목적지향적 성향이 샌드 박스형 게임 본연의 자유도와 확장성을 구사할 수 없는 태생적 한계임을 확인하였다. 본 연구에서는 온라인 기반의 샌드박스형 게임의 자유도와 확장성의 효용이 상쇄되는 원인과 성장한계를 옵티멀솔루션 요소에 기인함을 제시할 수 있었다.

• Journal of Mechanical Science and Technology
• /
• 제16권6호
• /
• pp.770-775
• /
• 2002

In this paper, a game optimal receding horizon guidance law (GRHG) is proposed, which does not use information of the time-to-go and target maneuvers. It is shown that by adjusting design parameters appropriately, the proposed GRHG is identical to the existing receding horizon guidance law (RHG), which can intercept the target by keeping the relative vertical separation less than the given value, within which the warhead of the missile is detonated, after the appropriately selected time in the presence of arbitrary target maneuvers and initial relative vertical separation rates between the target and missile. Through a simulation study, the performance of the GRHG is illustrated and compared with that of the existing optimal guidance law (OGL).

• 한국지능시스템학회논문지
• /
• 제17권7호
• /
• pp.869-874
• /
• 2007

다목적 함수의 최적화 문제(Multiobjective optimization problems)의 경우에는 하나의 최적해가 존재하는 것이 아니라 '파레토 최적해 집합(Pareto optimal set)'이라고 알려진 해들의 집합이 존재한다. 이러한 이상적 파레토 최적해 집합과 가까운 최적해를 찾기 위한 다양한 해탐색 능력은 진화 알고리즘의 성능을 결정한다. 본 논문에서는 게임 모델에 기반한 공진화 알고리즘(GCEA: Game model based Co-Evolutionary Algorithm)에서 해집단의 다양성을 유지하여, 다양한 비지배적 파레토 대안해(non-dominated alternatives)들을 찾기 위한 방법을 제안한다.

• 한국멀티미디어학회논문지
• /
• 제14권12호
• /
• pp.1549-1558
• /
• 2011

In this paper, we address the problem of bandwidth sharing among multiple primary users and multiple secondary users in a cognitive radio network. In cognitive radio networks, effective spectrum assignment for primary and secondary users is a challenge due to the available broad range of radio frequency spectrum as well as the requisition of harmonious coexistence of both users. To handle this problem, firstly, Bertrand game model is used to analyze a spectrum pricing in which multiple primary users emulate with each other to acquire maximal profit. After that, we employ Cournot game to model the spectrum sharing of secondary users to obtain optimal profit for each user also. Simulation results show that our scheme obtains optimal solution at Nash equilibrium.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2003년도 ISIS 2003
• /
• pp.690-693
• /
• 2003

The purpose of two player game is that a player beats an enemy. In order to win to various enemies, a learning of various strategies is indispensable. However, the optimal action to overcome the enemies will change when the game done over and again because the enemy's actions also change dynamically. Sol it is din-cult that the player aquires the optimal action and that the specific player keeps winning to various enemies. Species who have a competition relation and affect other's existence is called a coevolution. Coevolution has recently attracred considerable interest in the community of Artificial Life and Evolutionary Computation(1). In this paper, we apply Classifier System for agent team to two player game. A reward and a penalty are given to the used rules when the agent achieve specific action in the game and each team's rulebase are evaluated based on the ranking in the league. We show that all teams can acquire the optimal actions by coevolution.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2014년도 춘계학술대회
• /
• pp.531-532
• /
• 2014

현재 인터렉티브 건 라이드 기반의 슈팅 게임에서 사용되고 있는 조준점은 가시성이 낮다. 본 연구는 기존 체감형 아케이드 게임의 문제점을 극복하기 위해 FPS게임에서 사용되고 있는 조준점을 본 인터렉티브 건 라이드 슈팅게임에 적용해 가시성을 개선 하고자 한다. 본 연구는 20대 대학생들을 대상으로 가시성의 효율이 높아졌는지를 실험을 통해 규명하고자 하며 본 연구에서 도출한 결과를 통해 최적화된 조준점의 기준을 찾아보고, 라이드 기반 슈팅게임에서 이를 적용하여 실제 상용화 되는 게임에서 사용 가능한지 적합성 여부를 판단해 보고자 한다.