LI Weisheng, ZHANG Zhen, WANG Weixing. CPT-FDR: An Approach to Translating PPDDL Conformant Planning Tasks into Finite-Domain Representations[J]. Chinese Journal of Electronics, 2012, 21(1): 53-58.
Citation: LI Weisheng, ZHANG Zhen, WANG Weixing. CPT-FDR: An Approach to Translating PPDDL Conformant Planning Tasks into Finite-Domain Representations[J]. Chinese Journal of Electronics, 2012, 21(1): 53-58.

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

  • Received Date: 2011-05-01
  • Rev Recd Date: 2011-06-01
  • Publish Date: 2012-01-05
  • 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 representation, noted the CPT-FDR, is studied to translate conformant 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 nondeterministic effects, fluents, axioms, and extended belief states. The FDR-based translation algorithm employs several 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 finitedomain representation, and CPT-FDRs can save the memory space and reduce the size of belief states effectively.
  • loading
  • 加载中

Catalog

    通讯作者: 陈斌, bchen63@163.com
    • 1. 

      沈阳化工大学材料科学与工程学院 沈阳 110142

    1. 本站搜索
    2. 百度学术搜索
    3. 万方数据库搜索
    4. CNKI搜索

    Article Metrics

    Article views (489) PDF downloads(845) Cited by()
    Proportional views
    Related

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return