Results 1 - 10
of
24
Sapa: A multi-objective metric temporal planner
- J. Artif. Intell. Res
"... Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of handling the multi-objective nature of metric temporal planning. Our technical contributions include (i) planning-graph b ..."
Abstract
-
Cited by 34 (10 self)
- Add to MetaCart
Sapa is a domain-independent heuristic forward chaining planner that can handle durative actions, metric resource constraints, and deadline goals. It is designed to be capable of handling the multi-objective nature of metric temporal planning. Our technical contributions include (i) planning-graph based methods for deriving heuristics that are sensitive to both cost and makespan (ii) techniques for adjusting the heuristic estimates to take action interactions and metric resource limitations into account and (iii) a linear time greedy post-processing technique to improve execution flexibility of the solution plans. An implementation of Sapa using many of the techniques presented in this paper was one of the best domain independent planners for domains with metric and temporal constraints in the third International Planning Competition, held at AIPS-02. We describe the technical details of extracting the heuristics and present an empirical evaluation of the current implementation of Sapa. 1.
Sequential monte carlo in probabilistic planning reachability heuristics
- Artificial Intelligence
, 2008
"... The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan lengths, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic searc ..."
Abstract
-
Cited by 23 (13 self)
- Add to MetaCart
The current best conformant probabilistic planners encode the problem as a bounded length CSP or SAT problem. While these approaches can find optimal solutions for given plan lengths, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic search outperforms CSP/SAT techniques (especially when a plan length is not given a priori). The problem with applying heuristic search in probabilistic planning is that effective heuristics are as yet lacking. In this work, we apply heuristic search to conformant probabilistic planning by adapting planning graph heuristics developed for non-deterministic planning. We evaluate a straight-forward application of these planning graph techniques, which amounts to exactly computing the distribution over reachable relaxed planning graph layers. Computing these distributions is costly, so we apply Sequential Monte Carlo to approximate them. We demonstrate on several domains how our approach enables our planner to far out-scale existing (optimal) probabilistic planners and still find reasonable quality solutions.
When is temporal planning really temporal
- In IJCAI
, 2007
"... While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this challenge by restricting action start times to a small set of decision epochs, because this enables ..."
Abstract
-
Cited by 10 (3 self)
- Add to MetaCart
While even STRIPS planners must search for plans of unbounded length, temporal planners must also cope with the fact that actions may start at any point in time. Most temporal planners cope with this challenge by restricting action start times to a small set of decision epochs, because this enables search to be carried out in state-space and leverages powerful state-based reachability heuristics, originally developed for classical planning. Indeed, decision-epoch planners won the International Planning Competition’s Temporal Planning Track in 2002, 2004 and 2006. However, decision-epoch planners have a largely unrecognized weakness: they are incomplete. In order to characterize the cause of incompleteness, we identify the notion of required concurrency, which separates expressive temporal action languages from simple ones. We show that decisionepoch planners are only complete for languages in the simpler class, and we prove that the simple class is ‘equivalent ’ to STRIPS! Surprisingly, no problems with required concurrency have been included in the planning competitions. We conclude by designing a complete state-space temporal planning algorithm, which we hope will be able to achieve high performance by leveraging the heuristics that power decision epoch planners. 1
A PDDL Based Tool for Automatic Web Service Composition
- In Proceedings of the Second Intl Workshop on Principles and Practice of Semantic Web Reasoning (PPSWR
, 2004
"... Abstract. One of the motivations for research in semantic web services is to automatically compose web service operations to solve given problems. The idea of using AI planning software to this end has been suggested by several papers. The present paper follows this approach but argues that the dive ..."
Abstract
-
Cited by 8 (1 self)
- Add to MetaCart
Abstract. One of the motivations for research in semantic web services is to automatically compose web service operations to solve given problems. The idea of using AI planning software to this end has been suggested by several papers. The present paper follows this approach but argues that the diversity of the web service domains is best addressed by a flexible combination of complementary reasoning techniques and planning systems. We present a tool that transforms web service composition problems into AI planning problems and delegates them to the planners most suitable for the particular planning task. The tool uses PDDL, a language supported by a wide range of planning engines, as a transfer format. The present paper describes the tool and its strategies to cope with the problems of incomplete information, various types of web service indeterminism, stateful services and structurally rich goal specifications. 1
A tutorial on planning graph based reachability heuristics
- AI Magazine
"... The primary revolution in automated planning in the last decade has been the very impressive scaleup in planner performance. A large part of the credit for this can be attributed squarely to the invention and deployment of powerful reachability heuristics. Most, if not all, modern reachability heuri ..."
Abstract
-
Cited by 5 (4 self)
- Add to MetaCart
The primary revolution in automated planning in the last decade has been the very impressive scaleup in planner performance. A large part of the credit for this can be attributed squarely to the invention and deployment of powerful reachability heuristics. Most, if not all, modern reachability heuristics are based on a remarkably extensible data structure called the planning graph, which made its debut as a bit player in the success of GraphPlan, but quickly grew in prominence to occupy the center stage. Planning graphs are a cheap means to obtain informative look-ahead heuristics for search and have become ubiquitous in state of the art heuristic search planners. We present the foundations of planning graph heuristics in classical planning and explain how their flexibility lets them adapt to more expressive scenarios that consider action costs, goal utility, numeric resources, time, and uncertainty.
Handling Numeric Criteria in Relaxed Planning Graphs
"... Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graphplan -like expansion. Planners like FF or MIPS use this type of graphs in order to compute distance-based heuristics during the planning process. ..."
Abstract
-
Cited by 3 (1 self)
- Add to MetaCart
Nowadays, one of the main techniques used in heuristic planning is the generation of a relaxed planning graph, based on a Graphplan -like expansion. Planners like FF or MIPS use this type of graphs in order to compute distance-based heuristics during the planning process.
State Agnostic Planning Graphs and the Application to Belief-Space Planning
- In Proceedings of the Twentieth National Conference on Artificial Intelligence and the Seventeenth Innovative Applications of Artificial Intelligence Conference, 1131–1138. Menlo Park, CA: AAAI Press. Articles SPRING 2007 81 Articles 82 AI MAGAZINE
, 2003
"... Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states. The naive technique enumerates the graphs individually. This is equivalent to solving an all-pairs short ..."
Abstract
-
Cited by 3 (2 self)
- Add to MetaCart
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of a set of states. The naive technique enumerates the graphs individually. This is equivalent to solving an all-pairs shortest path problem by iterating a single-source algorithm over each source. We introduce a structure, the state agnostic planning graph, that directly solves the all-pairs problem for the relaxation introduced by planning graphs. The technique can also be characterized as exploiting the overlap present in sets of planning graphs. For the purpose of exposition, we first present the technique in classical planning. The more prominent application of this technique is in belief-space planning, where an optimization results in drastically improved theoretical complexity. Our experimental evaluation quantifies this performance boost, and demonstrates that heuristic belief-space progression planning using our technique is competitive with the state of the art.
Sequential monte carlo in reachability heuristics for probabilistic planning
- Artif. Intell
, 2008
"... Some of the current best conformant probabilistic planners focus on finding a fixed length plan with maximal probability. While these approaches can find optimal solutions, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic search outperfor ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
Some of the current best conformant probabilistic planners focus on finding a fixed length plan with maximal probability. While these approaches can find optimal solutions, they often do not scale for large problems or plan lengths. As has been shown in classical planning, heuristic search outperforms bounded length search (especially when an appropriate plan length is not given a priori). The problem with applying heuristic search in probabilistic planning is that effective heuristics are as yet lacking. In this work, we apply heuristic search to conformant probabilistic planning by adapting planning graph heuristics developed for non-deterministic planning. We evaluate a straightforward application of these planning graph techniques, which amounts to exactly computing a distribution over many relaxed planning graphs (one planning graph for each joint outcome of uncertain actions at each time step). Computing this distribution is costly, so we apply Sequential Monte Carlo (SMC) to approximate it. One important issue that we explore in this work is how to automatically determine the number of samples required for effective heuristic computation. We empirically demonstrate on several domains how our efficient, but sometimes suboptimal, approach enables our planner to solve much larger problems than an existing optimal bounded length probabilistic planner and still find reasonable quality solutions.
A tutorial on planning graph-based reachability heuristics
, 2007
"... The primary revolution in automated planning in the last decade has been the very impressive scaleup in planner performance. A large part of the credit for this can be attributed squarely to the invention and deployment of powerful reachability heuristics. Most, if not all, modern reachability heu ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
The primary revolution in automated planning in the last decade has been the very impressive scaleup in planner performance. A large part of the credit for this can be attributed squarely to the invention and deployment of powerful reachability heuristics. Most, if not all, modern reachability heuristics are based on a remarkably extensible data structure called the planning graph, which made its debut as a bit player in the success of GraphPlan, but quickly grew in prominence to occupy the center stage. Planning graphs are a cheap means to obtain informative look-ahead heuristics for search and have become ubiquitous in state-of-the-art heuristic search planners. We present the foundations of planning graph heuristics in classical planning and explain how their flexibility lets them adapt to more expressive scenarios that consider action costs, goal utility, numeric resources, time, and uncertainty.
The two faces of plan repair
"... Plan repair has two faces. Alternately, a plan repair method looks like a planning method, or looks like a method that does exactly the opposite, i.e., removing actions from a plan. We propose a general framework for plan repair that shows the relation between these two alternating steps. Any plan r ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
Plan repair has two faces. Alternately, a plan repair method looks like a planning method, or looks like a method that does exactly the opposite, i.e., removing actions from a plan. We propose a general framework for plan repair that shows the relation between these two alternating steps. Any plan repair method has this property. This claim is supported by showing how a number of plan repair systems fit into the presented framework. One of the advantages of a general framework is that it helps to understand existing techniques and improve upon them. As an example of this, we present a novel heuristic for plan repair that can make use of existing planning heuristics. Some initial results are provided that indicate that this heuristic is competitive with existing plan repair methods. 1

