EXPLOITING CSP TECHNIQUES IN TEMPORAL GRAPHPLAN

摘要：

Exploiting CSP search techniques such as forward checking, arc consistency, dynamic variable ordering,conflict-directed back jumping and local search strategies in the classical Graphplan can effectively avoid the conflicts and the low effect in the process of solution extraction. In this paper, we pay attention to a more complex planning problem-temporal planning problem under the Graphplan framework. We adopt CSP search techniques in the temporal planning graph, which make the process of solution extraction more efficient. So our research is very helpful to the development of robotology, natural language understanding,intelligent agent etc.

关键词： Intelligent planning Graphplan Temporal planning CSP DCSP

作者: LONG-MEI JIE HONG-GUANG SUN FANG WANG

作者单位: School of Computer, Northeast Normal University, Changchun 130117, Jilin, China

会议类型: 国际会议

会议名称: 2006 International Conference on Machine Learning and Cybernetics(IEEE第五届机器学习与控制论坛)

会议地点: 大连

会议语种:英文

页码: 846-849

在线出版日期: 2006-08-13（万方平台首次上网日期，不代表论文的发表时间）