Game Path Finding Algorithm Based on the Optimal Path Storage
CSTR:
Author:
  • Article
  • | |
  • Metrics
  • |
  • Reference [5]
  • |
  • Related
  • | | |
  • Comments
    Abstract:

    Researching some path finding algorithms used in the game, as well as some of the features of game path finding, and giving the routing algorithm based on the optimal path storage. Storing part of the optimal path through the optimal matrix to reduce the large number of repeated path computation, and improve the efficiency of path computation in the game. For the role movement in game scenes changing the state of path points to pass lead to the optimal path of the optimal path matrix invalid. Path update algorithm is given to update the optimal path of the optimal path matrix. As map path points become larger and larger, map paths are divided; then paths are stored for each sub-block using the optimal path matrix.

    Reference
    1 孙成江,刘林.应急救援模拟演练系统设计与实现初探.石油工业计算机应用,2010,67(3):3-6.
    2 廖宁,马鸣辉.模拟演练系统综述.理论探索,2010,23(5):1-2.
    3 陈和平,张前哨.A* 算法在游戏地图寻径中的应用与实现. 计算机应用与软件,2005,22(12):118-120.
    4 徐孝凯.数据结构实用教程.第2版.北京:清华大学出版社, 2006.
    5 Bryan S. The Basics of A* for Path Planning. Game Programming Gem. Charles River Media, 2005,254-263.
    Related
    Cited by
Get Citation

宋广涛,马跃,廉东本,孙咏.基于最优路径存储的游戏寻径算法.计算机系统应用,2013,22(2):96-99

Copy
Share
Article Metrics
  • Abstract:1410
  • PDF: 3100
  • HTML: 0
  • Cited by: 0
History
  • Received:July 06,2012
  • Revised:September 10,2012
Article QR Code
You are the first990480Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063