REAL-TIME SEARCH METHOD IN NONDETERMINISTIC GAME - MS. PAC-MAN

被引:3
|
作者
Gan, Xiaocong [1 ]
Bao, Yun
Han, Zhangang [1 ]
机构
[1] Beijing Normal Univ, Dept Syst Sci, Beijing 100875, Peoples R China
基金
中国国家自然科学基金;
关键词
D O I
10.3233/ICG-2011-34404
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
A search-based method is proposed to control the real-time and nondeterministic game Ms. Pac-Man automatically. First, a detailed survey is given, including (1) some details of the game, (2) a literature review of more than 20 works from the competition organized by Simon M. Lucas and (3) some other papers. Then we propose an image recognition method for the game that can recognize partially occluded objects effectively by using corner pixels. Based on the recognition results, we use the game-tree search algorithm to make the decisions. Heuristic rules are carefully designed to ensure that the search tree can be expanded sufficiently deep within a limited time. A vector is evaluated for each node in the tree. This vector facilitates the implementation of hand-coded rules. We achieve an average score of 67,602 and a high score of 106,980, both remarkably higher than previous works.
引用
收藏
页码:209 / 222
页数:14
相关论文
共 50 条
  • [31] Reinforcement Learning to Train Ms. Pac-Man Using Higher-order Action-relative Inputs
    Bom, Luuk
    Henken, Ruud
    Wiering, Marco
    PROCEEDINGS OF THE 2013 IEEE SYMPOSIUM ON ADAPTIVE DYNAMIC PROGRAMMING AND REINFORCEMENT LEARNING (ADPRL), 2013, : 156 - 163
  • [32] Fast Approximate Max-n Monte Carlo Tree Search for Ms Pac-Man
    Samothrakis, Spyridon
    Robles, David
    Lucas, Simon
    IEEE TRANSACTIONS ON COMPUTATIONAL INTELLIGENCE AND AI IN GAMES, 2011, 3 (02) : 142 - 154
  • [33] Learning to play using low-complexity rule-based policies: Illustrations through Ms. Pac-Man
    Szita, István
    Lorincz, András
    Journal of Artificial Intelligence Research, 1600, 30 : 659 - 684
  • [34] Learning to play using low-complexity rule-based policies:: Illustrations through Ms. Pac-Man
    Szita, Istvan
    Lorincz, Andras
    JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH, 2007, 30 : 659 - 684
  • [35] Discovering Agent Behaviors Through Code Reuse: Examples From Half-Field Offense and Ms. Pac-Man
    Kelly, Stephen
    Heywood, Malcolm I.
    IEEE TRANSACTIONS ON GAMES, 2018, 10 (02) : 195 - 208
  • [36] Pac-man game using hand movement without keyboard and mouse
    Department of Computer Information Engineering, Kunsan National University, Kunsan, Korea, Republic of
    Int. J. Control Autom., 3 (297-304):
  • [37] MS PAC-MAN VERSUS GHOST TEAM CEC 2011 Competition
    Rohlfshagen, Philipp
    Lucas, Simon M.
    2011 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2011, : 70 - 77
  • [38] Comparing the Performance of the Evolvable πGrammatical Evolution Genotype-Phenotype Map to Grammatical Evolution in the Dynamic Ms. Pac-Man Environment
    Galvan-Lopez, Edgar
    Fagan, David
    Murphy, Eoin
    Swafford, John Mark
    Agapitos, Alexandros
    O'Neill, Michael
    Brabazon, Anthony
    2010 IEEE CONGRESS ON EVOLUTIONARY COMPUTATION (CEC), 2010,
  • [39] Dynamic Difficulty Adjustment based on an improved algorithm of UCT for the Pac-Man Game
    Wu, Bin
    Chen, DingDing
    He, Suoju
    Sun, Qijin
    Li, Zhengjun
    Zhao, Minxi
    2011 INTERNATIONAL CONFERENCE ON ELECTRONICS, COMMUNICATIONS AND CONTROL (ICECC), 2011, : 4255 - 4259
  • [40] Using a Training Camp with Genetic Programming to Evolve Ms Pac-Man Agents
    Alhejali, Atif M.
    Lucas, Simon M.
    2011 IEEE CONFERENCE ON COMPUTATIONAL INTELLIGENCE AND GAMES (CIG), 2011, : 118 - 125