{"type":"ScholarlyArticle","title":"A Survey on Plan Optimization","authors":[{"name":"Pascal Bercher","slug":"pascal-bercher","given":"Pascal","family":"Bercher","affiliation":"School of Computing , The Australian National University"},{"name":"Patrik Haslum","slug":"patrik-haslum","given":"Patrik","family":"Haslum","affiliation":"School of Computing , The Australian National University"},{"name":"Christian Muise","slug":"christian-muise","given":"Christian","family":"Muise","affiliation":"Queen's University"}],"abstract":"Automated Planning deals with finding a sequence of actions that solves a given (planning) problem. The cost of the solution is a direct consequence of these actions, for example its number or their accumulated costs. Thus, in most applications, cheaper plans are preferred. Yet, finding an optimal solution is more challenging than finding some solution. So, many planning algorithms find some solution and then post-process, i.e., optimize it -- a technique called plan optimization. Over the years many different approaches were developed, not all for the same kind of plans, and not all optimize the same metric. In this comprehensive survey, we give an overview of the existing plan optimization goals, their computational complexity (if known), and existing techniques for such optimizations.","doi":"10.24963/ijcai.2024/879","url":"https://ijcai.org/proceedings/2024/879","pdf":"https://ijcai.org/proceedings/2024/0879.pdf","markdown":"https://ijcai.org/proceedings/2024/879.md","bibtex":"https://ijcai.org/proceedings/2024/bibtex/879","volume":{"slug":"2024","title":"Proceedings of the Thirty-Third International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2024","url":"https://ijcai.org/proceedings/2024/","year":2024,"location":"Jeju, Korea","dates":"3-9 August 2024","editors":"Kate Larson","isbn":"978-1-956792-04-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2024"},"section":"Survey Track","track":"Survey Track","number":879,"pages":{"first":7941,"last":7950},"keywords":["Planning and Scheduling: PS: Other","Planning and Scheduling: PS: Hierarchical planning","Planning and Scheduling: PS: Theoretical foundations of planning","Planning and Scheduling: General"],"videos":[],"references":[{"position":1,"raw":"[Aghighi and Bäckström, 2017] M. Aghighi and C. Bäckström. Plan reordering and parallel execu- tion -a parameterized complexity view. In AAAI 2017, pages 3540-3546. AAAI Press, 2017.","title":"Plan reordering and parallel execution -a parameterized complexity view","authors":"M Aghighi, C Bäckström","year":"2017","venue":"AAAI 2017","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Ambite and Knoblock, 2001] J. L. Ambite and C. A. Knoblock. Planning by rewriting. JAIR, 15(1):207-261, 2001.","title":"Planning by rewriting","authors":"J L Ambite, C A Knoblock","year":"2001","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Babli et al., 2023] M. Babli, Ó. Sapena, and E. Onaindia. Plan commitment: Replanning versus plan repair. EAAI, 123:106275, 2023.","title":"Plan commitment: Replanning versus plan repair","authors":"M Babli, Ó Sapena, E Onaindia","year":"2023","venue":"EAAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Balyo et al., 2012a] T. Balyo, R. Barták, and P. Surynek. On improving plan quality via local enhancements. In SoCS 2012, pages 154-156. AAAI Press, 2012.","title":"On improving plan quality via local enhancements","authors":"Balyo","year":"2012","venue":"SoCS 2012","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Balyo et al., 2012b] T. Balyo, R. Barták, and P. Surynek. Shortening plans by local re-planning. In ICTAI 2012, pages 1022-1028. IEEE Press, 2012.","title":"Shortening plans by local re-planning","authors":"Balyo","year":"2012","venue":"ICTAI 2012","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Balyo et al., 2014] T. Balyo, L. Chrpa, and A. Kilani. On different strategies for eliminating redundant actions from plans. In SoCS 2014, pages 10-18. AAAI Press, 2014.","title":"On different strategies for eliminating redundant actions from plans","authors":"T Balyo, L Chrpa, A Kilani","year":"2014","venue":"SoCS 2014","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Barták et al., 2021] R. Barták, S. Ondrčková, G. Behnke, and P. Bercher. Correcting hierarchical plans by action deletion. In KR 2021, pages 99-109. IJCAI, 2021.","title":"Correcting hierarchical plans by action deletion","authors":"R Barták, S Ondrčková, G Behnke, P Bercher","year":"2021","venue":null,"doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Behnke et al., 2015] G. Behnke, D. Höller, and S. Biundo. On the complexity of HTN plan verification and its impli- cations for plan recognition. In ICAPS 2015, pages 25-33. AAAI Press, 2015.","title":"On the complexity of HTN plan verification and its implications for plan recognition","authors":"G Behnke, D Höller, S Biundo","year":"2015","venue":"ICAPS 2015","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Behnke et al., 2016] G. Behnke, D. Höller, P. Bercher, and S. Biundo. Change the plan -how hard can that be? In ICAPS 2016, pages 38-46. AAAI Press, 2016.","title":"Change the plan -how hard can that be?","authors":"G Behnke, D Höller, P Bercher, S Biundo","year":"2016","venue":"ICAPS 2016","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Bercher and Olz, 2020] P. Bercher and C. Olz. POP ≡ POCL, right? complexity results for partial order (causal link) makespan minimization. In AAAI 2020, pages 9785- 9793. AAAI Press, 2020.","title":"POP ≡ POCL, right? complexity results for partial order (causal link) makespan minimization","authors":"P Bercher, C Olz","year":"2020","venue":"AAAI 2020","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Bercher et al., 2014] P. Bercher, S. Biundo, T. Geier, T. Hörnle, F. Nothdurft, F. Richter, and B. Schattenberg. Plan, repair, execute, explain -how planning helps to as- semble your home theater. In ICAPS 2014, pages 386-394. AAAI Press, 2014.","title":"Plan, repair, execute, explain -how planning helps to assemble your home theater","authors":"P Bercher, S Biundo, T Geier, T Hörnle, F Nothdurft, F Richter, B Schattenberg","year":"2014","venue":"ICAPS 2014","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Bercher et al., 2019] P. Bercher, R. Alford, and D. Höller. A survey on hierarchical planning -one abstract idea, many concrete realizations. In IJCAI 2019, pages 6267-6275. IJCAI, 2019.","title":"A survey on hierarchical planning -one abstract idea, many concrete realizations","authors":"P Bercher, R Alford, D Höller","year":"2019","venue":"IJCAI 2019","doi":null,"url":null,"internal_url":"/proceedings/2019/875"},{"position":13,"raw":"[Bercher, 2021] P. Bercher. A closer look at causal links: Complexity results for delete-relaxation in partial order causal link (POCL) planning. In ICAPS 2021, pages 36- 45. AAAI Press, 2021.","title":"A closer look at causal links: Complexity results for delete-relaxation in partial order causal link (POCL) planning","authors":"P Bercher","year":"2021","venue":"ICAPS 2021","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Blum and Roli, 2003] C. Blum and A. Roli. Metaheuristics in combinatorial optimization: Overview and conceptual comparison. ACM Computing Surveys, 35(3):268-308, 2003.","title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","authors":"C Blum, A Roli","year":"2003","venue":"ACM Computing Surveys","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Borrajo et al., 2015] D. Borrajo, A. Roubíčková, and I. Se- rina. Progress in case-based planning. ACM Computing Surveys, 47(2):1-39, 2015.","title":"Progress in case-based planning","authors":"D Borrajo, A Roubíčková, I Serina","year":"2015","venue":"ACM Computing Surveys","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Bäckström, 1998] C. Bäckström. Computational aspects of reordering plans. JAIR, 9:99-137, 1998.","title":"Computational aspects of reordering plans","authors":"C Bäckström","year":"1998","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Chakraborti et al., 2020] T. Chakraborti, S. Sreedharan, and S. Kambhampati. The emerging landscape of explainable automated planning & decision making. In IJCAI 2020, pages 4803-4811. IJCAI, 2020.","title":"The emerging landscape of explainable automated planning & decision making","authors":"T Chakraborti, S Sreedharan, S Kambhampati","year":"2020","venue":"IJCAI 2020","doi":null,"url":null,"internal_url":"/proceedings/2020/669"},{"position":18,"raw":"[Chrpa et al., 2012a] L. Chrpa, T. L. Mccluskey, and H. Os- borne. Determining redundant actions in sequential plans. In ICTAI 2012, pages 484-491. IEEE Press, 2012.","title":"Determining redundant actions in sequential plans","authors":"Chrpa","year":"2012","venue":"ICTAI 2012","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Chrpa et al., 2012b] L. Chrpa, T. L. McCluskey, and H. Os- borne. Optimizing plans through analysis of action depen- dencies and independencies. In ICAPS 2012, pages 338- 342. AAAI Press, 2012.","title":"Optimizing plans through analysis of action dependencies and independencies","authors":"Chrpa","year":"2012","venue":"ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Davies et al., 2015] T. O. Davies, A. R. Pearce, P. J. Stuckey, and N. Lipovetzky. Sequencing operator counts. In ICAPS 2015, pages 61-69. AAAI Press, 2015.","title":"Sequencing operator counts","authors":"T O Davies, A R Pearce, P J Stuckey, N Lipovetzky","year":"2015","venue":"ICAPS 2015","doi":null,"url":null,"internal_url":"/proceedings/2016/618"},{"position":21,"raw":"[Dean and Boddy, 1988] T. Dean and M. Boddy. Reasoning about partially ordered events. AIJ, 36:375-399, 1988.","title":"Reasoning about partially ordered events","authors":"T Dean, M Boddy","year":"1988","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Do and Kambhampati, 2003] M. B. Do and S. Kambham- pati. Improving the temporal flexibility of position con- strained metric temporal plans. In ICAPS 2003, pages 42- 51. AAAI Press, 2003.","title":"Improving the temporal flexibility of position constrained metric temporal plans","authors":"M B Do, S Kambhampati","year":"2003","venue":"ICAPS 2003","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Erol et al., 1996] K. Erol, J. A. Hendler, and D. S. Nau. Complexity results for HTN planning. AMAI, 18(1):69- 93, 1996.","title":"Complexity results for HTN planning","authors":"K Erol, J A Hendler, D S Nau","year":"1996","venue":"AMAI","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Estrem and Krebsbach, 2012] S. J. Estrem and K. D. Kreb- sbach. AIRS: Anytime iterative refinement of a solution. In FLAIRS 2012, pages 26-31. AAAI Press, 2012.","title":"AIRS: Anytime iterative refinement of a solution","authors":"S J Estrem, K D Krebsbach","year":"2012","venue":"FLAIRS 2012","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Fink and Yang, 1992] E. Fink and Q. Yang. Formalizing plan justifications. In CSCSI 1992, pages 9-14, 1992.","title":"Formalizing plan justifications","authors":"E Fink, Q Yang","year":"1992","venue":"CSCSI 1992","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Fox et al., 2006] M. Fox, A. Gerevini, D. Long, and I. Se- rina. Plan stability: Replanning versus plan repair. In ICAPS 2006, pages 212-221. AAAI Press, 2006.","title":"Plan stability: Replanning versus plan repair","authors":"M Fox, A Gerevini, D Long, I Serina","year":"2006","venue":"ICAPS 2006","doi":null,"url":null,"internal_url":null},{"position":27,"raw":"[Furcy and Koenig, 2005] D. Furcy and S. Koenig. Limited discrepancy beam search. In IJCAI 2005, pages 125-131.","title":"Limited discrepancy beam search","authors":"D Furcy, S Koenig","year":null,"venue":"IJCAI 2005","doi":null,"url":null,"internal_url":"/proceedings/2005/50"},{"position":28,"raw":"Morgan Kaufmann, 2005.","title":null,"authors":"Morgan Kaufmann","year":"2005","venue":null,"doi":null,"url":null,"internal_url":null},{"position":29,"raw":"[Furcy, 2006] D. Furcy. ITSA*: Iterative tunneling search with A*. In Proc. of the 2006 AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications, pages 21-26. AAAI Press, 2006.","title":"ITSA*: Iterative tunneling search with A","authors":"D Furcy","year":"2006","venue":"Proc. of the 2006 AAAI Workshop on Heuristic Search, Memory-Based Heuristics and Their Applications","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Geffner and Bonet, 2013] H. Geffner and B. Bonet. A Con- cise Introduction to Models and Methods for Automated Planning. Morgan & Claypool Publishers, 2013.","title":"A Concise Introduction to Models and Methods for Automated Planning","authors":"H Geffner, B Bonet","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Gerevini and Serina, 2000] A. Gerevini and I. Serina. Fast plan adaptation through planning graphs: Local and sys- tematic search techniques. In AIPS 2000, pages 112-121. AAAI Press, 2000.","title":"Fast plan adaptation through planning graphs: Local and systematic search techniques","authors":"A Gerevini, I Serina","year":"2000","venue":"AIPS 2000","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Ghallab et al., 2004] M. Ghallab, D. S. Nau, and P. Traverso. Automated Planning: Theory and Prac- tice. Morgan Kaufmann, 2004.","title":"Automated Planning: Theory and Practice","authors":"M Ghallab, D S Nau, P Traverso","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":33,"raw":"[Gragera et al., 2023] A. Gragera, R. Fuentetaja, Á. G. Olaya, and F. Fernández. A planning approach to repair domains with incomplete action effects. In ICAPS 2023, pages 153-161. AAAI, 2023.","title":"A planning approach to repair domains with incomplete action effects","authors":"A Gragera, R Fuentetaja, Á G Olaya, F Fernández","year":"2023","venue":"ICAPS 2023","doi":null,"url":null,"internal_url":null},{"position":34,"raw":"[Hansen and Zhou, 2007] E. Hansen and R. Zhou. Anytime heuristic search. JAIR, 28:267-297, 2007.","title":"Anytime heuristic search","authors":"E Hansen, R Zhou","year":"2007","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":35,"raw":"[Harvey and Ginsberg, 1995] W. D. Harvey and M. L. Gins- berg. Limited discrepancy search. In IJCAI 1995, pages 607-615.","title":"Limited discrepancy search","authors":"W D Harvey, M L Ginsberg","year":null,"venue":"IJCAI 1995","doi":null,"url":null,"internal_url":"/proceedings/1995/80"},{"position":36,"raw":"Morgan Kaufmann, 1995.","title":null,"authors":"Morgan Kaufmann","year":"1995","venue":null,"doi":null,"url":null,"internal_url":null},{"position":37,"raw":"[Haslum, 2012] P. Haslum. Incremental lower bounds for additive cost planning problems. In ICAPS 2012, pages 74-82. AAAI Press, 2012.","title":"Incremental lower bounds for additive cost planning problems","authors":"P Haslum","year":"2012","venue":"ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":38,"raw":"[Helmert and Röger, 2008] M. Helmert and G. Röger. How good is almost perfect? In AAAI 2008, pages 944-949. AAAI Press, 2008.","title":"How good is almost perfect?","authors":"M Helmert, G Röger","year":"2008","venue":"AAAI 2008","doi":null,"url":null,"internal_url":null},{"position":39,"raw":"[Höller et al., 2020] D. Höller, P. Bercher, G. Behnke, and S. Biundo. HTN plan repair via model transformation. In KI 2020, pages 88-101. Springer, 2020.","title":"HTN plan repair via model transformation","authors":"D Höller, P Bercher, G Behnke, S Biundo","year":"2020","venue":null,"doi":null,"url":null,"internal_url":null},{"position":40,"raw":"[Kambhampati and Kedar, 1994] S. Kambhampati and S. Kedar. A unified framework for explanation-based gen- eralization of partially ordered and partially instantiated plans. AIJ, 67(1):29-70, 1994.","title":"A unified framework for explanation-based generalization of partially ordered and partially instantiated plans","authors":"S Kambhampati, S Kedar","year":"1994","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":41,"raw":"[Katz and Sohrabi, 2020] M. Katz and S. Sohrabi. Reshap- ing diverse planning. In AAAI 2020, pages 9892-9899. AAAI Press, 2020.","title":"Reshaping diverse planning","authors":"M Katz, S Sohrabi","year":"2020","venue":"AAAI 2020","doi":null,"url":null,"internal_url":null},{"position":42,"raw":"[Kilani and Chrpa, 2013] A. Kilani and L. Chrpa. Post- planning plan optimization: Overview and challenges. In ICAPS Workshop on Knowledge Engineering for Planning and ScheduLing (KEPS), 2013.","title":"Postplanning plan optimization: Overview and challenges","authors":"A Kilani, L Chrpa","year":"2013","venue":"ICAPS Workshop on Knowledge Engineering for Planning and ScheduLing (KEPS)","doi":null,"url":null,"internal_url":null},{"position":43,"raw":"A. H. Land and A. G. Doig. An auto- matic method of solving discrete programming problems. Econometrica, 28(3):497-520, 1960.","title":"An automatic method of solving discrete programming problems","authors":"A H Land, A G Doig","year":"1960","venue":"Econometrica","doi":null,"url":null,"internal_url":null},{"position":44,"raw":"[Lin and Bercher, 2021] S. Lin and P. Bercher. Change the world -how hard can that be? On the computational com- plexity of fixing planning models. In IJCAI 2021, pages 4152-4159. IJCAI, 2021.","title":"Change the world -how hard can that be? On the computational complexity of fixing planning models","authors":"S Lin, P Bercher","year":"2021","venue":"IJCAI 2021","doi":null,"url":null,"internal_url":"/proceedings/2021/571"},{"position":45,"raw":"[Lin and Bercher, 2023] S. Lin and P. Bercher. Was fixing this Really that hard? On the complexity of correcting HTN domains. In AAAI 2023, pages 12032-12040. AAAI Press, 2023.","title":"Was fixing this Really that hard? On the complexity of correcting HTN domains","authors":"S Lin, P Bercher","year":"2023","venue":"AAAI 2023","doi":null,"url":null,"internal_url":null},{"position":46,"raw":"[Lin et al., 2023] S. Lin, A. Grastien, and P. Bercher. To- wards automated modeling assistance: An efficient ap- proach for repairing flawed planning domains. In AAAI 2023, pages 12022-12031. AAAI Press, 2023.","title":"Towards automated modeling assistance: An efficient approach for repairing flawed planning domains","authors":"S Lin, A Grastien, P Bercher","year":"2023","venue":"AAAI 2023","doi":null,"url":null,"internal_url":null},{"position":47,"raw":"[Lin et al., 2024] S. Lin, C. Olz, M. Helmert, and P. Bercher. On the computational complexity of plan verification, (bounded) plan-optimality verification, and bounded plan existence. In AAAI 2024, pages 20203-20211. AAAI Press, 2024.","title":"On the computational complexity of plan verification, (bounded) plan-optimality verification, and bounded plan existence","authors":"S Lin, C Olz, M Helmert, P Bercher","year":"2024","venue":"AAAI 2024","doi":null,"url":null,"internal_url":null},{"position":48,"raw":"[Lindner and Olz, 2022] F. Lindner and C. Olz. Step-by-step task plan explanations beyond causal links. In RO-MAN 2022, pages 45-51. IEEE, 2022.","title":"Step-by-step task plan explanations beyond causal links","authors":"F Lindner, C Olz","year":"2022","venue":"RO-MAN 2022","doi":null,"url":null,"internal_url":null},{"position":49,"raw":"[McCluskey et al., 2002] T. L. McCluskey, N. E. Richard- son, and R. M. Simpson. An interactive method for induc- ing operator descriptions. In AIPS 2002, pages 121-130. AAAI Press, 2002. [Med and Chrpa, 2022]","title":"An interactive method for inducing operator descriptions","authors":"T L Mccluskey, N E Richardson, R M Simpson","year":"2002","venue":"AIPS 2002","doi":null,"url":null,"internal_url":null},{"position":50,"raw":"J. Med and L. Chrpa. On speeding up methods for identifying redundant actions in plans. In ICAPS 2022, pages 252-260. AAAI Press, 2022.","title":"On speeding up methods for identifying redundant actions in plans","authors":"J Med, L Chrpa","year":"2022","venue":"ICAPS 2022","doi":null,"url":null,"internal_url":null},{"position":51,"raw":"[Miller, 2019] T. Miller. Explanation in artificial intelli- gence: Insights from the social sciences. AIJ, 267:1-38, 2019.","title":"Explanation in artificial intelligence: Insights from the social sciences","authors":"T Miller","year":"2019","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":52,"raw":"[Muise and Lipovetzky, 2016] C. Muise and N. Lipovetzky. The first unsolvability international planning competition. http://unsolve-ipc.eng.unimelb.edu.au/, 2016.","title":"The first unsolvability international planning competition","authors":"C Muise, N Lipovetzky","year":null,"venue":null,"doi":null,"url":"http://unsolve-ipc.eng.unimelb.edu.au/,2016","internal_url":null},{"position":53,"raw":"[Muise et al., 2011] C. Muise, S. A. McIlraith, and J. C. Beck. Monitoring the execution of partial-order plans via regression. In IJCAI 2011, pages 1975-1982. AAAI Press, 2011.","title":"Monitoring the execution of partial-order plans via regression","authors":"C Muise, S A Mcilraith, J C Beck","year":"2011","venue":"IJCAI 2011","doi":null,"url":null,"internal_url":"/proceedings/2011/330"},{"position":54,"raw":"[Muise et al., 2012] C. Muise, S. A. McIlraith, and J. C. Beck. Optimally relaxing partial-order plans with MaxSAT. In ICAPS 2012, pages 358-362. AAAI Press, 2012.","title":"Optimally relaxing partial-order plans with MaxSAT","authors":"C Muise, S A Mcilraith, J C Beck","year":"2012","venue":"ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":55,"raw":"[Muise et al., 2016] C. Muise, J. C. Beck, and S. A. McIl- raith. Optimal partial-order plan relaxation via MaxSAT. JAIR, 57:113-149, 2016.","title":"Optimal partial-order plan relaxation via MaxSAT","authors":"C Muise, J C Beck, S A Mcilraith","year":"2016","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":56,"raw":"[Nakhost and Müller, 2010a] H. Nakhost and M. Müller. Ac- tion elimination and plan neighborhood graph search: Two algorithms for plan improvement. In ICAPS 2010, pages 121-128. AAAI Press, 2010.","title":"Action elimination and plan neighborhood graph search: Two algorithms for plan improvement","authors":"Müller Nakhost, H Nakhost, M Müller","year":"2010","venue":"ICAPS 2010","doi":null,"url":null,"internal_url":null},{"position":57,"raw":"[Nakhost and Müller, 2010b] H. Nakhost and M. Müller. Action elimination and plan neighborhood graph search: Two algorithms for plan improvement -extended version. Technical Report 10-01, Department of Computing Sci- ence, University of Alberta, 2010.","title":"Action elimination and plan neighborhood graph search: Two algorithms for plan improvement -extended version","authors":"Müller Nakhost, H Nakhost, M Müller","year":"2010","venue":null,"doi":null,"url":null,"internal_url":null},{"position":58,"raw":"[Nebel and Bäckström, 1994] B. Nebel and C. Bäckström. On the computational complexity of temporal projection, planning, and plan validation. AIJ, 66(1):125-160, 1994.","title":"On the computational complexity of temporal projection, planning, and plan validation","authors":"B Nebel, C Bäckström","year":"1994","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":59,"raw":"[Nebel and Köhler, 1995] B. Nebel and J. Köhler. Plan reuse versus plan generation: a theoretical and empirical analy- sis. AIJ, 76(1-2):427-454, 1995.","title":"Plan reuse versus plan generation: a theoretical and empirical analysis","authors":"B Nebel, J Köhler","year":"1995","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":60,"raw":"[Nguyen et al., 2012] T. A. Nguyen, M. B. Do, A. Gerevini, I. Serina, B. Srivastava, and S. Kambhampati. Generating diverse plans to handle unknown and partially known user preferences. AIJ, 190:1-31, 2012.","title":"Generating diverse plans to handle unknown and partially known user preferences","authors":"T A Nguyen, M B Do, A Gerevini, I Serina, B Srivastava, S Kambhampati","year":"2012","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":61,"raw":"[Olz and Bercher, 2019] C. Olz and P. Bercher. Eliminating redundant actions in partially ordered plans -a complexity analysis. In ICAPS 2019, pages 310-319. AAAI Press, 2019.","title":"Eliminating redundant actions in partially ordered plans -a complexity analysis","authors":"C Olz, P Bercher","year":"2019","venue":"ICAPS 2019","doi":null,"url":null,"internal_url":null},{"position":62,"raw":"[Pohl, 1970] I. Pohl. Heuristic search viewed as path finding in a graph. AIJ, 1(3):193-204, 1970.","title":"Heuristic search viewed as path finding in a graph","authors":"I Pohl","year":"1970","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":63,"raw":"[Ratner and Pohl, 1986] D. Ratner and I. Pohl. Joint and LPA*: Combination of approximation and search. In AAAI 1986, pages 173-177.","title":"Joint and LPA*: Combination of approximation and search","authors":"D Ratner, I Pohl","year":null,"venue":"AAAI 1986","doi":null,"url":null,"internal_url":null},{"position":64,"raw":"[Morgan Kaufmann, 1986. Richter et al., 2010] S. Richter, J. Thayer, and W. Ruml. The joy of forgetting: Faster anytime search via restarting. In ICAPS 2010, pages 137-144. AAAI Press, 2010.","title":"The joy of forgetting: Faster anytime search via restarting","authors":"S Richter, J Thayer, W Ruml","year":"2010","venue":"ICAPS 2010","doi":null,"url":null,"internal_url":null},{"position":65,"raw":"[Salerno et al., 2023] M. Salerno, R. Fuentetaja, and J. Seipp. Eliminating redundant actions from plans using classical planning. In KR 2023, pages 774-778. IJCAI, 2023.","title":"Eliminating redundant actions from plans using classical planning","authors":"M Salerno, R Fuentetaja, J Seipp","year":"2023","venue":null,"doi":null,"url":null,"internal_url":null},{"position":66,"raw":"[Say et al., 2016] B. Say, A. A. Cire, and J. C. Beck. Mathe- matical programming models for optimizing partial-order plan flexibility. In ECAI 2016, pages 1044-1052. IOS Press, 2016.","title":"Mathematical programming models for optimizing partial-order plan flexibility","authors":"B Say, A A Cire, J C Beck","year":"2016","venue":"ECAI 2016","doi":null,"url":null,"internal_url":null},{"position":67,"raw":"[Scala and Torasso, 2015] E. Scala and P. Torasso. Deorder- ing and numeric macro actions for plan repair. In IJCAI 2015, pages 1673-1681. AAAI Press, 2015.","title":"Deordering and numeric macro actions for plan repair","authors":"E Scala, P Torasso","year":"2015","venue":"IJCAI 2015","doi":null,"url":null,"internal_url":"/proceedings/2015/239"},{"position":68,"raw":"[Seipp and Helmert, 2013] J. Seipp and M. Helmert. Counterexample-guided cartesian abstraction refinement. In ICAPS 2013, pages 347-351. AAAI Press, 2013.","title":"Counterexample-guided cartesian abstraction refinement","authors":"J Seipp, M Helmert","year":"2013","venue":"ICAPS 2013","doi":null,"url":null,"internal_url":null},{"position":69,"raw":"[Shaw, 1998] P. Shaw. Using constraint programming and local search methods to solve vehicle routing problems. In CP 1998, pages 417-431. Springer, 1998.","title":"Using constraint programming and local search methods to solve vehicle routing problems","authors":"P Shaw","year":"1998","venue":"CP 1998","doi":null,"url":null,"internal_url":null},{"position":70,"raw":"[Siddiqui and Haslum, 2012] F. H. Siddiqui and P. Haslum. Block-structured plan deordering. In AJCAI 2012, pages 803-814. Springer, 2012.","title":"Block-structured plan deordering","authors":"F H Siddiqui, P Haslum","year":"2012","venue":"AJCAI 2012","doi":null,"url":null,"internal_url":null},{"position":71,"raw":"[Siddiqui and Haslum, 2013] F. H. Siddiqui and P. Haslum. Plan quality optimisation via block decomposition. In IJ- CAI 2013, pages 2387-2393. AAAI Press, 2013.","title":"Plan quality optimisation via block decomposition","authors":"F H Siddiqui, P Haslum","year":"2013","venue":"IJ-CAI 2013","doi":null,"url":null,"internal_url":"/proceedings/2013/351"},{"position":72,"raw":"[Siddiqui and Haslum, 2015] F. H. Siddiqui and P. Haslum. Continuing plan quality optimisation. JAIR, 54:369-435, 2015.","title":"Continuing plan quality optimisation","authors":"F H Siddiqui, P Haslum","year":"2015","venue":"JAIR","doi":null,"url":null,"internal_url":null},{"position":73,"raw":"[Sreedharan et al., 2021] S. Sreedharan, T. Chakraborti, and S. Kambhampati. Foundations of explanations as model reconciliation. AIJ, 301:103558, 2021.","title":"Foundations of explanations as model reconciliation","authors":"S Sreedharan, T Chakraborti, S Kambhampati","year":"2021","venue":"AIJ","doi":null,"url":null,"internal_url":null},{"position":74,"raw":"[Sreedharan et al., 2022] S. Sreedharan, P. Bercher, and S. Kambhampati. On the computational complexity of model reconciliations. In IJCAI 2022, pages 4657-4664. IJCAI, 2022.","title":"On the computational complexity of model reconciliations","authors":"S Sreedharan, P Bercher, S Kambhampati","year":"2022","venue":"IJCAI 2022","doi":null,"url":null,"internal_url":"/proceedings/2022/646"},{"position":75,"raw":"[Sreedharan et al., 2023] S. Sreedharan, C. Muise, and S. Kambhampati. Generalizing action justification and causal links to policies. In ICAPS 2023, pages 417-426. AAAI Press, 2023.","title":"Generalizing action justification and causal links to policies","authors":"S Sreedharan, C Muise, S Kambhampati","year":"2023","venue":"ICAPS 2023","doi":null,"url":null,"internal_url":null},{"position":76,"raw":"[Srivastava et al., 2007] B. Srivastava, T. A. Nguyen, A. Gerevini, S. Kambhampati, M. B. Do, and I. Serina. Domain independent approaches for finding diverse plans. In IJCAI 2007, pages 2016-2022. AAAI Press, 2007.","title":"Domain independent approaches for finding diverse plans","authors":"B Srivastava, T A Nguyen, A Gerevini, S Kambhampati, M B Do, I Serina","year":"2007","venue":"IJCAI 2007","doi":null,"url":null,"internal_url":"/proceedings/2007/325"},{"position":77,"raw":"[Stern et al., 2011] R. Stern, R. Puzis, and A. Felner. Potential-search: A bounded-cost search algorithm. In ICAPS 2011, pages 234-241. AAAI Press, 2011.","title":"Potential-search: A bounded-cost search algorithm","authors":"R Stern, R Puzis, A Felner","year":"2011","venue":"ICAPS 2011","doi":null,"url":null,"internal_url":null},{"position":78,"raw":"[Thayer et al., 2012] J. Thayer, R. Stern, A. Felner, and W. Ruml. Faster bounded-cost search using inadmissible heuristics. In ICAPS 2012, pages 270-278. AAAI Press, 2012.","title":"Faster bounded-cost search using inadmissible heuristics","authors":"J Thayer, R Stern, A Felner, W Ruml","year":"2012","venue":"ICAPS 2012","doi":null,"url":null,"internal_url":null},{"position":79,"raw":"[Waters et al., 2018] M. Waters, B. Nebel, L. Padgham, and S. Sardina. Plan relaxation via action debinding and de- ordering. In ICAPS 2018, pages 278-287. AAAI Press, 2018.","title":"Plan relaxation via action debinding and deordering","authors":"M Waters, B Nebel, L Padgham, S Sardina","year":"2018","venue":"ICAPS 2018","doi":null,"url":null,"internal_url":null},{"position":80,"raw":"[Waters et al., 2020] M. Waters, L. Padgham, and S. Sardina. Optimising partial-order plans via action reinstantiation. In IJCAI 2020, pages 4143-4151. IJCAI, 2020.","title":"Optimising partial-order plans via action reinstantiation","authors":"M Waters, L Padgham, S Sardina","year":"2020","venue":"IJCAI 2020","doi":null,"url":null,"internal_url":"/proceedings/2020/573"},{"position":81,"raw":"[Westerberg and Levine, 2001] C. H. Westerberg and J. Levine. Optimising plans using genetic programming. In ECP 2001, pages 272-274. AAAI Press, 2001.","title":"Optimising plans using genetic programming","authors":"C H Westerberg, J Levine","year":"2001","venue":"ECP 2001","doi":null,"url":null,"internal_url":null},{"position":82,"raw":"[Zhou and Hansen, 2005] R. Zhou and E. A. Hansen. Beam- stack search: Integrating backtracking with beam search. In ICAPS 2005, pages 90-98. AAAI Press, 2005.","title":"Beamstack search: Integrating backtracking with beam search","authors":"R Zhou, E A Hansen","year":"2005","venue":"ICAPS 2005","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}