• DocumentCode
    2872589
  • Title

    A* Algorithm Analysis and Optimization: In Network Game Design

  • Author

    Xiaoli Guo ; Ping Guo

  • Author_Institution
    Inf. Eng. Coll., Northeast Dianli Univ. Jilin City, Jilin, China
  • fYear
    2009
  • fDate
    11-13 Dec. 2009
  • Firstpage
    1
  • Lastpage
    4
  • Abstract
    In this paper, we first describe the basic principle and the method of the A* algorithm. And we analyze the reason that the A* algorithm influences speed when it is searching for the optimum route in network game map. Then we give the optimization scheme from the aspects of node data structure to the maintenance of the open queue. At the same time, the optimization scheme is evaluated and tested by a number of different game maps. Finally, through experiment, we can have the conclusion that the improvable A* algorithm is practical and feasible. And the A* algorithm can increase the speed of playing the game and can been implemented in the specific network game.
  • Keywords
    data structures; game theory; optimisation; search problems; A* algorithm analysis; data structure; network game design; optimization; Algorithm design and analysis; Cities and towns; Costs; Data structures; Design engineering; Design optimization; Educational institutions; Information analysis; Switches; Testing;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
  • Conference_Location
    Wuhan
  • Print_ISBN
    978-1-4244-4507-3
  • Electronic_ISBN
    978-1-4244-4507-3
  • Type

    conf

  • DOI
    10.1109/CISE.2009.5366757
  • Filename
    5366757