• Title/Summary/Keyword: artificial intelligence game

Search Result 147, Processing Time 0.029 seconds

Analysis of Overseas Research Trends Related to Artificial Intelligence (AI) in Elementary, Middle and High School Education (초·중·고 교육분야의 인공지능(AI) 관련 해외 연구동향 분석)

  • Jung, Young-Joo;Kim, Hea-Jin
    • Journal of Korean Library and Information Science Society
    • /
    • v.52 no.3
    • /
    • pp.313-334
    • /
    • 2021
  • This study aimed to analyze AI research trends related to elementary, middle, and high school education. To this end, the related literature was collected from the SCOPUS database and the publication period of the collected literature was from 1974 to March 2021, with 154 journal papers and 571 conference papers. Research trends were analyzed based on the co-occurrences analysis technique of 4,521 words of author keyword and index keyword included in these papers. As a result of the analysis, big data, data mining, data science and deep learning were found as the latest research trends with machine learning and there was a difference between elementary, middle and high school education. It can be seen that elementary school had a lot of robot-related research, middle school had a lot of game and data-related research, and high school had various and in-depth research. In discussion, we mapped the top 50 words common to elementary, middle, and high schools with the 'Artificial Intelligence Basics' curriculum of Korean Government and '5 Big Ideas' of the United States Government so that AI research can be viewed at a glance.

Collection of Philosophical Concepts for Video Games -Theory of Art in the Age of Artificial Intelligence by Shinji Matsunaga's The Aesthetics of Video Games (인간과 컴퓨터가 공유하는 인공적인 놀이에 관한 개념상자 -마쓰나가 신지의 『비디오 게임의 미학』이 체계화하는 인공지능시대의 예술과 유희 이론)

  • Kim, Il-Lim
    • Journal of Popular Narrative
    • /
    • v.26 no.4
    • /
    • pp.215-237
    • /
    • 2020
  • This paper is written to introduce and review Shinji Matsunaga's The Aesthetics of Video Games which published in Japan in 2018. Shinji Matsunaga has studied video games from a philosophical and aesthetic perspective. In The Aesthetics of Video Games, he took video games as a hybrid form of traditional games. Shinji Matsunaga particularly notes that video games can design human behaviors and experiences. From this point of view, he tries to construct a theoretical framework that will be able to describe the ways of signification in games and fiction respectively. In previous studies, video games have been mainly discussed in the context of cultural studies and entertainment culture in Japan. The Aesthetics of Video Games is distinguished from the previous studies in the following points. First, The Aesthetics of Video Games pioneered the method of studying video games in art theory. Second, it established various types of relationships with video games and traditional aesthetic concepts. Third, this book connects new concepts that emerged in the age of artificial intelligence to video games as an aesthetic action. Through this work, not only video games were discussed academically, but also the fields of aesthetics and art were expanded. The Aesthetics of Video Game is like a collection of philosophical concepts for video games. Through this book, it can be said that the path for artificial intelligence to approach human secrets is closer than before.

Dynamic Programming Algorithm Path-finding for Applying Game (게임 적용을 위한 Dynamic Programming 알고리즘 길찾기)

  • Lee, Se-Il
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.213-219
    • /
    • 2005
  • In order to move NPC's to target location at game maps, various algorithm including A* has been used. The most frequently used algorithm among them is A* with fast finding speed. But A* has the following problems. The first problem is that at randomly changing map, it is necessary to calculate all things again whenever there are any changes. And when calculation is wrong, it is not possible to search for target. The second problem is that it is difficult to move avoiding dangerous locations damaging NPC such as an obstruction. Although it is possible to avoid moving to locations with high weight by giving weight to dangerous factors. it is difficult to control in case NPC moves nearby dangerous factors. In order to solve such problems, in this thesis, the researcher applied Dynamic Programming to path-finding algorithm. As the result of its application, the researcher could confirm that the programming was suitable for changes at the map with random change and NPC's avoided the factors being dangerous to them far away. In addition. when compared to A*, there were good results.

  • PDF

Interaction-based mobile UI design utilizing Smart Media Augmented Reality (스마트 미디어 증강현실을 활용하는 인터랙션 기반의 모바일 UI 디자인)

  • Jung, Suk-Ho;Ryu, Seuc-Ho
    • Journal of Digital Convergence
    • /
    • v.17 no.7
    • /
    • pp.311-316
    • /
    • 2019
  • The mobile game environment is rapidly expanding with AR (augmented reality) technology along with artificial intelligence. In particular, AR (Augmented Reality) technology is a field of VR (Virtual Reality), which is a technology that shows a mixture of virtual information and images in a real environment. Recently, research on mobile UI design based on the interaction based on the augmented reality technology has become important at the point when various utilization methods are suggested based on understanding of contents. There are still some issues in terms of whether the consumer can utilize it in various ways, unlike the developed supply system. In this paper, we present an example of mobile UI design based on interaction based on smart media augmented reality through previous study and literature study of smart augmented reality to solve problem UI issues based on background theory.

Game Theoretic Optimization of Investment Portfolio Considering the Performance of Information Security Countermeasure (정보보호 대책의 성능을 고려한 투자 포트폴리오의 게임 이론적 최적화)

  • Lee, Sang-Hoon;Kim, Tae-Sung
    • Journal of Intelligence and Information Systems
    • /
    • v.26 no.3
    • /
    • pp.37-50
    • /
    • 2020
  • Information security has become an important issue in the world. Various information and communication technologies, such as the Internet of Things, big data, cloud, and artificial intelligence, are developing, and the need for information security is increasing. Although the necessity of information security is expanding according to the development of information and communication technology, interest in information security investment is insufficient. In general, measuring the effect of information security investment is difficult, so appropriate investment is not being practice, and organizations are decreasing their information security investment. In addition, since the types and specification of information security measures are diverse, it is difficult to compare and evaluate the information security countermeasures objectively, and there is a lack of decision-making methods about information security investment. To develop the organization, policies and decisions related to information security are essential, and measuring the effect of information security investment is necessary. Therefore, this study proposes a method of constructing an investment portfolio for information security measures using game theory and derives an optimal defence probability. Using the two-person game model, the information security manager and the attacker are assumed to be the game players, and the information security countermeasures and information security threats are assumed as the strategy of the players, respectively. A zero-sum game that the sum of the players' payoffs is zero is assumed, and we derive a solution of a mixed strategy game in which a strategy is selected according to probability distribution among strategies. In the real world, there are various types of information security threats exist, so multiple information security measures should be considered to maintain the appropriate information security level of information systems. We assume that the defence ratio of the information security countermeasures is known, and we derive the optimal solution of the mixed strategy game using linear programming. The contributions of this study are as follows. First, we conduct analysis using real performance data of information security measures. Information security managers of organizations can use the methodology suggested in this study to make practical decisions when establishing investment portfolio for information security countermeasures. Second, the investment weight of information security countermeasures is derived. Since we derive the weight of each information security measure, not just whether or not information security measures have been invested, it is easy to construct an information security investment portfolio in a situation where investment decisions need to be made in consideration of a number of information security countermeasures. Finally, it is possible to find the optimal defence probability after constructing an investment portfolio of information security countermeasures. The information security managers of organizations can measure the specific investment effect by drawing out information security countermeasures that fit the organization's information security investment budget. Also, numerical examples are presented and computational results are analyzed. Based on the performance of various information security countermeasures: Firewall, IPS, and Antivirus, data related to information security measures are collected to construct a portfolio of information security countermeasures. The defence ratio of the information security countermeasures is created using a uniform distribution, and a coverage of performance is derived based on the report of each information security countermeasure. According to numerical examples that considered Firewall, IPS, and Antivirus as information security countermeasures, the investment weights of Firewall, IPS, and Antivirus are optimized to 60.74%, 39.26%, and 0%, respectively. The result shows that the defence probability of the organization is maximized to 83.87%. When the methodology and examples of this study are used in practice, information security managers can consider various types of information security measures, and the appropriate investment level of each measure can be reflected in the organization's budget.

Implementation of Artificial Intelligence Computer Go Program Using a Convolutional Neural Network and Monte Carlo Tree Search (Convolutional Neural Network와 Monte Carlo Tree Search를 이용한 인공지능 바둑 프로그램의 구현)

  • Ki, Cheol-min;Cho, Tai-Hoon
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2016.10a
    • /
    • pp.405-408
    • /
    • 2016
  • Games like Go, Chess, Janggi have helped to brain development of the people. These games are developed by computer program. And many algorithms have been developed to allow myself to play. The person winning chess program was developed in the 1990s. But game of go is too large number of cases. So it was considered impossible to win professional go player. However, with the use of MCTS(Monte Carlo Tree Search) and CNN(Convolutional Neural Network), the performance of the go algorithm is greatly improved. In this paper, using CNN and MCTS were proceeding development of go algorithm. Using the manual of go learning CNN look for the best position, MCTS calculates the win probability in the game to proceed with simulation. In addition, extract pattern information of go using existing manual of go, plans to improve speed and performance by using it. This method is showed a better performance than general go algorithm. Also if it is receiving sufficient computing power, it seems to be even more improved performance.

  • PDF

Prototypical Eye Shape Classification to Solve Life-and-Death Problem in Go, using Monte-Carlo Method and Point Pattern Matching (몬테카를로 방법과 점 패턴 매칭을 활용한 바둑에서의 사활문제 해결을 위한 원형 안형의 분류)

  • Lee, Byung-Doo
    • Journal of Korea Game Society
    • /
    • v.21 no.6
    • /
    • pp.31-40
    • /
    • 2021
  • Go has a history of more than 2,500 years, and the life-and-death problems in Go is a fundamental problem domain that must be solved when implementing a computer Go. We attempted to determine the numbers of prototypical eye shapes with 3, 4, 5, and 6 eyes that are directly related to the life-and-death problems, and to classify the prototypical eye shapes represented in 4-tuple forms. Experiment was conducted by Monte-Carlo method and point pattern matching. According to the experimental results, the numbers of prototypical eye shapes were 2 for 3-eye, 5 for 4-eye, 12 for 5-eye, and 35 for 6-eye shapes. Further, using a 4-tuple form, we classified prototypical eye shapes into 1 for 3-eye, 3 for 4-eye, 4 for 5-eye, and 8 for 6-eye shapes.

Development of a Synthetic Multi-Agent System;The KMITL Cadence 2003 Robotic Soccer Simulation Team, Intelligent and AI Based Control

  • Chitipalungsri, Thunyawat;Jirawatsiwaporn, Chawit;Tangchupong, Thanapon;Kittitornkun, Surin
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • pp.879-884
    • /
    • 2004
  • This paper describes the development of a synthetic multi-agent called KMITL Cadence 2003. KMITL Cadence 2003 is a robotic soccer simulation team consisting of eleven autonomous software agents. Each agent operates in a physical soccer simulation model called Robocup Soccer Server which provides fully distributed and real-time multi-agent system environment. All teammates have to cooperate to achieve the common goal of winning the game. The simulation models many aspects of the football field such as noise in ball movements, noisy sensors, unreliable communication channel between teammates and actuators, limited physical abilities and restricted communication. This paper addresses the algorithm to develop the soccer agents to perform basic actions which are scoring, passing ball and blocking the opponents effectively. The result of this development is satisfactory because the successful scoring attempts is increased from 11.1% to 33.3%, successful passing ball attempts is increased from 22.08% to 63.64%, and also, successful intercepting attempts is increased from 88% to 97.73%.

  • PDF

LSTM Hyperparameter Optimization for an EEG-Based Efficient Emotion Classification in BCI (BCI에서 EEG 기반 효율적인 감정 분류를 위한 LSTM 하이퍼파라미터 최적화)

  • Aliyu, Ibrahim;Mahmood, Raja Majid;Lim, Chang-Gyoon
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.14 no.6
    • /
    • pp.1171-1180
    • /
    • 2019
  • Emotion is a psycho-physiological process that plays an important role in human interactions. Affective computing is centered on the development of human-aware artificial intelligence that can understand and regulate emotions. This field of study is also critical as mental diseases such as depression, autism, attention deficit hyperactivity disorder, and game addiction are associated with emotion. Despite the efforts in emotions recognition and emotion detection from nonstationary, detecting emotions from abnormal EEG signals requires sophisticated learning algorithms because they require a high level of abstraction. In this paper, we investigated LSTM hyperparameters for an optimal emotion EEG classification. Results of several experiments are hereby presented. From the results, optimal LSTM hyperparameter configuration was achieved.

Research on Artificial Intelligence Character based Physics Engine in 3D Game (3 차원 게임에서의 물리엔진에 기반한 인공지능 캐릭터에 관한 연구)

  • Choi, Jong-Hwa;Lee, Byung-Yoon;Lee, Ju-Youn;Shin, Dong-Kyoo;Shin, Dong-Il
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2005.05a
    • /
    • pp.469-472
    • /
    • 2005
  • 이 논문은 게임물리엔진에서 게임세계의 물리적인 요소를 통하여 게임에 존재하는 캐릭터들에게 인공지능을 부여하기 위한 연구에 관해서 다룬다. 게임속에서의 물리적인 상황을 자동인식하기 위해서 신경망을 이용하였다. 게임속에서의 인공지능의 적용은 게임의 속도저하를 가져오게 되는데 이 논문에서는 그러한 단점을 보완하기 위하여 물리엔진에서 캐릭터의 움직임을 계산하는 수치적분 메서드들에 대한 각 물리상황에 따른 최적의 성능을 분석하여 각각의 물리 상황마다 다른 수치 적분 메서드를 적용하는 내부 구조를 취하였다. 수치적분 메서드에 대한 각각의 성능 분석은 세가지의 물리적 상황을 구분하여 그에 기반하여 실험되었다. 인공지능 캐릭터에 대한 실험은 신경망의 토폴로지에 대한 변화와 학습 횟수에 대한 변화 및 은닉층에 대한 변화로 신경망에서의 최적의 성능에 대한 평가를 실시하였다.

  • PDF