Results 1 - 10
of
421
The FF planning system: Fast plan generation through heuristic search
- Journal of Artificial Intelligence Research
, 2001
"... We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be ind ..."
Abstract
-
Cited by 830 (55 self)
- Add to MetaCart
We describe and evaluate the algorithmic techniques that are used in the FF planning system. Like the HSP system, FF relies on forward state space search, using a heuristic that estimates goal distances by ignoring delete lists. Unlike HSP's heuristic, our method does not assume facts to be independent. We introduce a novel search strategy that combines Hill-climbing with systematic search, and we show how other powerful heuristic information can be extracted and used to prune the search space. FF was the most successful automatic planner at the recent AIPS-2000 planning competition. We review the results of the competition, give data for other benchmark domains, and investigate the reasons for the runtime performance of FF compared to HSP.
The Fast Downward planning system
- Journal of Artifical Intelligence Research
, 2006
"... Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other well-known planne ..."
Abstract
-
Cited by 347 (29 self)
- Add to MetaCart
(Show Context)
Fast Downward is a classical planning system based on heuristic search. It can deal with general deterministic planning problems encoded in the propositional fragment of PDDL2.2, including advanced features like ADL conditions and effects and derived predicates (axioms). Like other well-known planners such as HSP and FF, Fast Downward is a progression planner, searching the space of world states of a planning task in the forward direction. However, unlike other PDDL planning systems, Fast Downward does not use the propositional PDDL representation of a planning task directly. Instead, the input is first translated into an alternative representation called multivalued planning tasks, which makes many of the implicit constraints of a propositional planning task explicit. Exploiting this alternative representation, Fast Downward uses hierarchical decompositions of planning tasks for computing its heuristic function, called the causal graph heuristic, which is very different from traditional HSP-like heuristics based on ignoring negative interactions of operators. In this article, we give a full account of Fast Downward’s approach to solving multi-valued planning tasks. We extend our earlier discussion of the causal graph heuristic to tasks involving
The Metric-FF planning system: Translating ”ignoring delete lists” to numeric state variables.
- Journal Artificial Intelligence Research (JAIR)
, 2003
"... Abstract Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). Currently one of the most popular and successful algorithmic techniques in STRIPS planning is to guide search by a heuristic function, where the ..."
Abstract
-
Cited by 179 (12 self)
- Add to MetaCart
(Show Context)
Abstract Planning with numeric state variables has been a challenge for many years, and was a part of the 3rd International Planning Competition (IPC-3). Currently one of the most popular and successful algorithmic techniques in STRIPS planning is to guide search by a heuristic function, where the heuristic is based on relaxing the planning task by ignoring the delete lists of the available actions. We present a natural extension of "ignoring delete lists" to numeric state variables, preserving the relevant theoretical properties of the STRIPS relaxation under the condition that the numeric task at hand is "monotonic". We then identify a subset of the numeric IPC-3 competition language, "linear tasks", where monotonicity can be achieved by preprocessing. Based on that, we extend the algorithms used in the heuristic planning system FF to linear tasks. The resulting system Metric-FF is, according to the IPC-3 results which we discuss, one of the two currently most efficient numeric planners.
Planning through Stochastic Local Search and Action Graphs in LPG
- Journal of Artificial Intelligence Research (JAIR
, 1996
"... We present some techniques for planning in domains specified with the recent standard language pddl2.1, supporting “durative actions ” and numerical quantities. These tech-niques are implemented in lpg, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). ..."
Abstract
-
Cited by 169 (22 self)
- Add to MetaCart
(Show Context)
We present some techniques for planning in domains specified with the recent standard language pddl2.1, supporting “durative actions ” and numerical quantities. These tech-niques are implemented in lpg, a domain-independent planner that took part in the 3rd International Planning Competition (IPC). lpg is an incremental, any time system pro-ducing multi-criteria quality plans. The core of the system is based on a stochastic local search method and on a graph-based representation called “Temporal Action Graphs ” (TA-graphs). This paper focuses on temporal planning, introducing TA-graphs and proposing some techniques to guide the search in lpg using this representation. The experimental results of the 3rd IPC, as well as further results presented in this paper, show that our techniques can be very effective. Often lpg outperforms all other fully-automated plan-ners of the 3rd IPC in terms of speed to derive a solution, or quality of the solutions that can be produced. 1.
The LAMA planner: guiding cost-based anytime planning with landmarks.
- Journal Artificial Intelligence Research (JAIR)
, 2010
"... Abstract LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must be true in every solution of a planning task. LAMA builds on the Fast Downward planning system, using finite-dom ..."
Abstract
-
Cited by 141 (5 self)
- Add to MetaCart
(Show Context)
Abstract LAMA is a classical planning system based on heuristic forward search. Its core feature is the use of a pseudo-heuristic derived from landmarks, propositional formulas that must be true in every solution of a planning task. LAMA builds on the Fast Downward planning system, using finite-domain rather than binary state variables and multi-heuristic search. The latter is employed to combine the landmark heuristic with a variant of the well-known FF heuristic. Both heuristics are cost-sensitive, focusing on high-quality solutions in the case where actions have non-uniform cost. A weighted A * search is used with iteratively decreasing weights, so that the planner continues to search for plans of better quality until the search is terminated. LAMA showed best performance among all planners in the sequential satisficing track of the International Planning Competition 2008. In this paper we present the system in detail and investigate which features of LAMA are crucial for its performance. We present individual results for some of the domains used at the competition, demonstrating good and bad cases for the techniques implemented in LAMA. Overall, we find that using landmarks improves performance, whereas the incorporation of action costs into the heuristic estimators proves not to be beneficial. We show that in some domains a search that ignores cost solves far more problems, raising the question of how to deal with action costs more effectively in the future. The iterated weighted A * search greatly improves results, and shows synergy effects with the use of landmarks.
ARA*: Anytime A* with provable bounds on sub-optimality
- In: Proceedings of the 2003 conference in advances in neural information processing systems (NIPS
, 2003
"... In real world planning problems, time for deliberation is often limited. Anytime planners are well suited for these problems: they find a feasi-ble solution quickly and then continually work on improving it until time runs out. In this paper we propose an anytime heuristic search, ARA*, which tunes ..."
Abstract
-
Cited by 124 (30 self)
- Add to MetaCart
(Show Context)
In real world planning problems, time for deliberation is often limited. Anytime planners are well suited for these problems: they find a feasi-ble solution quickly and then continually work on improving it until time runs out. In this paper we propose an anytime heuristic search, ARA*, which tunes its performance bound based on available search time. It starts by finding a suboptimal solution quickly using a loose bound, then tightens the bound progressively as time allows. Given enough time it finds a provably optimal solution. While improving its bound, ARA* reuses previous search efforts and, as a result, is significantly more effi-cient than other anytime search methods. In addition to our theoretical analysis, we demonstrate the practical utility of ARA * with experiments on a simulated robot kinematic arm and a dynamic path planning prob-lem for an outdoor rover. 1
A Planning Heuristic Based on Causal Graph Analysis
"... In recent years, heuristic search methods for classical planning have achieved remarkable results. Their most successful representative, the FF algorithm, performs well over a wide spectrum of planning domains and still sets the state of the art for STRIPS planning. However, there are some planning ..."
Abstract
-
Cited by 119 (18 self)
- Add to MetaCart
(Show Context)
In recent years, heuristic search methods for classical planning have achieved remarkable results. Their most successful representative, the FF algorithm, performs well over a wide spectrum of planning domains and still sets the state of the art for STRIPS planning. However, there are some planning domains in which algorithms like FF and HSP perform poorly because their relaxation method of ignoring the “delete lists” of STRIPS operators loses too much vital information. Planning domains which have many dead ends in the search space are especially problematic in this regard. In some domains, dead ends are readily found by the human observer yet remain undetected by all propositional planning systems we are aware of. We believe that this is partly because the STRIPS representation obscures the important causal structure of the domain, which is evident to humans. In this paper, we propose translating STRIPS problems to a planning formalism with multi-valued state variables in order to expose this underlying causal structure. Moreover, we show how this structure can be exploited by an algorithm for detecting dead ends in the search space and by a planning heuristic based on hierarchical problem decomposition. Our experiments show excellent overall performance on the benchmarks from the international planning competitions.
Anytime Dynamic A*: An Anytime, Replanning Algorithm
- In ICAPS
, 2005
"... We present a graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion. Our algorithm tunes the quality of its solution based on available search time, at every step reusing previous search efforts. When updated information regarding the underly ..."
Abstract
-
Cited by 113 (17 self)
- Add to MetaCart
(Show Context)
We present a graph-based planning and replanning algorithm able to produce bounded suboptimal solutions in an anytime fashion. Our algorithm tunes the quality of its solution based on available search time, at every step reusing previous search efforts. When updated information regarding the underlying graph is received, the algorithm incrementally repairs its previous solution. The result is an approach that combines the benefits of anytime and incremental planners to provide efficient solutions to complex, dynamic search problems. We present theoretical analysis of the algorithm, experimental results on a simulated robot kinematic arm, and two current applications in dynamic path planning for outdoor mobile robots.
Landmarks, Critical Paths and Abstractions: What’s the Difference Anyway?
, 2009
"... Current heuristic estimators for classical domain-independent planning are usually based on one of four ideas: delete relaxations, critical paths, abstractions, and, most recently, landmarks. Previously, these different ideas for deriving heuristic functions were largely unconnected. We prove that a ..."
Abstract
-
Cited by 112 (28 self)
- Add to MetaCart
Current heuristic estimators for classical domain-independent planning are usually based on one of four ideas: delete relaxations, critical paths, abstractions, and, most recently, landmarks. Previously, these different ideas for deriving heuristic functions were largely unconnected. We prove that admissible heuristics based on these ideas are in fact very closely related. Exploiting this relationship, we introduce a new admissible heuristic called the landmark cut heuristic, which compares favourably with the state of the art in terms of heuristic accuracy and overall performance.
Heuristic Planning with Time and Resources
, 2001
"... We present an algorithm for planning with time and resources based on heuristic search. The algorithm minimizes makespan using an admissible heuristic derived automatically from the problem instance. Estimators for resource consumption are derived in the same way. The goals are twofold: To show t ..."
Abstract
-
Cited by 110 (4 self)
- Add to MetaCart
(Show Context)
We present an algorithm for planning with time and resources based on heuristic search. The algorithm minimizes makespan using an admissible heuristic derived automatically from the problem instance. Estimators for resource consumption are derived in the same way. The goals are twofold: To show the flexibility of the heuristic search approach to planning and to develop a planner that combines expressivity and performance. The two main issues are the definition of regression in the temporal setting and the definition of the heuristic for estimating completion time. A number of experiments are presented for assessing the performance of the resulting planner. 1
