The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
SHOP2: An HTN Planning System
Open accessAbstract
The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Tate, A. (1977) · International Joint Conference on Artificial Intelligence · Cited by 634
(1994) · Cited by 625
Using temporal logics to express search control knowledge for planning
Fahiem Bacchus, A., & Kabanza, F. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(99)00071-5 · Cited by 549
Practical Planning: Extending the Classical AI Planning Paradigm
Wilkins, D. E. (1988) · CERN Document Server (European Organization for Nuclear Research) · Cited by 518
Sacerdoti, E. D. (1975) · Defense Technical Information Center (DTIC) · Cited by 503
O-Plan: The open planning architecture
Currie, K., & Tate, A. (1991) · Artificial Intelligence · doi:10.1016/0004-3702(91)90024-e · Cited by 407
SHOP: Simple Hierarchical Ordered Planner
Nau, D. S., Cao, Y., Lotem, A., et al. (1999) · University Libraries (University of Maryland) · Cited by 397
Self-citationSolving time-dependent planning problems
Boddy, M., & Dean, T. (1989) · International Joint Conference on Artificial Intelligence · Cited by 292
Slaney, J., & Thiébaux, S. (2001) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00079-5 · Cited by 226
On the complexity of blocks-world planning
Gupta, N., & Nau, D. S. (1992) · Artificial Intelligence · doi:10.1016/0004-3702(92)90028-v · Cited by 220
Self-citation
Cited by
Automated machine learning: Review of the state-of-the-art and opportunities for healthcare
Waring, J., Lindvall, C., & Umeton, R. (2020) · Artificial Intelligence in Medicine · doi:10.1016/j.artmed.2020.101822 · Cited by 834
Hierarchically organized behavior and its neural foundations: A reinforcement learning perspective
Botvinick, M. M., Niv, Y., & Barto, A. G. (2009) · Cognition · doi:10.1016/j.cognition.2008.08.011 · Cited by 646
Hierarchical task and motion planning in the now
Kaelbling, L. P., & Lozano-Perez, T. (2011) · 2011 IEEE International Conference on Robotics and Automation · doi:10.1109/icra.2011.5980391 · Cited by 467
Web services composition: A decade’s overview
Sheng, Q. Z., Qiao, X., Vasilakos, A. V., Szabo, C., Bourne, S., & Xu, X. (2014) · Information Sciences · doi:10.1016/j.ins.2014.04.054 · Cited by 389
Web Service Composition: A Survey of Techniques and Tools
Lemos, A. L., Daniel, F., & Benatallah, B. (2016) · ACM Computing Surveys · doi:10.1145/2831270 · Cited by 320
Planning Through Stochastic Local Search and Temporal Action Graphs in LPG
Gerevini, A., Saetti, A., & Serina, I. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1183 · Cited by 318
Learning action models from plan examples using weighted MAX-SAT
Yang, Q., Wu, K., & Jiang, Y. (2007) · Artificial Intelligence · doi:10.1016/j.artint.2006.11.005 · Cited by 206
Logic-based technologies for multi-agent systems: a systematic literature review
Calegari, R., Ciatto, G., Mascardi, V., & Omicini, A. (2021) · Autonomous Agents and Multi-Agent Systems · doi:10.1007/s10458-020-09478-3 · Cited by 117
“[267] and JSHOP2 by Ilghami [197]—are domain-independent automatedplanning systems based on ordered task decomposition, which is a type of Hierarchical Task Network (HTN) planning—see Erol et al.”
MethodProceedings of the Eleventh ACM Conference on Learning @ Scale
(2024) · doi:10.1145/3657604 · Cited by 11
Metadata
- Authors
- Nau, D. S., Au, T. C., Ilghami, O., Kuter, U., Murdock, J. W., Wu, D., & Yaman, F.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 2003-12-01
- Volume
- 20
- Pages
- 379-404
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2147357263
- Cited by
- 947
- References
- 15
- FWCI
- 34.98
- Type
- journal article
- Language
- en
- Open access
- diamond
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.