• Title/Summary/Keyword: game optimization

Search Result 136, Processing Time 0.029 seconds

Multi-objective Routing Scheme for Wireless Sensor Networks (무선 센서 네트워크상에서 다목적 라우팅 기법)

  • Kim, Min-Woo;Kim, Sung-Wook
    • Journal of KIISE:Information Networking
    • /
    • v.37 no.6
    • /
    • pp.453-458
    • /
    • 2010
  • In the paper, we propose an energy efficient sensor network management scheme. In the proposed scheme, the modified game theory and ${\varepsilon}$-constraint techniques are sophisticatedly combined to establish energy efficient routing paths. Simulation results indicate that the proposed scheme can strike an appropriate performance balance between conflicting requirements while other existing schemes cannot offer such an attractive performance.

Solving Mixed Strategy Nash-Cournot Equilibria under Generation and Transmission Constraints in Electricity Market

  • Lee, Kwang-Ho
    • Journal of Electrical Engineering and Technology
    • /
    • v.8 no.4
    • /
    • pp.675-685
    • /
    • 2013
  • Generation capacities and transmission line constraints in a competitive electricity market make it troublesome to compute Nash Equilibrium (NE) for analyzing participants' strategic generation quantities. The NE can cause a mixed strategy NE rather than a pure strategy NE resulting in a more complicated computation of NE, especially in a multiplayer game. A two-level hierarchical optimization problem is used to model competition among multiple participants. There are difficulties in using a mathematical programming approach to solve a mixed strategy NE. This paper presents heuristics applied to the mathematical programming method for dealing with the constraints on generation capacities and transmission line flows. A new formulation based on the heuristics is provided with a set of linear and nonlinear equations, and an algorithm is suggested for using the heuristics and the newly-formulated equations.

Design and Implementation of NUI-based Athletic Scene Generation System

  • Choi, Jong-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.24 no.1
    • /
    • pp.115-120
    • /
    • 2019
  • In this paper, we propose a system and an intuitive interface that can create an athletic scene among athletes. We allow you to enter motion as if you were playing a game, so that the user's action becomes the player's action. The user can take various actions in front of the motion sensor and control the object flying to him. When a user specifies an opponent to pass or attack, and takes appropriate action in front of the motion sensor, the movement trajectory of the object is automatically generated by the physical optimization technique in accordance with the motion. In this way, you can create scenes where multiple players play together in a virtual environment. The method of this paper will be very useful for rapid prototyping for cinematic trailers of based on athletics games or animations.

INFINITELY MANY SOLUTIONS FOR (p(x), q(x))-LAPLACIAN-LIKE SYSTEMS

  • Heidari, Samira;Razani, Abdolrahman
    • Communications of the Korean Mathematical Society
    • /
    • v.36 no.1
    • /
    • pp.51-62
    • /
    • 2021
  • Variational method has played an important role in solving problems of uniqueness and existence of the nonlinear works as well as analysis. It will also be extremely useful for researchers in all branches of natural sciences and engineers working with non-linear equations economy, optimization, game theory and medicine. Recently, the existence of infinitely many weak solutions for some non-local problems of Kirchhoff type with Dirichlet boundary condition are studied [14]. Here, a suitable method is presented to treat the elliptic partial derivative equations, especially (p(x), q(x))-Laplacian-like systems. This kind of equations are used in the study of fluid flow, diffusive transport akin to diffusion, rheology, probability, electrical networks, etc. Here, the existence of infinitely many weak solutions for some boundary value problems involving the (p(x), q(x))-Laplacian-like operators is proved. The method is based on variational methods and critical point theory.

Research on Construction Strategy of Agricultural Digital Twins (농업 디지털 트윈 구축 전략에 대한 연구)

  • Han jae Keem;Jun young Do;Yong-Hwan Lee
    • Journal of the Semiconductor & Display Technology
    • /
    • v.23 no.1
    • /
    • pp.79-83
    • /
    • 2024
  • Digital Twin technology is rapidly transforming various industries by providing comprehensive virtual models that replicate physical objects or processes. In the context of agriculture, digital twin can be a game-changer. This technology can help in creating precise simulations of farming scenarios, thereby enabling farmers to make data-driven decisions and optimize farm operations. The potential benefits include improved crop yields, resource efficiency, and environmental sustainability. However, the implementation of digital twin technology in agriculture poses challenges, such as data management issues and the need for robust IoT infrastructure. Despite these hurdles, the future of digital twin in agriculture looks promising, with ongoing research and developments aimed at overcoming these obstacles.

  • PDF

A Practical Method for Efficient Extraction of the Rotational Part of Dynamic Deformation (동적 변형의 회전 성분을 효율적으로 추출하기 위한 실용적 방법)

  • Choi, Min Gyu
    • Journal of Korea Game Society
    • /
    • v.18 no.1
    • /
    • pp.125-134
    • /
    • 2018
  • This paper presents a practical method to efficiently extract the rotational part of a $3{\times}3$ matrix that changes continuously in time. This is the key technique in the corotational FEM and the shape matching deformation popular in physics-based dynamic deformation. Recently, in contrast to the traditional polar decomposition methods independent of time, an iterative method was proposed that formulates the rotation extraction in a physics-based way and exploits an incremental representation of rotation. We develop an optimization method that reduces the number of iterations under the assumption that the maximum magnitude of the incremental rotation vector is limited within ${\pi}/2$. Realistic simulation of dynamic deformation employs a sufficiently small time step, and thus this assumption is not problematic in practice. We demonstrate the efficiency and practicality of our method in various experiments.

A Novel Cell Selection Technique Based on Game Theory for Femtocell System Resource Optimization (펨토셀시스템 자원 최적화를 위한 게임이론 기반 기지국 선택 기법)

  • Jang, Jeong-Gyu;Sohn, Insoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.11
    • /
    • pp.652-659
    • /
    • 2014
  • In this paper, we propose an access point selection method for mobile users in LTE-femtocell system. In wireless communication system, users want to receive good data service. In LTE-femtocell system, if users move a little, users can experience different data service. The proposed access point selection method help that if users move a little, users obtain the high capacity and that user selects access point that other user have not selected much and so obtains higher data service. We simulated in order to prove performance of the proposed access point selection metod. Simulation results show that in a situation that users are concentrated in order to obtain better data service users are seen scattered look. As a result, we confirm that the proposed access point selection method provides good data service to users.

Coalition based Optimization of Resource Allocation with Malicious User Detection in Cognitive Radio Networks

  • Huang, Xiaoge;Chen, Liping;Chen, Qianbin;Shen, Bin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.10
    • /
    • pp.4661-4680
    • /
    • 2016
  • Cognitive radio (CR) technology is an effective solution to the spectrum scarcity issue. Collaborative spectrum sensing is known as a promising technique to improve the performance of spectrum sensing in cognitive radio networks (CRNs). However, collaborative spectrum sensing is vulnerable to spectrum data falsification (SSDF) attack, where malicious users (MUs) may send false sensing data to mislead other secondary users (SUs) to make an incorrect decision about primary user (PUs) activity, which is one of the key adversaries to the performance of CRNs. In this paper, we propose a coalition based malicious users detection (CMD) algorithm to detect the malicious user in CRNs. The proposed CMD algorithm can efficiently detect MUs base on the Geary'C theory and be modeled as a coalition formation game. Specifically, SSDF attack is one of the key issues to affect the resource allocation process. Focusing on the security issues, in this paper, we analyze the power allocation problem with MUs, and propose MUs detection based power allocation (MPA) algorithm. The MPA algorithm is divided into two steps: the MUs detection step and the optimal power allocation step. Firstly, in the MUs detection step, by the CMD algorithm we can obtain the MUs detection probability and the energy consumption of MUs detection. Secondly, in the optimal power allocation step, we use the Lagrange dual decomposition method to obtain the optimal transmission power of each SU and achieve the maximum utility of the whole CRN. Numerical simulation results show that the proposed CMD and MPA scheme can achieve a considerable performance improvement in MUs detection and power allocation.

I CAN stand this, but WE CAN'T: discontinuity between choices for self vs. group modulated by group competition during the ultimatum game (최후통첩 게임에서의 개인의사결정 vs. 그룹의사결정: 그룹 간 경쟁의 의한 조절효과)

  • Kim, Hye-young;Kim, Hackjin;Han, Sanghoon
    • Korean Journal of Cognitive Science
    • /
    • v.27 no.3
    • /
    • pp.407-420
    • /
    • 2016
  • We live under the consequences of countless decisions, among which significant number of decisions is made by representatives acting on behalf of us. However, individuals often make disparate decisions depending on which identity they are assigned as an agent or with which opponent they are interplaying. In the current research, behavioral discontinuity depending upon actor identity and social relationship was investigated using the ultimatum game. Participants behaved in a more economically rational way when they acted as a group representative compared with when they made decisions as a private individual. However, the direction of the individual-representative discontinuity was reversed when rivalry came into play. Furthermore, more fairness was requested to accept the offers in the interaction with the rival compared with the neutral countergroup. Especially when interacting with the rival group, participants showed contrasting level of decision bias - measured by rejection rate toward unfair offers - according to the degree of mind attribution to the opponent. Specifically, the greater participants attributed a mind to the rival group, the more they rejected the unfair offers from it. The present research is important in that it provides insight into individuals' decision-making in a group context, which sometimes forgoes the financial gain of the entire group and ultimately leads to the sub-optimization of social welfare.

Folding Analysis of Paper Structure and Estimation of Optimal Collision Conditions for Reversal (종이구조물의 접기해석과 반전을 위한 최적충돌조건의 산정)

  • Gye-Hee Lee
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.36 no.4
    • /
    • pp.213-220
    • /
    • 2023
  • This paper presents a model simulating the folding process and collision dynamics of "ddakji", a traditional Korean game played using paper tiles (which are also referred to as ddakji). The model uses two A4 sheets as the base materials for ddakji. The folding process involves a series of boundary conditions that transform the wing part of the paper structure into a twisted configuration. A rigid plate boundary condition is also adopted for squeezing, establishing the shape and stress state of the game-ready ddakji through dynamic relaxation analysis. The gaming process analysis involves a forced displacement of the striking ddakji to a predetermined collision position. Collision analysis then follows at a given speed, with the objective of overturning the struck ddakji--a winning condition. A genetic algorithm-based optimization analysis identifies the optimal collision conditions that result in the overturning of the struck ddakji. For efficiency, the collision analysis is divided into two stages, with the second stage carried out only if the first stage predicts a possible overturn. The fitness function for the genetic algorithm during the first stage is the direction cosine of the struck ddakji, whereas in the second stage, it is the inverse of the speed, thus targeting the lowest overall collision speed. Consequently, this analysis provides optimal collision conditions for various compression thicknesses.