Landmarks in Heuristic-Search Planning
author: Erez Karpas, Technion - Israel Institute of Technology
published: Nov. 15, 2010, recorded: October 2010, views: 7488
Report a problem or upload filesIf you have found a problem with this lecture or would like to send us extra material, articles, exercises, etc., please use our ticket system to describe your request and upload the data.
Enter your e-mail into the 'Cc' field, and we will keep you updated with your request's status.
The recent past has seen a resurge of interest in landmarks for heuristic-search planning. Landmarks are subgoals that have to become true at some point during any plan for a given task. They can be used in various ways to assist the search for a plan. This tutorial will give an overview of how landmarks can be identified for a given task and how they may be exploited for planning. In detail, the following topics will be covered:
1. Definitions of landmarks and orderings, including action landmarks. 2. Landmark discovery procedures, including back-chaining from goals, path analysis in domain transition graphs, and forward propagation of information in the planning graph. 3. Methods to exploit landmarks during planning, including as intermediate goals, in the LAMA heuristic, as admissible heuristic, and as problem enrichment via temporal formulas.
Download slides: icaps2010_sanner_lhsp_01.pdf (514.7 KB)
Link this pageWould you like to put a link to this lecture on your homepage?
Go ahead! Copy the HTML snippet !
Write your own review or comment: