Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
265
Selectively Delaying Linking Commitments in Partial-Order Planners
"... . Total-order planners perform backtracking search over all possible total-orderings, but their commitment to a total order gives them a well-defined current state that can be used to guide the search at later choice-points. Partial-order planners handle operator-orderings more efficiently, but lack ..."
Abstract
- Add to MetaCart
. Total-order planners perform backtracking search over all possible total-orderings, but their commitment to a total order gives them a well-defined current state that can be used to guide the search at later choice-points. Partial-order planners handle operator-orderings more efficiently
Integrating landmarks in partial order planners
"... Abstract In this paper we continue a line of research which focusses on reviving partial order planning. We focus on utilizing landmarks (Porteous and Sebastia 2000) to split a planning problem into a set of subproblems. Our goal is to work towards a planner which solely uses lifted actions and thi ..."
Abstract
- Add to MetaCart
Abstract In this paper we continue a line of research which focusses on reviving partial order planning. We focus on utilizing landmarks (Porteous and Sebastia 2000) to split a planning problem into a set of subproblems. Our goal is to work towards a planner which solely uses lifted actions
Generating Parallel Execution Plans with a Partial-Order Planner
- IN PROCEEDINGS OF THE SECOND INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE PLANNING SYSTEMS
, 1994
"... Many real-world planning problems require generating plans that maximize the parallelism inherentina problem. There are a number of partial-order planners that generate such plans# however, in most of these planners it is unclear under what conditions the resulting plans will be correct and whe ..."
Abstract
-
Cited by 46 (17 self)
- Add to MetaCart
Many real-world planning problems require generating plans that maximize the parallelism inherentina problem. There are a number of partial-order planners that generate such plans# however, in most of these planners it is unclear under what conditions the resulting plans will be correct
New Methods for plan selection and refinement in a partial-order planner
, 1995
"... Partial order planners are very effective in solving simple problems. However, the search space in planning grows quickly with the number of subgoals and initial conditions, as well as less countable factors such as operator ordering and subgoal interactions. There are certain inherent features of t ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
of these planners like flaw selection and threat resolution that causes this search space explosion. For partial-order planners to solve more than simple problems, the expansion of the search space will need to be controlled. This paper presents four new approaches to controlling search space expansion
UCPOP: A Sound, Complete, Partial Order Planner for ADL
, 1992
"... We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove ucpo ..."
Abstract
-
Cited by 493 (25 self)
- Add to MetaCart
We describe the ucpop partial order planning algorithm which handles a subset of Pednault's ADL action representation. In particular, ucpop operates with actions that have conditional effects, universally quantified preconditions and effects, and with universally quantified goals. We prove
Comparison of Methods for Improving Search Efficiency in a Partial-Order Planner
- In Proceedings of the 14th International Joint Conference on Artificial Intelligence
, 1995
"... The search space in partial-order planning grows quickly with the number of subgoals and initial conditions, as well as less countable factors such as operator ordering and subgoal interactions. For partial-order planners to solve more than simple problems, the expansion of the search space will nee ..."
Abstract
-
Cited by 10 (4 self)
- Add to MetaCart
The search space in partial-order planning grows quickly with the number of subgoals and initial conditions, as well as less countable factors such as operator ordering and subgoal interactions. For partial-order planners to solve more than simple problems, the expansion of the search space
A Case Study on Mergeability of Cases with a Partial-Order Planner
- In Proc. of ECP-97, Steel & R. Alami (Eds.): Recent Advances in AI Planning
, 1997
"... . Retrieving multiple cases is supposed to be an adequate retrieval strategy for guiding partial-order planners because of the recognized flexibility of these planners to interleave steps in the plans. Cases are combined by merging them. In this paper, we will examine two different kinds of merging ..."
Abstract
-
Cited by 6 (3 self)
- Add to MetaCart
. Retrieving multiple cases is supposed to be an adequate retrieval strategy for guiding partial-order planners because of the recognized flexibility of these planners to interleave steps in the plans. Cases are combined by merging them. In this paper, we will examine two different kinds of merging
VHPOP: Versatile heuristic partial order planner
- JOURNAL OF ARTIFICIAL INTELLIGENCE RESEARCH
, 2003
"... VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990’s on flaw selection strategies for POCL planning, and combines this with more recent developments in the field of domain independent planning such as distance base ..."
Abstract
-
Cited by 52 (1 self)
- Add to MetaCart
VHPOP is a partial order causal link (POCL) planner loosely based on UCPOP. It draws from the experience gained in the early to mid 1990’s on flaw selection strategies for POCL planning, and combines this with more recent developments in the field of domain independent planning such as distance
Achieving the Functionality of Filter Conditions in a Partial Order Planner
- IN PROC. 10TH NAT. CONF. ON A.I
, 1992
"... One of the most common modifications made to the standard STRIPS action representation is the inclusion of filter conditions. A key function of such filter conditions is to distinguish between operators that represent different context-dependent effects for the same action. We consider how fil ..."
Abstract
-
Cited by 27 (4 self)
- Add to MetaCart
filter conditions may be used to provide this functionality in a complete and correct partial order planner. We conclude that they are not effective, and that in general the use of filter conditions is incompatible with the basic assumptions that lie behind partial order planning. We present
Learning to Improve Quality of the Solutions Produced by Partial Order Planners
"... This paper explores the issue of learning operational knowledge to improve quality of the plans produced by a partial order planner by using an interacting planning system PIPP. We assume that PIPP possesses book knowledge about its domain and post-facto knowledge about comparing completed plans wit ..."
Abstract
- Add to MetaCart
This paper explores the issue of learning operational knowledge to improve quality of the plans produced by a partial order planner by using an interacting planning system PIPP. We assume that PIPP possesses book knowledge about its domain and post-facto knowledge about comparing completed plans
Results 1 - 10
of
265
