| 加快启发式实时算法的收敛 |
| |
| 引用本文： | 曾岳,严新平,谭德荣. 加快启发式实时算法的收敛[J]. 山东理工大学学报：自然科学版, 2003, 17(2): 9-11 |
| |
| 作者姓名： | 曾岳 严新平 谭德荣 |
| |
| 作者单位： | 武汉理工大学,可靠性研究所,湖北,武汉,430063;山东理工大学,车辆与工程学院,山东,淄博,255049 |
| |
| 基金项目： | 教育部博士点基金项目 ( 2 0 0 10 4970 0 2 ),武汉市重大科技计划项目 ( 2 0 0 110 0 10 0 3 ) |
| |
| 摘 要： | LRTA^*算法是一种实时搜索算法,若重复求解同样的规划任务,LRTA^*将收敛于最短路径．文中给出了通过改变值更新规则来加快实时算法收敛的一种方法．实验表明它比LRTA^*算法更快地收敛于次优解．
|
| 关 键 词： | 实时 启发式搜索算法 值更新规则 收敛 |
| 文章编号： | 1007-1857(2003)02-0009-03 |
Speeding up the Convergence of Real-time Search Through Changing Value-update Rules |
| |
| ZENG Yue ,YAN Xin ping ,TAN De rong. Speeding up the Convergence of Real-time Search Through Changing Value-update Rules[J]. Journal of Shandong University of Technology:Science and Technology, 2003, 17(2): 9-11 |
| |
| Authors: | ZENG Yue YAN Xin ping TAN De rong |
| |
| Affiliation: | ZENG Yue 1,YAN Xin ping 1,TAN De rong 2 |
| |
| Abstract: | Learning Real time A *(LRTA *)is a real time search algorithm which converges to the shortest path when it solves the same planning task repeatedly. The method to speed up its convergence through change value update rules is proposed.The experiment shows that it often converges suboptimal solution faster than LRTA *. |
| |
| Keywords: | real time heuristic search algorithm value update rules convergence |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
