{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T18:29:06Z","timestamp":1767637746518,"version":"3.48.0"},"reference-count":41,"publisher":"Maximum Academic Press","license":[{"start":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T00:00:00Z","timestamp":1764115200000},"content-version":"unspecified","delay-in-days":329,"URL":"https:\/\/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":[[2025]]},"abstract":"<jats:title>Abstract<\/jats:title>\n                  <jats:p>\n                    Plan repair is the problem of solving a given planning problem by using a solution plan of a similar problem. This paper presents the first approach where the repair has to be done optimally, that is, we aim at finding a minimum distance plan from an input plan; we do so by introducing a number of compilation schemes that convert a classical planning problem into another where optimal plans correspond to plans with the minimum distance from an input plan. We also address the problem of finding a minimum distance plan from a set of input plans, instead of just one plan. Our experiments using a number of planners show that such a simple approach can solve many problems optimally and more effectively than replanning from scratch for a large number of cases. Also, the approach proves competitive with\n                    <jats:inline-formula>\n                      <jats:alternatives>\n                        <jats:inline-graphic xmlns:xlink=\"http:\/\/www.w3.org\/1999\/xlink\" mime-subtype=\"png\" xlink:href=\"S0269888925100076_inline1.png\"\/>\n                        <jats:tex-math>${\\mathsf{LPG}\\textrm{-}\\mathsf{adapt}}$<\/jats:tex-math>\n                      <\/jats:alternatives>\n                    <\/jats:inline-formula>\n                    , a state-of-the-art approach for the plan repair problem.\n                  <\/jats:p>","DOI":"10.1017\/s0269888925100076","type":"journal-article","created":{"date-parts":[[2025,11,26]],"date-time":"2025-11-26T08:29:03Z","timestamp":1764145743000},"update-policy":"https:\/\/doi.org\/10.1017\/policypage","source":"Crossref","is-referenced-by-count":0,"title":["Optimally stable plan repair"],"prefix":"10.48130","volume":"40","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2875-4459","authenticated-orcid":false,"given":"Alessandro","family":"Saetti","sequence":"first","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02q2d2610","id-type":"ROR","asserted-by":"publisher"}],"name":"Universit\u00e0 degli Studi di Brescia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Enrico","family":"Scala","sequence":"additional","affiliation":[{"id":[{"id":"https:\/\/ror.org\/02q2d2610","id-type":"ROR","asserted-by":"publisher"}],"name":"Universit\u00e0 degli Studi di Brescia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"27968","published-online":{"date-parts":[[2025,11,26]]},"reference":[{"key":"S0269888925100076_ref33","doi-asserted-by":"publisher","DOI":"10.1613\/jair.3184"},{"key":"S0269888925100076_ref39","unstructured":"van der Krogt, R. & de Weerdt, M. 2005. Plan repair as an extension of planning. In Proc. of International Conference on Automated Planning and Scheduling (ICAPS-05), 161\u2013170."},{"volume-title":"ICAPS","year":"2014","author":"Scala","key":"S0269888925100076_ref35"},{"key":"S0269888925100076_ref2","first-page":"169","volume-title":"KI 2008: Advances in Artificial Intelligence","author":"Bidot","year":"2008"},{"key":"S0269888925100076_ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2020.103271"},{"key":"S0269888925100076_ref21","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(98)00023-X"},{"key":"S0269888925100076_ref27","doi-asserted-by":"publisher","DOI":"10.1109\/MIS.2008.59"},{"key":"S0269888925100076_ref40","first-page":"429","volume-title":"Proceedings of the Twentieth International Florida Artificial Intelligence Research Society Conference","author":"Warfield","year":"2007"},{"key":"S0269888925100076_ref23","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2857"},{"key":"S0269888925100076_ref11","unstructured":"Garrido, A. , C., G. & Onaindia, E. 2010. Anytime plan-adaptation for continuous planning. In Proc. of P&S Special Interest Group Workshop (PLANSIG-10)."},{"key":"S0269888925100076_ref34","first-page":"316","volume-title":"Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling","author":"Saetti","year":"2022"},{"key":"S0269888925100076_ref20","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2014.11.003"},{"key":"S0269888925100076_ref8","first-page":"13","article-title":"A survey of research in distributed, continual planning","volume":"20","author":"desJardins","year":"1999","journal-title":"AI Magazine"},{"key":"S0269888925100076_ref10","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1129"},{"key":"S0269888925100076_ref31","doi-asserted-by":"publisher","DOI":"10.1613\/jair.2972"},{"key":"S0269888925100076_ref6","doi-asserted-by":"publisher","DOI":"10.1093\/logcom\/exad014"},{"key":"S0269888925100076_ref32","first-page":"345","volume-title":"Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004)","author":"Rintanen","year":"2004"},{"key":"S0269888925100076_ref26","unstructured":"Micheli, A. , et al. 2024. Unified planning framework."},{"key":"S0269888925100076_ref41","first-page":"352","volume-title":"ICAPS","author":"Yoon","year":"2007"},{"volume-title":"Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, ICAPS 2014","year":"2014","author":"Bercher","key":"S0269888925100076_ref1"},{"key":"S0269888925100076_ref37","first-page":"1673","volume-title":"IJCAI","author":"Scala","year":"2015"},{"key":"S0269888925100076_ref22","unstructured":"Katz, M. , Sohrabi, S. , Samulowitz, H. & Sievers, S. 2018. Delfi: Online planner selection for cost-optimal planning. IPC-9 planner abstracts, 57\u201364."},{"key":"S0269888925100076_ref17","doi-asserted-by":"publisher","DOI":"10.1613\/jair.1705"},{"key":"S0269888925100076_ref12","first-page":"119","volume-title":"Case-Based Reasoning Research and Development - 21st International Conference, ICCBR 2013, Saratoga Springs, NY, USA, July 8\u201311, 2013, Proceedings","author":"Gerevini","year":"2013"},{"key":"S0269888925100076_ref25","first-page":"3590","volume-title":"AAAI","author":"Lipovetzky","year":"2017"},{"key":"S0269888925100076_ref38","first-page":"889","volume-title":"AAAI\/IAAI","author":"Smith","year":"1998"},{"key":"S0269888925100076_ref5","first-page":"51","volume-title":"Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, ICAPS 2021","author":"Borrajo","year":"2021"},{"key":"S0269888925100076_ref9","first-page":"212","volume-title":"ICAPS","author":"Fox","year":"2006"},{"key":"S0269888925100076_ref29","first-page":"324","volume-title":"Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling","author":"Percassi","year":"2023"},{"key":"S0269888925100076_ref30","first-page":"1898","volume-title":"ECAI 2023 - 26th European Conference on Artificial Intelligence","author":"Pozanco","year":"2023"},{"key":"S0269888925100076_ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2009.11.001"},{"key":"S0269888925100076_ref15","unstructured":"Goldman, R. P. , Kuter, U. & Freedman, R. G. 2020. Stable plan repair for state-space htn planning. In Proceedings of the ICAPS-20 Workshop on Hierarchical Planning (HPlan 2020), 27\u201335."},{"key":"S0269888925100076_ref19","first-page":"88","volume-title":"KI 2020: Advances in Artificial Intelligence - 43rd German Conference on AI","author":"H\u00f6ller","year":"2020"},{"key":"S0269888925100076_ref28","doi-asserted-by":"publisher","DOI":"10.1016\/0004-3702(94)00082-C"},{"key":"S0269888925100076_ref36","first-page":"783","volume-title":"ECAI","volume":"263","author":"Scala","year":"2014"},{"key":"S0269888925100076_ref24","first-page":"476","volume-title":"Proceedings of the Eighteenth National Conference on Artificial Intelligence and Fourteenth Conference on Innovative Applications of Artificial Intelligence, July 28\u2013August 1, 2002, Edmonton, Alberta, Canada","author":"Koenig","year":"2002"},{"key":"S0269888925100076_ref3","first-page":"183","volume-title":"Artificial Intelligence: Methodology, Systems, and Applications, 10th International Conference","author":"Boella","year":"2002"},{"key":"S0269888925100076_ref18","unstructured":"H\u00f6ller, D. , Bercher, P. , Behnke, G. & Biundo, S. 2018. Htn plan repair using unmodified planning systems. In Proceedings of the 1st ICAPS Workshop on Hierarchical Planning (HPlan), 26\u201330."},{"key":"S0269888925100076_ref13","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2011-399"},{"key":"S0269888925100076_ref14","doi-asserted-by":"publisher","DOI":"10.3233\/FI-2010-309"},{"key":"S0269888925100076_ref7","doi-asserted-by":"publisher","DOI":"10.1016\/S0004-3702(02)00374-0"}],"container-title":["The Knowledge Engineering Review"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0269888925100076","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T14:42:26Z","timestamp":1767624146000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0269888925100076\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":41,"alternative-id":["S0269888925100076"],"URL":"https:\/\/doi.org\/10.1017\/s0269888925100076","relation":{},"ISSN":["0269-8889","1469-8005"],"issn-type":[{"type":"print","value":"0269-8889"},{"type":"electronic","value":"1469-8005"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"\u00a9 The Author(s), 2025. 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 (https:\/\/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":"e7"}}