{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,11]],"date-time":"2025-03-11T04:15:59Z","timestamp":1741666559759,"version":"3.38.0"},"reference-count":32,"publisher":"SAGE Publications","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["AIC"],"published-print":{"date-parts":[[2015,8,12]]},"DOI":"10.3233\/aic-150679","type":"journal-article","created":{"date-parts":[[2015,12,29]],"date-time":"2015-12-29T14:19:46Z","timestamp":1451398786000},"page":"163-183","source":"Crossref","is-referenced-by-count":0,"title":["On the completeness of replacing primitive\u00a0actions with macro-actions and its\u00a0generalization to planning operators and macro-operators"],"prefix":"10.1177","volume":"29","author":[{"given":"Luk\u00e1\u0161","family":"Chrpa","sequence":"first","affiliation":[{"name":"PARK Research Group, School of Computing and Engineering, University of Huddersfield, Huddersfield, UK. E-mails:\u00a0l.chrpa@hud.ac.uk,\u00a0t.l.mccluskey@hud.ac.uk,\u00a0h.r.osborne@hud.ac.uk"}]},{"given":"Thomas Leo","family":"McCluskey","sequence":"additional","affiliation":[{"name":"PARK Research Group, School of Computing and Engineering, University of Huddersfield, Huddersfield, UK. E-mails:\u00a0l.chrpa@hud.ac.uk,\u00a0t.l.mccluskey@hud.ac.uk,\u00a0h.r.osborne@hud.ac.uk"}]},{"given":"Hugh","family":"Osborne","sequence":"additional","affiliation":[{"name":"PARK Research Group, School of Computing and Engineering, University of Huddersfield, Huddersfield, UK. E-mails:\u00a0l.chrpa@hud.ac.uk,\u00a0t.l.mccluskey@hud.ac.uk,\u00a0h.r.osborne@hud.ac.uk"}]}],"member":"179","reference":[{"key":"10.3233\/AIC-150679_ref1","unstructured":"[1]M.A.\u00a0Alhossaini and J.C.\u00a0Beck, Instance-specific remodelling of planning domains by adding macros and removing operators, in: Proceedings of SARA, 2013, pp.\u00a016\u201324."},{"key":"10.3233\/AIC-150679_ref2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1613\/jair.3534","article-title":"Algorithms and limits for compact plan representations","volume":"44","author":"B\u00e4ckstr\u00f6m","year":"2012","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"1,2","key":"10.3233\/AIC-150679_ref3","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1016\/S0004-3702(96)00047-1","article-title":"Fast planning through planning graph analysis","volume":"90","author":"Blum","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150679_ref4","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/S0004-3702(01)00108-4","article-title":"Planning as heuristic search","volume":"129","author":"Bonet","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150679_ref5","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1613\/jair.1696","article-title":"Macro-FF: Improving AI planning with automatically learned macro-operators","volume":"24","author":"Botea","year":"2005","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150679_ref6","doi-asserted-by":"crossref","first-page":"165","DOI":"10.1016\/0004-3702(94)90081-7","article-title":"The computational complexity of propositional STRIPS planning","volume":"69","author":"Bylander","year":"1994","journal-title":"Artificial Intelligence"},{"issue":"3","key":"10.3233\/AIC-150679_ref7","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1017\/S0269888910000159","article-title":"Generation of macro-operators via investigation of action dependencies in plans","volume":"25","author":"Chrpa","year":"2010","journal-title":"Knowledge Engineering Review"},{"key":"10.3233\/AIC-150679_ref8","unstructured":"[8]L.\u00a0Chrpa, Theoretical aspects of using learning techniques for problem reformulation in classical planning, in: Proceedings of PlanSIG, 2011, pp.\u00a023\u201330."},{"key":"10.3233\/AIC-150679_ref9","unstructured":"[9]L.\u00a0Chrpa and R.\u00a0Bart\u00e1k, Reformulating planning problems by eliminating unpromising actions, in: Proceedings of SARA, 2009, pp.\u00a050\u201357."},{"key":"10.3233\/AIC-150679_ref10","unstructured":"[10]L.\u00a0Chrpa, T.L.\u00a0McCluskey and H.\u00a0Osborne, Reformulating planning problems: A theoretical point of view, in: Proceedings of FLAIRS, 2012, pp.\u00a014\u201319."},{"key":"10.3233\/AIC-150679_ref11","unstructured":"[11]L.\u00a0Chrpa, M.\u00a0Vallati and T.L.\u00a0McCluskey, Determining linearity of optimal plans by operator schema analysis, in: Proceedings of SARA, 2013, pp.\u00a034\u201341."},{"key":"10.3233\/AIC-150679_ref12","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1613\/jair.2077","article-title":"Marvin: A heuristic search planner with online macro-action learning","volume":"28","author":"Coles","year":"2007","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150679_ref13","unstructured":"[13]C.\u00a0Dawson and L.\u00a0Sikl\u00f3ssy, The role of preprocessing in problem solving systems, in: Proceedings of IJCAI, 1977, pp.\u00a0465\u2013471."},{"key":"10.3233\/AIC-150679_ref14","unstructured":"[14]F.\u00a0Dvo\u0159\u00e1k, D.\u00a0Toropila and R.\u00a0Bart\u00e1k, Towards AI planning efficiency: Finite-domain state variable reformulation, in: Proceedings of SARA, 2013, pp.\u00a050\u201356."},{"issue":"3,4","key":"10.3233\/AIC-150679_ref15","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0004-3702(71)90010-5","article-title":"STRIPS: a new approach to the application of theorem proving to problem solving","volume":"2","author":"Fikes","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150679_ref17","doi-asserted-by":"crossref","unstructured":"[17]M.\u00a0Ghallab, D.\u00a0Nau and P.\u00a0Traverso, Automated Planning: Theory and Practice, Morgan Kaufmann, 2004.","DOI":"10.1016\/B978-155860856-6\/50021-1"},{"key":"10.3233\/AIC-150679_ref18","unstructured":"[18]P.\u00a0Haslum, Reducing accidental complexity in planning problems, in: Proceedings of IJCAI, 2007, pp.\u00a01898\u20131903."},{"key":"10.3233\/AIC-150679_ref19","doi-asserted-by":"crossref","unstructured":"[19]P.\u00a0Haslum, M.\u00a0Helmert and A.\u00a0Jonsson, Safe, strong, and tractable relevance analysis for planning, in: Proceedings of ICAPS, 2013, pp.\u00a0317\u2013321.","DOI":"10.1609\/icaps.v23i1.13601"},{"key":"10.3233\/AIC-150679_ref20","unstructured":"[20]P.\u00a0Haslum and P.\u00a0Jonsson, Planning with reduced operator sets, in: Proceedings of AIPS, 2000, pp.\u00a0150\u2013158."},{"issue":"2","key":"10.3233\/AIC-150679_ref21","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/S0004-3702(02)00364-8","article-title":"Complexity results for standard benchmark domains in planning","volume":"143","author":"Helmert","year":"2003","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150679_ref22","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1613\/jair.1705","article-title":"The fast downward planning system","volume":"26","author":"Helmert","year":"2006","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150679_ref23","doi-asserted-by":"crossref","unstructured":"[23]M.\u00a0Helmert and C.\u00a0Domshlak, Landmarks, critical paths and abstractions: What\u2019s the difference anyway? in: Proceedings of ICAPS, 2009, pp.\u00a0162\u2013169.","DOI":"10.1609\/icaps.v19i1.13370"},{"key":"10.3233\/AIC-150679_ref24","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1613\/jair.3276","article-title":"Analyzing search topology without running any search: On the connection between causal graphs and h +","volume":"41","author":"Hoffmann","year":"2011","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150679_ref25","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1613\/jair.855","article-title":"The FF planning system: Fast plan generation through heuristic search","volume":"14","author":"Hoffmann","year":"2001","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"key":"10.3233\/AIC-150679_ref26","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1613\/jair.2891","article-title":"The role of macros in tractable planning","volume":"36","author":"Jonsson","year":"2009","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"1","key":"10.3233\/AIC-150679_ref27","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0004-3702(85)90012-8","article-title":"Macro-operators: A weak method for learning","volume":"26","author":"Korf","year":"1985","journal-title":"Artificial Intelligence"},{"issue":"1","key":"10.3233\/AIC-150679_ref28","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0004-3702(97)00034-9","article-title":"Engineering and compiling planning domain models to promote validity and efficiency","volume":"95","author":"McCluskey","year":"1997","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150679_ref29","doi-asserted-by":"crossref","unstructured":"[29]K.\u00a0Mehlhorn, Data Structures and Algorithms 2: Graph Algorithms and NP-Completeness, Springer, 1984.","DOI":"10.1007\/978-3-642-69897-2"},{"key":"10.3233\/AIC-150679_ref30","doi-asserted-by":"crossref","unstructured":"[30]M.A.H.\u00a0Newton, J.\u00a0Levine, M.\u00a0Fox and D.\u00a0Long, Learning macro-actions for arbitrary planners and domains, in: Proceedings of ICAPS, 2007, pp.\u00a0256\u2013263.","DOI":"10.1017\/S0261444807004387"},{"key":"10.3233\/AIC-150679_ref31","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1613\/jair.2972","article-title":"The LAMA planner: Guiding cost-based anytime planning with landmarks","volume":"39","author":"Richter","year":"2010","journal-title":"Journal of Artificial Intelligence Research (JAIR)"},{"issue":"1,2","key":"10.3233\/AIC-150679_ref33","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/S0004-3702(00)00079-5","article-title":"Blocks world revisited","volume":"125","author":"Slaney","year":"2001","journal-title":"Artificial Intelligence"},{"key":"10.3233\/AIC-150679_ref34","unstructured":"[34]G.\u00a0Wickler, Using planning domain features to facilitate knowledge engineering, in: Workshop of Knowledge Engineering for Planning and Scheduling (KEPS), 2011."}],"container-title":["AI Communications"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/AIC-150679","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,10]],"date-time":"2025-03-10T13:48:45Z","timestamp":1741614525000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/AIC-150679"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,12]]},"references-count":32,"journal-issue":{"issue":"1"},"URL":"https:\/\/doi.org\/10.3233\/aic-150679","relation":{},"ISSN":["1875-8452","0921-7126"],"issn-type":[{"type":"electronic","value":"1875-8452"},{"type":"print","value":"0921-7126"}],"subject":[],"published":{"date-parts":[[2015,8,12]]}}}