%0 Journal Article
%T Threshold abandoning strategy in hierarchical route-finding algorithm<br>一种分层寻路算法中的域值放弃策略
%A LI Jian-yuan
%A SHI Jun
%A CAO Han
%A WANG Xi-li
%A <br>李建元
%A 师军
%A 曹菡
%A 汪西莉
%J 计算机应用
%D 2007
%I 
%X 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.
%K hierarchical route-flnding
%K hierarchical mute
%K flat mute
%K threshold
%K abandoning strategy<br>分层寻路
%K 分层路径
%K 平面路径
%K 域值
%K 放弃策略
%K 最短路径算法
%K 域值
%K 策略搜索
%K algorithm
%K hierarchical
%K strategy
%K 可采纳性
%K 使用
%K 数据表
%K 测试
%K 统计法
%K 参量
%K 因子
%K 距离
%K 估计
%K 起止点
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=831E194C147C78FAAFCC50BC7ADD1732&aid=14E16CBD27430512D0446458EBD288A0&yid=A732AF04DDA03BB3&vid=DB817633AA4F79B9&iid=0B39A22176CE99FB&sid=8143FF92EEF26F96&eid=FE6B7E9BDCCDBAA6&journal_id=1001-9081&journal_name=计算机应用&referenced_num=2&reference_num=11