Computer Engineering and Applications ›› 2009, Vol. 45 ›› Issue (23): 38-39.DOI: 10.3778/j.issn.1002-8331.2009.23.011

• 研究、探讨 • Previous Articles     Next Articles

Pathfinding improved algorithm in game

DONG Gai-fang1,XU Dao-yun2   

  1. 1.College of Computer and Information Engineering,Inner Mongolia Agricultural University,Hohhot 010018,China
    2.College of Computer Science & Technology,Guizhou University,Guiyang 550025,China
  • Received:2008-10-10 Revised:2008-11-21 Online:2009-08-11 Published:2009-08-11
  • Contact: DONG Gai-fang

游戏中寻找路径的改进算法

董改芳1,许道云2   

  1. 1.内蒙古农业大学 计算机与信息工程学院,呼和浩特 010018
    2.贵州大学 计算机科学与技术学院,贵阳 550025

  • 通讯作者: 董改芳

Abstract: By analyzing A*algorithm,desigh and implement improved A*algorithm which represented by indexed array and binary heap.Comparing with the algorithm represented by indexed array the algorithm can save 11% searching time.

Key words: pathfinding algorithm, A* algorithm, artificial inteligence, indexed arrays, binary heaps

摘要: 通过分析A*算法,设计并实现用索引数组和二叉堆表示开放列表的A*改进算法。该算法与用索引数组表示的开放列表相比,可以节省约11%的运行时间。

关键词: 寻径算法, A*算法, 人工智, 索引数组, 二叉堆

CLC Number: