基于DAF算法的地图寻径研究  

Research on Map Path-finding Based on DAF Algorithm

作　　者：陈娜[1] 黄明和[1] 刘清华[1] 

机构地区：[1]江西师范大学软件学院,南昌330022

出　　处：《科学技术与工程》2010年第30期7536-7540,共5页Science Technology and Engineering

摘　　要：融合了Delaunay Triangulation算法,A*算法以及Funnel算法的优点,提出了DAF算法,并将其应用于网络游戏的地图寻径中,解决了地图信息获取不便捷和搜索路径比较曲折的问题,得出一条最优路径。计算机仿真结果表明DAF算法提高了搜索效率和路径的平滑程度。The advantage of Delaunay Triangulation algorithm,A algorithm and the Funnel algorithm are combined,a DAF algorithm is proposed which is,and applied to path-finding on the network game map.DAF algorithm solved problems of inconvenience in obtaining map information and the search path being relatively winding,thus drawed an optimal path.Simulation results show that DAF algorithm improves the search efficiency and smoothness of the path.

关 键 词：地图寻径 DELAUNAY Triangulation算法 A~*算法 Funnel算法 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]