• DocumentCode
    1633327
  • Title

    Researching on AI path-finding algorithm in the game development

  • Author

    He, Xiangguang ; Wang, Yaya ; Cao, Yanyan

  • Author_Institution
    Dept. of Inf. Eng., Binzhou Polytech., Binzhou, China
  • Volume
    2
  • fYear
    2012
  • Firstpage
    484
  • Lastpage
    486
  • Abstract
    Path-finding is a basic topic which AI in real-time game. This paper for the characteristics of path-finding in the games and based on analysis and research the classical AI path-finding algorithm introduces a research on two-tiered algorithm based on Uniform block which to improve quality that searching shortest path in two points. At last, the experimental results illustrate the effectiveness of the proposed algorithm.
  • Keywords
    artificial intelligence; game theory; graph theory; search problems; AI path finding algorithm; game development; shortest path searching algorithm; two-tiered algorithm; Abstracts; Algorithm design and analysis; Artificial intelligence; Clustering algorithms; Electronic mail; Games; Heuristic algorithms; A∗ algorithm; Artificial intelligence; Path-finding; Uniform block; two-tiered path-finding algorithm;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Instrumentation & Measurement, Sensor Network and Automation (IMSNA), 2012 International Symposium on
  • Conference_Location
    Sanya
  • Print_ISBN
    978-1-4673-2465-6
  • Type

    conf

  • DOI
    10.1109/MSNA.2012.6324627
  • Filename
    6324627