Computer Science – Artificial Intelligence
Scientific paper
2011-04-27
Computer Science
Artificial Intelligence
Scientific paper
Most current planners assume complete domain models and focus on generating correct plans. Unfortunately, domain modeling is a laborious and error-prone task. While domain experts cannot guarantee completeness, often they are able to circumscribe the incompleteness of the model by providing annotations as to which parts of the domain model may be incomplete. In such cases, the goal should be to generate plans that are robust with respect to any known incompleteness of the domain. In this paper, we first introduce annotations expressing the knowledge of the domain incompleteness, and formalize the notion of plan robustness with respect to an incomplete domain model. We then propose an approach to compiling the problem of finding robust plans to the conformant probabilistic planning problem. We present experimental results with Probabilistic-FF, a state-of-the-art planner, showing the promise of our approach.
Do Minh
Kambhampati Subbarao
Nguyen Tuan
No associations
LandOfFree
Synthesizing Robust Plans under Incomplete Domain Models does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Synthesizing Robust Plans under Incomplete Domain Models, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Synthesizing Robust Plans under Incomplete Domain Models will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-475056