Landmark-Based Heuristics and Search Control for Automated Planning (Extended Abstract)
نویسنده
چکیده
Automated planning is the process of automatically selecting actions that achieve a desired outcome. This paper summarises several contributions that improve the e ciency of automated planning via heuristic search. We discuss novel heuristics based on landmarks and a search algorithm for anytime planning. Furthermore, we analyse various searchenhancement techniques and show how the combination of these techniques lead to a planning system that proved highly successful in the 2008 and 2011 International Planning Competitions.
منابع مشابه
Planning Graph Based Heuristics for Automated Planning
One of the most successful algorithms in the last few years for solving classical planning problems is Graphplan [3]. This algorithm can be seen as a disjunctive version of forward state space planners. The algorithm has two interleaved phases: a forward phase where a polynomial-time data structure called ”planning graph” is incrementally extended, and a backward phase where that planning graph...
متن کاملCost-Optimal Algorithms for Planning with Procedural Control Knowledge
There is an impressive body of work on developing heuristics and other reasoning algorithms to guide search in optimal and anytime planning algorithms for classical planning. However, very little effort has been directed towards developing analogous techniques to guide search towards high-quality solutions in hierarchical planning formalisms like HTN planning, which allows using additional doma...
متن کاملLandmark-Based Heuristics for Goal Recognition
Automated planning can be used to efficiently recognize goals and plans from partial or full observed action sequences. In this paper, we propose goal recognition heuristics that rely on information from planning landmarks — facts or actions that must occur if a plan is to achieve a goal when starting from some initial state. We develop two such heuristics: the first estimates goal completion b...
متن کاملCost-Optimal Algorithms for Hierarchical Goal Network Planning: A Preliminary Report
There is an impressive body of work in developing search heuristics and other reasoning algorithms to guide domainindependent planning algorithms towards (near-) optimal solutions. However, very little effort has been expended in developing analogous techniques to guide search towards high-quality solutions in domain-configurable planning formalisms, such as HTN planning. In lieu of such techni...
متن کاملEffective Search Techniques for Non-Classical Planning via Reformulation
Effective Search Techniques for Non-Classical Planning via Reformulation Jorge A. Baier Doctor of Philosophy Graduate Department of Computer Science University of Toronto 2010 Automated planning is a branch of AI that addresses the problem of generating a course of action to achieve a specified objective, given an initial state of the world. It is an area that is central to the development of i...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013