Corpus ID: 11719274

Forward-Chaining Planning in Nondeterministic Domains

@inproceedings{Kuter2004ForwardChainingPI,
  title={Forward-Chaining Planning in Nondeterministic Domains},
  author={U. Kuter and D. Nau},
  booktitle={AAAI},
  year={2004}
}
In this paper, we present a general technique for taking forward-chaining planners for deterministic domains (e.g., HSP, TLPlan, TALplanner, and SHOP2) and adapting them to work in nondeterministic domains. Our results suggest that our technique preserves many of the desirable properties of these planners, such as the ability to use heuristic techniques to achieve highly efficient planning. In our experimental studies on two problem domains, the well-known MBP algorithm took exponential time… Expand
Plan aggregation for strong cyclic planning in nondeterministic domains
We describe a planning algorithm, NDP2, that finds strong-cyclic solutions to nondeterministic planning problems by using a classical planner to solve a sequence of classical planning problems. NDP2Expand
Task decomposition on abstract states, for planning under nondeterminism
TLDR
This work presents a new planning algorithm, called Yoyo, for solving planning problems in fully observable nondeterministic domains, which combines an HTN-based mechanism for constraining its search and a Binary Decision Diagram representation for reasoning about sets of states and state transitions. Expand
A Hierarchical Task-Network Planner based on Symbolic Model Checking
TLDR
This work presents a novel algorithm, called YoYo, for planning in nondeterministic domains under the assumption of full observability, that enables it to combine the power of search-control strategies as in Planning with Hierarchical Task Networks (HTNs) with techniques from the Planning via Symbolic Model-Checking (SMC). Expand
Conditionalization: Adapting Forward-Chaining Planners to Partially Observable Environments
We provide a general way to take forward-chaining planners for classical planning domains and conditionalize them, i.e., adapt them to generate policies for partially observable planning domains. ForExpand
Using Classical Planners to Solve Nondeterministic Planning Problems
TLDR
This work provides a way to use these algorithms, unmodified, to generate strong-cyclic solutions in fully-observable nondeterministic planning domains, and shows that when using this technique with FF and SGPlan, its performance compares quite favorably to that of MBP. Expand
FIP: A Fast Planning-Graph-Based Iterative Planner
TLDR
Experimental results on several nondeterministic planning problems show that FIP is more efficient than the well-known planner, MBP, especially as the size of the problems increases. Expand
Simple and Fast Strong Cyclic Planning for Fully-Observable Nondeterministic Planning Problems
TLDR
An NDP-motivated strong cyclic algorithm is described that can already outperform state-of-the-art FOND planners, and this algorithm is extended with a novel heuristic that addresses the challenge of dealing with the large size of the state space. Expand
Using Domain-Configurable Search Control for Probabilistic Planning
TLDR
Modifications of RTDP, LRTDP, and Value Iteration to use the search-control mechanisms of planners such as TLPlan, SHOP2, and TALplanner improve the performance of MDP planning algorithms. Expand
Controlled Search over Compact State Representations, in Nondeterministic Planning Domains and Beyond
TLDR
This paper describes how to combine ND-SHOP2's HTNs with MBP's BDDs, and discusses how these same ideas can be generalized for use in several other research areas, such as planning with Markov Decision Processes, synthesizing controllers for hybrid systems, and composing Semantic Web Services. Expand
Learning Hierarchical Task Networks for Nondeterministic Planning Domains
TLDR
This paper describes how to learn Hierarchical Task Networks (HTNs) in nondeterministic planning domains, where actions may have multiple possible outcomes, and developed a new learning algorithm, called HTN-MAKERND, that exploits these properties. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 24 REFERENCES
Strong Planning in Non-Deterministic Domains Via Model Checking
TLDR
A notion of planning solution which is guaranteed to achieve the goal independently of non-determinism, a notion of plan including conditionals and iterations, and an automatic decision procedure for strong planning based on model checking techniques are defined. Expand
Planning as Satisfiability in Nondeterministic Domains
TLDR
This work focuses on planning as satisfiability in simple nondeterministic domains and proposes a planning system which is competitive with other state-of-the-art planners. Expand
Strong Cyclic Planning Revisited
TLDR
This paper defines the notion of strong cyclic plan, which formalizes in temporal logic the above informal requirements for iterative plans, defines a planning algorithm based on model-checking techniques, and proves that the algorithm is guaranteed to returnStrong cyclic plans when they exist or to terminate with failure when they do not. Expand
SAT-based planning in complex domains: Concurrency, constraints and nondeterminism
TLDR
C-SAT is presented, a SAT-based procedure capable of dealing with planning domains having incomplete information about the initial state, and whose underlying transition system is specified using the highly expressive action language C. Expand
TALplanner: A temporal logic based forward chaining planner
We present TALplanner, a forward-chaining planner based on the use of domain-dependent search control knowledge represented as formulas in the Temporal Action Logic (TAL). TAL is a narrative basedExpand
Planning as Heuristic Search: New Results
TLDR
Hspr is a heuristic search planner that searches backward from the goal rather than forward from the initial state, which allows hspr to compute the heuristic estimates only once, and can produce better plans, often in less time. Expand
Using temporal logics to express search control knowledge for planning
TLDR
This work shows how domain dependent search control knowledge can be represented in a temporal logic, and then utilized to effectively control a forward-chaining planner. Expand
Fast Planning Through Planning Graph Analysis
TLDR
A new approach to planning in STRIPS-like domains based on constructing and analyzing a compact structure the authors call a Planning Graph is introduced, and a new planner, Graphplan, is described that uses this paradigm. Expand
MBP: a Model Based Planner
The Model Based Planner ( MBP) is a system for planning in non-deterministic domains. It can generate plans automatically to solve various planning problems, like conformant planning, planning underExpand
The FF Planning System: Fast Plan Generation Through Heuristic Search
TLDR
A novel search strategy is introduced that combines hill-climbing with systematic search, and it is shown how other powerful heuristic information can be extracted and used to prune the search space. Expand
...
1
2
3
...