{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,6]],"date-time":"2026-09-06T17:26:37Z","timestamp":1788715597234,"version":"build-2803163510"},"reference-count":87,"publisher":"Maximum Academic Press","license":[{"start":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T00:00:00Z","timestamp":1699401600000},"content-version":"unspecified","delay-in-days":311,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["cambridge.org"],"crossmark-restriction":true},"short-container-title":["The Knowledge Engineering Review"],"published-print":{"date-parts":[[2023]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>Automated planning is a prominent area of Artificial Intelligence and an important component for intelligent autonomous agents. A cornerstone of domain-independent planning is the separation between planning logic, that is the automated reasoning side, and the knowledge model, that encodes a formal representation of domain knowledge needed to reason upon a given problem to synthesize a solution plan. Such a separation enables the use of reformulation techniques, which transform how a model is represented in order to improve the efficiency of plan generation. Over the past decades, significant research effort has been devoted to the design of reformulation techniques. In this paper, we present a systematic review of the large body of work on reformulation techniques for classical planning, aiming to provide a holistic view of the field and to foster future research in the area. As a tangible outcome, we provide a qualitative comparison of the existing classes of techniques, that can help researchers gain an overview of their strengths and weaknesses.<\/jats:p>","DOI":"10.1017\/s0269888923000097","type":"journal-article","created":{"date-parts":[[2023,11,8]],"date-time":"2023-11-08T04:09:42Z","timestamp":1699416582000},"update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":3,"title":["Reformulation techniques for automated planning: a\u00a0systematic review"],"prefix":"10.48130","volume":"38","author":[{"given":"Diaeddin","family":"Alarnaouti","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2118-5812","authenticated-orcid":false,"given":"George","family":"Baryannis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8429-3570","authenticated-orcid":false,"given":"Mauro","family":"Vallati","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"27968","published-online":{"date-parts":[[2023,11,8]]},"reference":[{"key":"S0269888923000097_ref5","unstructured":"Armano, G. , Cherchi, G. & Vargiu, E. 2004. Automatic generation of macro-operators from static domain analysis. In Proceedings of the 16th European Conference on Artificial Intelligence, 955\u2013956."},{"key":"S0269888923000097_ref15","doi-asserted-by":"publisher","DOI":"10.5220\/0010305110211029"},{"key":"S0269888923000097_ref87","unstructured":"Younes, H. L. & Littman, M. L. 2004. PPDDL1.0: an extension to PDDL for expressing planning domains with probabilistic effects. Technical Report CMU-CS-04-162, 2, 99."},{"key":"S0269888923000097_ref82","doi-asserted-by":"publisher","DOI":"10.1007\/s10817-021-09592-1"},{"key":"S0269888923000097_ref28","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2018.1509377"},{"key":"S0269888923000097_ref36","doi-asserted-by":"publisher","DOI":"10.1613\/jair.544"},{"key":"S0269888923000097_ref55","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(85)90012-8"},{"key":"S0269888923000097_ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38709-8_17"},{"key":"S0269888923000097_ref19","unstructured":"Chrpa, L. and McCluskey, T. L. 2012. On exploiting structures of classical planning problems: Generalizing entanglements. In ECAI, 240\u2013245."},{"key":"S0269888923000097_ref4","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v24i1.13622"},{"key":"S0269888923000097_ref16","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2010.87"},{"key":"S0269888923000097_ref37","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1129"},{"key":"S0269888923000097_ref71","unstructured":"Riddle, P. , Barley, M. , Franco, S. & Douglas, J. 2015b. Bagged representations in PDDL. In 4th Workshop on the International Planning Competition, 17\u201323."},{"key":"S0269888923000097_ref67","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13593"},{"key":"S0269888923000097_ref53","doi-asserted-by":"publisher","DOI":"10.1017\/S026988891200001X"},{"key":"S0269888923000097_ref77","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2010.07.007"},{"key":"S0269888923000097_ref49","doi-asserted-by":"crossref","unstructured":"Horc\u010dk, R. and Fi\u0161er, D. 2021. Endomorphisms of lifted planning problems. In Proceedings of the International Conference on Automated Planning and Scheduling, 31, 174\u2013183.","DOI":"10.1609\/icaps.v31i1.15960"},{"key":"S0269888923000097_ref9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-06859-6_23"},{"key":"S0269888923000097_ref13","doi-asserted-by":"crossref","unstructured":"Cardellini, M. , Maratea, M. , Vallati, M. , Boleto, G. & Oneto, L. 2021. In-station train dispatching: a PDDL+ planning approach. In Proceedings of the International Conference on Automated Planning and Scheduling, 450\u2013458.","DOI":"10.1609\/icaps.v31i1.15991"},{"key":"S0269888923000097_ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-69886-7_3"},{"key":"S0269888923000097_ref27","unstructured":"Chrpa, L. , Vallati, M. & McCluskey, T. L. 2015b. On the online generation of effective macro-operators. In Twenty-Fourth International Joint Conference on Artificial Intelligence."},{"key":"S0269888923000097_ref31","doi-asserted-by":"crossref","unstructured":"Corr\u00eaa, A. B. , Pommerening, F. , Helmert, M. & Frances, G. 2020. Lifted successor generation using query optimization techniques. In Proceedings of the International Conference on Automated Planning and Scheduling, 30, 80\u201389.","DOI":"10.1609\/icaps.v30i1.6648"},{"key":"S0269888923000097_ref43","volume-title":"Automated Planning: Theory and Practice","author":"Ghallab","year":"2004"},{"key":"S0269888923000097_ref44","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103271"},{"key":"S0269888923000097_ref56","unstructured":"Kov\u00e1cs, D. L. 2012. A multi-agent extension of PDDL3.1. In Proceedings of the 3rd Workshop on the International Planning Competition (IPC), ICAPS-2012, Atibaia, Sao Paulo, Brazil, 19\u201327."},{"key":"S0269888923000097_ref58","unstructured":"McCluskey, T. L. 1987. Combining weak learning heuristics in general problem solvers. In Proceedings of the 10th International Joint Conference on Artificial Intelligence - Volume 1, IJCAI\u201987, San Francisco, CA, USA, 331\u2013333. Morgan Kaufmann Publishers Inc."},{"key":"S0269888923000097_ref61","unstructured":"Minton, S. 1985. Selectively generalizing plans for problem-solving. In IJCAI, 596\u2013599. Citeseer."},{"key":"S0269888923000097_ref62","unstructured":"Newton, M. H. & Levine, J. 2007. Wizard: suggesting macro-actions comprehensively. In Proceedings of the Doctoral Consortium held at ICAPS, 7."},{"key":"S0269888923000097_ref66","doi-asserted-by":"crossref","unstructured":"Percassi, F. , Scala, E. & Vallati, M. 2021. Translations from discretised PDDL+ to numeric planning. In Proceedings of the International Conference on Automated Planning and Scheduling, 31, 252\u2013261.","DOI":"10.1609\/icaps.v31i1.15969"},{"key":"S0269888923000097_ref57","doi-asserted-by":"crossref","unstructured":"Long, D. , Fox, M. & Hamdi, M. 2002. Reformulation in planning. In International Symposium on Abstraction, Reformulation, and Approximation, 18\u201332.","DOI":"10.1007\/3-540-45622-8_2"},{"key":"S0269888923000097_ref6","doi-asserted-by":"crossref","unstructured":"Asai, M. & Fukunaga, A. 2015. Solving large-scale planning problems by decomposition and macro generation. In Proceedings of the International Conference on Automated Planning and Scheduling, 25, 16\u201324.","DOI":"10.1609\/icaps.v25i1.13703"},{"key":"S0269888923000097_ref26","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v24i1.13626"},{"key":"S0269888923000097_ref78","doi-asserted-by":"crossref","unstructured":"Siddiqui, F. H. & Haslum, P. 2012. Block-structured plan deordering. In Australasian Joint Conference on Artificial Intelligence, 803\u2013814.","DOI":"10.1007\/978-3-642-35101-3_68"},{"key":"S0269888923000097_ref21","unstructured":"Chrpa, L. , Scala, E. & Vallati, M. 2015a. Towards a reformulation based approach for efficient numeric planning: numeric outer entanglements. In Eighth Annual Symposium on Combinatorial Search."},{"key":"S0269888923000097_ref81","doi-asserted-by":"crossref","unstructured":"Vallati, M. , Chrpa, L. & McCluskey, T. 2017. Improving a planner\u2019s performance through online heuristic configuration of domain models. In Proceedings of the 10th International Symposium on Combinatorial Search (SoCS 2017), 171\u2013172.","DOI":"10.1609\/socs.v8i1.18412"},{"key":"S0269888923000097_ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2004.1265878"},{"key":"S0269888923000097_ref38","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2044"},{"key":"S0269888923000097_ref84","unstructured":"Vallati, M. , Hutter, F. , Chrpa, L. & McCluskey, T. L. 2015. On the effective configuration of planning domain models. In Twenty-Fourth International Joint Conference on Artificial Intelligence."},{"key":"S0269888923000097_ref86","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v28i1.13869"},{"key":"S0269888923000097_ref70","unstructured":"Riddle, P. , Barley, M. , Franco, S. & Douglas, J. 2015a. Automated transformation of PDDL representations. In International Symposium on Combinatorial Search."},{"key":"S0269888923000097_ref40","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2008.10.012"},{"key":"S0269888923000097_ref69","unstructured":"Riddle, P. , Barley, M. & Franco, S. 2013. Problem reformulation as meta-level search. In Proceedings of the Conference on Advances in Cognitive Systems."},{"key":"S0269888923000097_ref74","unstructured":"Riddle, P. J. , Holte, R. C. & Barley, M. W. 2011. Does representation matter in the planning competition? In Ninth Symposium of Abstraction, Reformulation, and Approximation."},{"key":"S0269888923000097_ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s11761-017-0210-4"},{"key":"S0269888923000097_ref33","first-page":"1","article-title":"On the configuration of more and less expressive logic programs","author":"Dodaro","year":"2022","journal-title":"In Theory and Practice of Logic Programming"},{"key":"S0269888923000097_ref25","unstructured":"Chrpa, L. , Vallati, M. , McCluskey, T. L. and Kitchin, D. 2013. Generating macro-operators by exploiting inner entanglements. In Tenth Symposium of Abstraction, Reformulation, and Approximation."},{"key":"S0269888923000097_ref47","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v27i1.13868"},{"key":"S0269888923000097_ref65","doi-asserted-by":"crossref","unstructured":"Percassi, F. & Gerevini, A. E. 2019. On compiling away PDDL3 soft trajectory constraints without using automata. In Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, ICAPS, 320\u2013328.","DOI":"10.1609\/icaps.v29i1.3494"},{"key":"S0269888923000097_ref46","doi-asserted-by":"publisher","DOI":"10.1613\/jair.855"},{"key":"S0269888923000097_ref20","unstructured":"Chrpa, L. , McCluskey, T. L. & Osborne, H. 2012. Reformulating planning problems: a theoretical point of view. In 25th International Florida Artificial Intelligence Research Society Conference, 14\u201319."},{"key":"S0269888923000097_ref63","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2708"},{"key":"S0269888923000097_ref10","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1530476"},{"key":"S0269888923000097_ref24","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1.13269"},{"key":"S0269888923000097_ref85","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-38561-3"},{"key":"S0269888923000097_ref73","unstructured":"Riddle, P. , Douglas, J. , Barley, M. & Franco, S. 2016. Improving performance by reformulating PDDL into a bagged representation. In Proceedings of the 8th Workshop on Heuristic Search for Domain-independent Planning (HSDIP@ ICAPS), 28\u201336."},{"key":"S0269888923000097_ref32","unstructured":"Dawson, C. & Siklossy, L. 1977. The role of preprocessing in problem solving systems: \u201can ounce of reflection is worth a pound of backtracking\u201d. In Proceedings of the 5th International Joint Conference on Artificial Intelligence-Volume 1, 465\u2013471."},{"key":"S0269888923000097_ref2","unstructured":"Alhossaini, M. & Beck, J. C. 2013. Instance-specific remodelling of planning domains by adding macros and removing operators. In Tenth Symposium of Abstraction, Reformulation, and Approximation."},{"key":"S0269888923000097_ref76","doi-asserted-by":"crossref","unstructured":"Scala, E. 2014. Plan repair for resource constrained tasks via numeric macro actions. In Proceedings of the Twenty-Fourth International Conferenc on International Conference on Automated Planning and Scheduling, ICAPS\u201914, 280\u2013288. AAAI Press. ISBN 9781577356608.","DOI":"10.1609\/icaps.v24i1.13624"},{"key":"S0269888923000097_ref22","unstructured":"Chrpa, L. and Siddiqui, F. H. 2015. Exploiting block deordering for improving planners efficiency. In Twenty-Fourth International Joint Conference on Artificial Intelligence."},{"key":"S0269888923000097_ref3","unstructured":"Amarel, S. 1968. On representations of problems of reasoning about actions. Machine Intelligence."},{"key":"S0269888923000097_ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-22750-0_42"},{"key":"S0269888923000097_ref42","unstructured":"Gerevini, A. & Schubert, L. 1998. Inferring state constraints for domain-independent planning. In Proceedings of the American Artificial Intelligence Conference, AAAI\/IAAI, 905\u2013912."},{"key":"S0269888923000097_ref59","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v27i1.13842"},{"key":"S0269888923000097_ref29","doi-asserted-by":"publisher","DOI":"10.1111\/coin.12203"},{"key":"S0269888923000097_ref54","unstructured":"Kitchenham, B. & Charters, S. 2017. Guidelines for performing systematic literature reviews in software engineering. Technical Report EBSE-2007-01, EBSE Technical Report."},{"key":"S0269888923000097_ref17","doi-asserted-by":"publisher","DOI":"10.1017\/S0269888910000159"},{"key":"S0269888923000097_ref11","doi-asserted-by":"publisher","DOI":"10.3233\/AIC-170537"},{"key":"S0269888923000097_ref45","unstructured":"Haslum, P. & Jonsson, P. 2000. Planning with reduced operator sets. In AIPS, 150\u2013158."},{"key":"S0269888923000097_ref64","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-934613-30-9.50006-8"},{"key":"S0269888923000097_ref68","unstructured":"Ramrez, M. , Papasimeon, M. , Lipovetzky, N. , Benke, L. , Miller, T. , Pearce, A. R. , Scala, E. & Zamani, M. 2018. Integrated hybrid planning and programmed control for real time UAV maneuvering. In Proceedings of AAMAS, 1318\u20131326."},{"key":"S0269888923000097_ref23","doi-asserted-by":"crossref","unstructured":"Chrpa, L. and Vallati, M. 2019. Improving domain-independent planning via critical section macro-operators. In Proceedings of the AAAI Conference on Artificial Intelligence, 7546\u20137553.","DOI":"10.1609\/aaai.v33i01.33017546"},{"key":"S0269888923000097_ref52","doi-asserted-by":"publisher","DOI":"10.1007\/BF00116836"},{"key":"S0269888923000097_ref34","doi-asserted-by":"crossref","unstructured":"Dulac, A. , Pellier, D. , Fiorino, H. & Janiszek, D. 2013. Learning useful macro-actions for planning with n-grams. In 2013 IEEE 25th International Conference on Tools with Artificial Intelligence, 803\u2013810.","DOI":"10.1109\/ICTAI.2013.123"},{"key":"S0269888923000097_ref51","unstructured":"Iba, G. A. 1985. Learning by discovering macros in puzzle solving. In Proceedings of the 9th International Joint Conference on Artificial Intelligence - Volume 1, 640\u2013642."},{"key":"S0269888923000097_ref60","first-page":"35","article-title":"The 1998 AI planning systems competition","volume":"21","author":"McDermott","year":"2000","journal-title":"AI Magazine"},{"key":"S0269888923000097_ref72","unstructured":"Riddle, P. , Barley, M. , Franco, S. & Douglas, J. 2015c. Analysis of bagged representations in PDDL. In Workshop on Heuristics and Search for Domain-independent Planning, 17\u201323."},{"key":"S0269888923000097_ref50","doi-asserted-by":"publisher","DOI":"10.1613\/jair.935"},{"key":"S0269888923000097_ref35","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(71)90010-5"},{"key":"S0269888923000097_ref75","first-page":"27","article-title":"Relational dynamic influence diagram language (rddl): language description","volume":"32","author":"Sanner","year":"2010","journal-title":"Unpublished ms. Australian National University"},{"key":"S0269888923000097_ref12","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1696"},{"key":"S0269888923000097_ref79","doi-asserted-by":"publisher","DOI":"10.1609\/icaps.v23i1.13540"},{"key":"S0269888923000097_ref83","doi-asserted-by":"publisher","DOI":"10.1080\/0952813X.2019.1672796"},{"key":"S0269888923000097_ref18","unstructured":"Chrpa, L. and Bart\u00e1k, R. 2009. Reformulating planning problems by eliminating unpromising actions. In Eighth Symposium on Abstraction, Reformulation, and Approximation."},{"key":"S0269888923000097_ref30","doi-asserted-by":"crossref","unstructured":"Cooper, M. C. , Maris, F. & R\u00e9gnier, P. 2010. Compilation of a high-level temporal planning language into PDDL 2.1. In 2010 22nd IEEE International Conference on Tools with Artificial Intelligence, 181\u2013188.","DOI":"10.1109\/ICTAI.2010.99"},{"key":"S0269888923000097_ref48","unstructured":"Hofmann, T. , Niemueller, T. & Lakemeyer, G. 2020. Macro operator synthesis for adl domains. In ECAI 2020, 761\u2013768. IOS Press."},{"key":"S0269888923000097_ref41","doi-asserted-by":"publisher","DOI":"10.1613\/jair.4359"},{"key":"S0269888923000097_ref80","doi-asserted-by":"publisher","DOI":"10.1109\/ICTAI.2013.12"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888923000097","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:24Z","timestamp":1767624144000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888923000097\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"references-count":87,"alternative-id":["S0269888923000097"],"URL":"https:\/\/doi.org\/10.1017\/s0269888923000097","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"value":"0269-8889","type":"print"},{"value":"1469-8005","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"\u00a9 The Author(s), 2023. Published by Cambridge University Press","name":"copyright","label":"Copyright","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This is an Open Access article, distributed under the terms of the Creative Commons Attribution licence (http:\/\/creativecommons.org\/licenses\/by\/4.0\/), which permits unrestricted re-use, distribution and reproduction, provided the original article is properly cited.","name":"license","label":"License","group":{"name":"copyright_and_licensing","label":"Copyright and Licensing"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}],"article-number":"e9"}}