CPT-FDR： An Approach to Translating PPDDL Conformant Planning Tasks into Finite-Domain Representations  

作　　者：LI Weisheng ZHANG Zhen WANG Weixing 

机构地区：[1]College of Computer Science and Technology, Chongqing University of Posts and Telecommunications, Chongqing 400065, China [2]College of Physics and Information Engineering, Fuzhou University, Fuzhou 350108, China

出　　处：《Chinese Journal of Electronics》2012年第1期53-58,共6页电子学报（英文版）

基　　金：This work is supported by the National Natural Science Foundation of China （No.60842003）, and the Key Project of Chinese Ministry of Education （No.210184）.

摘　　要：Getting a compact representation of belief spaces is one of the most important issues in a conformant planning task. In this paper, a translation approach to Conformant planning tasks in a Finite-domain representa- tion, noted the CPT-FDR, is studied to translate confor- mant planning tasks specified in PPDDL formalism into a concise grounded representation that uses finite-domain state variables. It is extended for the semantic of the non- deterministic effects, fluents, axioms, and extended belief states. The FDR-based translation algorithm employs sev- eral techniques that can deal with the uncertainty in the initial state and in the non-deterministic operator effects. The experimental results show that the approach can map the conformant planning tasks in the PPDDL into finite- domain representation, and CPT-FDRs can save the mem- ory space and reduce the size of belief states effectively.

关 键 词：Finite-domain representation Confor- mant planning CPT-FDR Non-deterministic action ef- fect. 

分 类 号：TP391.2[自动化与计算机技术—计算机应用技术] O157.4[自动化与计算机技术—计算机科学与技术]