Flexible Conformant Graphplan

The conformant planner has enjoyed great success in non-deterministic planning domain. However, the conformant planning problems are still cast in terms of imperative constraints that are either wholly satisfied or wholly violated. It is argued herein that this framework is too rigid to capture the...

Full description

Saved in:
Bibliographic Details
Published in2007 International Conference on Machine Learning and Cybernetics Vol. 6; pp. 3110 - 3115
Main Authors Kun Hou, Ji-Gui Sun, Ming-Hao Yin, Wei Yang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.08.2007
Subjects
Computer science
Conformant graphplan
Cybernetics
Educational institutions
Flexible conformant graphplan
Flexible graphplan
Intelligent planning
Logistics
Machine learning
Packaging
Protection
Road safety
Technology planning
Uncertainty
Online AccessGet full text
ISBN1424409721
9781424409723
ISSN2160-133X
DOI10.1109/ICMLC.2007.4370682

Cover

More Information
Summary:The conformant planner has enjoyed great success in non-deterministic planning domain. However, the conformant planning problems are still cast in terms of imperative constraints that are either wholly satisfied or wholly violated. It is argued herein that this framework is too rigid to capture the full subtlety of many real problems. This paper introduces the notion of flexible constraint into conformant planning and introduces a novel flexible conformant planning problem, namely conformant flexible planning problem. We also put forward a Graph plan-based algorithm to solve this problem. The method takes into account user's requirement and taste, therefore, it can improve the quality of a plan comprehensively, and make the solution plan more suitable for the needs. In this sense, it can handle the planning problems much closer to the real world.
ISBN:1424409721
9781424409723
ISSN:2160-133X
DOI:10.1109/ICMLC.2007.4370682