A review of machine learning for automated planning
The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Abstract
Recent discoveries in automated planning are broadening the scope of planners, from toy problems to real applications. However, applying automated planners to real-world problems is far from simple. On the one hand, the definition of accurate action models for planning is still a bottleneck. On the other hand, off-the-shelf planners fail to scale-up and to provide good solutions in many domains. In these problematic domains, planners can exploit domain-specific control knowledge to improve their performance in terms of both speed and quality of the solutions. However, manual definition of control knowledge is quite difficult. This paper reviews recent techniques in machine learning for the automatic definition of planning knowledge. It has been organized according to the target of the learning process: automatic definition of planning action models and automatic definition of planning control knowledge. In addition, the paper reviews the advances in the related field of reinforcement learning.
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
Reinforcement Learning: A Survey
Kaelbling, L. P., Littman, M. L., & Moore, A. W. (1996) · Journal of Artificial Intelligence Research · doi:10.1613/jair.301 · Cited by 8,972
STRIPS: A New Approach to the Application of Theorem Proving to Problem Solving
Fikes, R. E., & Nilsson, N. J. (1971) · Artificial Intelligence · doi:10.1016/0004-3702(71)90010-5 · Cited by 4,882 · cited 1×
“The STanford Research Institute Problem Solver (STRIPS; Fikes & Nilsson, 1971), developed to be the planning component for controlling the autonomous robot Shakey (Nilsson, 1984), perfectly illustrates the interaction of these influences.”
Richardson, M., & Domingos, P. (2006) · Machine Learning · doi:10.1007/s10994-006-5833-1 · Cited by 2,676 · cited 2×
“This aspect of overlapping examples is also present in the induction of stochastic logic models such as Stochastic Logic Programs (Muggleton, 1995; Cussens, 2001), Bayesian Logic Programs (Jaeger, 1997; Kersting & Raedt, 2001) or Markov Logic Networks (Richardson & Domingos, 2006).”
PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains
Fox, M., & Long, D. (2003) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1129 · Cited by 1,741
Top-down induction of first-order logical decision trees
Blockeel, H., & De Raedt, L. (1998) · Artificial Intelligence · doi:10.1016/s0004-3702(98)00034-4 · Cited by 685
Relational Reinforcement Learning
Džeroski, S., De Raedt, L., & Driessens, K. (2001) · Machine Learning · doi:10.1023/a:1007694015589 · Cited by 371
Logical and Relational Learning
De Raedt, L. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-88190-2_1 · Cited by 326
Logical and Relational Learning
(2008) · Cognitive Technologies · doi:10.1007/978-3-540-68856-3 · Cited by 233 · cited 1×
“Algorithms for relational clustering or for inferring association rules (Raedt, 2008) have still not been explored in AP.”
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 · cited 3×
“Partial state observability (Yang et al., 2007), (Amir and Chang, 2008), (Mour˜ao et al., 2008), LOCM (Cresswell et al., 2009) Probabilistic effects Full state observability (cid:129) Rich expressiveness (cid:129) Efficient planning algorithms (cid:129) Non-existent online learning (Oates and…”
Policy Recognition in the Abstract Hidden Markov Model
Bui, H. H., Venkatesh, S., & West, G. (2002) · Journal of Artificial Intelligence Research · doi:10.1613/jair.839 · Cited by 123
Cited by
Deliberation for autonomous robots: A survey
Ingrand, F., & Ghallab, M. (2017) · Artificial Intelligence · doi:10.1016/j.artint.2014.11.003 · Cited by 309
Towards Blended Reactive Planning and Acting using Behavior Trees
Colledanchise, M., Almeida, D., & Ogren, P. (2019) · 2019 International Conference on Robotics and Automation (ICRA) · doi:10.1109/icra.2019.8794128 · Cited by 133
Learning action models with minimal observability
Aineto, D., Jiménez Celorrio, S., & Onaindia, E. (2019) · Artificial Intelligence · doi:10.1016/j.artint.2019.05.003 · Cited by 57
Metadata
- Authors
- Jiménez, S., De La Rosa, T., Fernández, S., Fernández, F., & Borrajo, D.
- Venue
- The Knowledge Engineering Review
- Publisher
- Maximum Academic Press
- Published
- 2012-11-12
- Volume
- 27
- Issue
- 4
- Pages
- 433-467
- ISSN
- 0269-8889 (ISSN-L)
- 1469-8005
- OpenAlex
- W2291853497
- Cited by
- 113
- References
- 10
- FWCI
- 3.48
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: A review of machine learning for automated planning. https://app.cochat.ai/papers/10.1017/s026988891200001x
- The paper
- Jiménez, S., De La Rosa, T., Fernández, S., Fernández, F., & Borrajo, D. (2012). A review of machine learning for automated planning. The Knowledge Engineering Review. https://doi.org/10.1017/s026988891200001x
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.