Flexible Planning Problems & Flexible Graphplan
This chapter argues that, just as in the case of classical CSP, the classical AI Planning framework is too rigid to capture the full subtlety of many real problems. This is due to the fact that it too is founded on hard constraints, and hence has no capability of making compromises. In order to address this issue, a new flexible planning problem is defined which is designed to allow a tradeoff between the length of a plan and the number of compromise decisions it contains.
KeywordsPlanning Graph Satisfaction Degree Flexible Operator Domain Element Graph Expansion
Unable to display preview. Download preview PDF.