| 以目标为导向的时序图规划算法的研究 |
| |
| 引用本文： | 介龙梅,张丹,杨红.以目标为导向的时序图规划算法的研究[J].电脑学习,2009(3):27-28. |
| |
| 作者姓名： | 介龙梅 张丹 杨红 |
| |
| 作者单位： | 大庆师范学院计算机科学与信息技术系,黑龙江,大庆,163712 |
| |
| 摘 要： | 本文提出了一种从目标集扩张时序规划图的新算法。此算法与现有算法不同。采用逆向扩张、正向搜索的策略：由于扩张保留了关于目标的信息。实现了动作方案的完全量化。在搜索阶段。只搜索相关可用动作的交叉点，减少了搜索代价，极大地提高了搜索效率。
|
| 关 键 词： | 人工智能 智能规划 图规划 时序规划 目标导向 |
Research on Goal-directed Temporal Graphplan Algorithm |
| |
| Jie Lonemei,Zhang Dan,Yang Hong.Research on Goal-directed Temporal Graphplan Algorithm[J].Computer Study,2009(3):27-28. |
| |
| Authors: | Jie Lonemei Zhang Dan Yang Hong |
| |
| Affiliation: | Jie Longmei,Zhang Dan, Yang Hong |
| |
| Abstract: | The paper presents a novel intelligent planning algorithm. In contrast to the existing methods, the algorithm expands hod only searches the cross-points of related actions available, which reduces the search price and greatly improves the temporal planning graph backwards from the goal set and searches a valid plan forward; Because the expansion reserves goal information, the full quantitative action programme is realized. Therefore, in the search stage, the metthe search efficiency. |
| |
| Keywords: | AI Intelligent Planning Graphplan Temporal Graphplan Goal-directed |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
