Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 205,231,737 papers from all fields of science
Search
Sign In
Create Free Account
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…
Expand
Wikipedia
Create Alert
Alert
Related topics
Related topics
9 relations
Algorithm
Artificial intelligence
Computer program
Planning Domain Definition Language
Expand
Broader (1)
Automated planning and scheduling
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
HiPOP: Hierarchical Partial-Order Planning
Patrick Bechon
,
M. Barbier
,
G. Infantes
,
C. Lesire
,
V. Vidal
STAIRS
2014
Corpus ID: 16881294
This paper describes a new planner, HiPOP (Hierarchical Partial-Order Planner), which is domain-configurable and uses POP…
Expand
Highly Cited
2010
Highly Cited
2010
Forward-Chaining Partial-Order Planning
A. Coles
,
A. Coles
,
M. Fox
,
D. Long
ICAPS
2010
Corpus ID: 10684453
Over the last few years there has been a revival of interest in the idea of least-commitment planning with a number of…
Expand
2004
2004
Probapop : Probabilistic Partial-Order Planning
N. Onder
,
G. C. Whelan
,
Li Li
2004
Corpus ID: 18799107
We describe Probapop, a partial-order probabilistic planning system. Probapop is a blind (conformant) planner that finds plans…
Expand
Review
2003
Review
2003
DIAGAL: A Tool for Analyzing and Modelling Commitment-Based Dialogues between Agents
M. Labrie
,
B. Chaib-draa
,
N. Maudet
Canadian Conference on AI
2003
Corpus ID: 688367
This paper overviews our currently in progress agent communication language simulator, called DIAGAL, by describing its use in…
Expand
Highly Cited
2001
Highly Cited
2001
Reviving Partial Order Planning
XuanLong Nguyen
,
S. Kambhampati
IJCAI
2001
Corpus ID: 5392557
This paper challenges the prevailing pessimism about the scalability of partial order planning (POP) algorithms by presenting…
Expand
Review
1997
Review
1997
Flaw Selection Strategies for Partial-Order Planning
M. Pollack
,
D. Joslin
,
M. Paolucci
J. Artif. Intell. Res.
1997
Corpus ID: 2502114
Several recent studies have compared the relative efficiency of alternative flaw selection strategies for partial-order causal…
Expand
1994
1994
Derivation Replay for Partial-Order Planning
L. Ihrig
,
S. Kambhampati
AAAI
1994
Corpus ID: 6261293
Derivation replay was first proposed by Carbonell as a method of transferring guidance from a previous problem-solving episode to…
Expand
Highly Cited
1994
Highly Cited
1994
Total-Order and Partial-Order Planning: A Comparative Analysis
Steven Minton
,
J. Bresina
,
M. Drummond
J. Artif. Intell. Res.
1994
Corpus ID: 11263280
For many years, the intuitions underlying partial-order planning were largely taken for granted. Only in the past few years has…
Expand
Highly Cited
1993
Highly Cited
1993
Postponing Threats in Partial-Order Planning
David E. Smith
,
M. Peot
AAAI
1993
Corpus ID: 36684024
An important aspect of partial-order planning is the resolution of threats between actions and causal links in a plan. We present…
Expand
Highly Cited
1991
Highly Cited
1991
Systematic Nonlinear Planning
David A. McAllester
,
David Rosenblitt
AAAI
1991
Corpus ID: 2584923
This paper presents a simple, sound, complete, and systematic algorithm for domain independent STRIPS planning. Simplicity is…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
,
Terms of Service
, and
Dataset License
ACCEPT & CONTINUE