摘要
为了更合理地判定何时放弃分层寻路,提出了一种新的域值放弃策略当起止点之间的估计距离小于放弃域值时,采用最短路径算法;反之,则采用分层寻路算法。该策略引入了估计距离、放弃域值和放弃因子三个参量,并采用统计法以确定域值。测试数据表明,使用该策略搜索出的路径具有较高的可采纳性。
In order to determine when to give up hierarchical route-finding algorithm, we put forward a kind of threshold abandoning strategy. When the estimated distance between original point and destination is shorter than the abandoning threshold, shortest route algorithm will be adopted, otherwise hierarchical route-finding algorithm will be adopted. Three parameters named estimate distance, abandoning threshold and abandoning factor were introduced to describe the new strategy, and abandoning threshold will be worked out by means of statistics. Experiments show that this new strategy can make more mutes adopted by drivers.
出处
《计算机应用》
CSCD
北大核心
2007年第2期473-474,478,共3页
journal of Computer Applications
基金
国家自然科学基金资助项目(40471102)
陕西师范大学研究生培养创新基金资助项目(2006CXS011)
关键词
分层寻路
分层路径
平面路径
域值
放弃策略
hierarchical route-flnding
hierarchical mute
flat mute
threshold
abandoning strategy
