摘要
网络最优路径问题的求解多用启发式算法。LRTA*算法作为启发式A*算法的改进,在多路径求解中,通过引入网络系统实时动态信息,满足动态环境下的实时要求,较快收敛于最优路径。本文给出了通过改变值更新规则来加快实时算法收敛的一种新方法,通过时间和解质量的相对折中,使该算法比LRTA*算法更快地收敛于满意解,是一种求解大城市稠密路网两点间最优路径的有效方法。
The heuristics is used to solve the shortest path. In solving many paths , as an improved A^＊ algorithm,leaming real-time A^＊ （ LRTA^＊ ） is a real-time search algorithm. Based on dynamic system information, LRTA^＊ can converge rapidly the optimal path. In this paper, a new method to speed up its convergence through changing value-update rules is proposed. The experiment shows that it often converges suboptimal solution faster than LRTA^＊ .It is a better method to solve the satisfactory solution between O-D in a big route net- work.
出处
《计算机与现代化》
2006年第9期110-112,共3页
Computer and Modernization
关键词
最优路径
启发式搜索算法
值更新规则
收敛
optimal path
heuristic search algorithm
value-update rules
convergence
