Material Detail

A Complete Algorithm for Generating Landmarks

A Complete Algorithm for Generating Landmarks

This video was recorded at 21st International Conference on Automated Planning and Scheduling. A collection of landmarks is complete if the cost of a minimum-cost hitting set equals h+ and there is a minimum-cost hitting set that is an optimal relaxed plan. We present an algorithm for generating a complete collection of landmarks and we show that this algorithm can be extended into effective polytime heuristics for optimal and satisficing planning. The new admissible heuristics are compared with current state-of-the-art heuristics for optimal planning on benchmark problems from the IPC.

Quality

  • User Rating
  • Comments
  • Learning Exercises
  • Bookmark Collections
  • Course ePortfolios
  • Accessibility Info

More about this material

Browse...

Disciplines with similar materials as A Complete Algorithm for Generating Landmarks

Comments

Log in to participate in the discussions or sign up if you are not already a MERLOT member.