Computer Science – Artificial Intelligence
Scientific paper
2011-06-30
Journal Of Artificial Intelligence Research, Volume 22, pages 215-278, 2004
Computer Science
Artificial Intelligence
Scientific paper
10.1613/jair.1492
Many known planning tasks have inherent constraints concerning the best order in which to achieve the goals. A number of research efforts have been made to detect such constraints and to use them for guiding search, in the hope of speeding up the planning process. We go beyond the previous approaches by considering ordering constraints not only over the (top-level) goals, but also over the sub-goals that will necessarily arise during planning. Landmarks are facts that must be true at some point in every valid solution plan. We extend Koehler and Hoffmann's definition of reasonable orders between top level goals to the more general case of landmarks. We show how landmarks can be found, how their reasonable orders can be approximated, and how this information can be used to decompose a given planning task into several smaller sub-tasks. Our methodology is completely domain- and planner-independent. The implementation demonstrates that the approach can yield significant runtime performance improvements when used as a control loop around state-of-the-art sub-optimal planning systems, as exemplified by FF and LPG.
Hoffmann Jeff
Porteous J.
Sebastia L.
No associations
LandOfFree
Ordered Landmarks in Planning 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 Ordered Landmarks in Planning, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Ordered Landmarks in Planning will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-480037