Partial-Order Planning is a planning method in artificial intelligence that belongs to the class of automated planning techniques and is distinguished by its representation of actions as a partially ordered set, enabling flexibility in the execution sequence by specifying only the necessary precedence constraints among actions.
130
Publications
7.1K
Citations
217
Authors
103
Institutions
Publications per year
2017–2026
13
Parents
Publications
130
An Introduction to Least Commitment Planning
Daniel S. Weld · 1994 · 587 citations
Earl D. Sacerdoti · Defense Technical Information Center (DTIC) · 1975 · 482 citations
1–5 of 130
Authors
217
- SK
11
h-index
- SB
8
h-index
- GB
7
h-index
- DH
6
h-index
- PB
5
h-index
1–5 of 217
Institutions
103
Arizona State University
Tempe, United States
11 h-index
19 publications
933 citations
University of Toronto
Toronto, Canada
6 h-index
14 publications
382 citations
Ames Research Center
Mountain View, United States
6 h-index
10 publications
523 citations
Linköping University
Linköping, Sweden
5 h-index
9 publications
222 citations
Carnegie Mellon University
Pittsburgh, United States
5 h-index
8 publications
628 citations
University of Freiburg
Freiburg im Breisgau, Germany
5 h-index
8 publications
196 citations
University of Maryland, College Park
College Park, United States
4 h-index
8 publications
1.9K citations
University of Pittsburgh
Pittsburgh, United States
3 h-index
6 publications
456 citations
1–8 of 103
Venues
- Journal of Artificial Intelligence Research
JAIR · 10 publications · 827 citations
10
h-index
- Proceedings of the International Conference on Automated Planning and Scheduling
8 publications · 421 citations
8
h-index
- Artificial Intelligence
6 publications · 504 citations
6
h-index
- Proceedings of the AAAI Conference on Artificial Intelligence
Conference · 5 publications · 123 citations
5
h-index
- International Joint Conference on Artificial Intelligence
Conference · 5 publications · 103 citations
5
h-index
1–5