J4

• 计算机科学 • Previous Articles     Next Articles

Distributed Flexible Graphplan

SUN Jigui1,2, LI Qianqian1,2, YIN Minghao1,2,3, FENG Yuxuan1,2, L Shuai1,2   

  1. 1. College of Computer Science and Technology, Jilin University, Changchun 130012, China; 2. Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education, Jilin University, Changchun 130012, China;3. School of Computer Science, Northeast Normal University, Changchun 130024, China
  • Received:2006-05-14 Revised:1900-01-01 Online:2006-08-26 Published:2006-11-26
  • Contact: SUN Jigui

Abstract: We proposed two distributed flexible graphplan systems: DFGP and IGDFGP. Decomposition of goal and action set in DFGP is carried out manually and that in IGDFGP is carried out automatically based on a new representation called interaction graphs. The subproblems are compiled to rrDFCSPs. Our experimental results show that both the distributed planners are orders of magnitude faster than graphplan.

Key words: flexible graphplan, DFGP system, IGDFGP system

CLC Number: 

  • TP301