Skip to search formSkip to main contentSkip to account menu

Partial-order planning

Known as: Partial plan, Pop 
Partial-order planning is an approach to automated planning that leaves decisions about the ordering of actions as open as possible. It contrasts… 
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
This paper describes a new planner, HiPOP (Hierarchical Partial-Order Planner), which is domain-configurable and uses POP… 
Highly Cited
2010
Highly Cited
2010
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of… 
2004
2004
We describe Probapop, a partial-order probabilistic planning system. Probapop is a blind (conformant) planner that finds plans… 
Review
2003
Review
2003
This paper overviews our currently in progress agent communication language simulator, called DIAGAL, by describing its use in… 
Highly Cited
2001
Highly Cited
2001
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting… 
Review
1997
Review
1997
Several recent studies have compared the relative efficiency of alternative flaw selection strategies for partial-order causal… 
1994
1994
Derivation replay was first proposed by Carbonell as a method of transferring guidance from a previous problem-solving episode to… 
Highly Cited
1994
Highly Cited
1994
For many years, the intuitions underlying partial-order planning were largely taken for granted. Only in the past few years has… 
Highly Cited
1993
Highly Cited
1993
An important aspect of partial-order planning is the resolution of threats between actions and causal links in a plan. We present… 
Highly Cited
1991
Highly Cited
1991
This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is…