{"type":"ScholarlyArticle","title":"Optimising Partial-Order Plans Via Action Reinstantiation","authors":[{"name":"Max Waters","slug":"max-waters","given":"Max","family":"Waters","affiliation":"RMIT University , Melbourne , Victoria 3000 , Australia"},{"name":"Lin Padgham","slug":"lin-padgham","given":"Lin","family":"Padgham","affiliation":"RMIT University , Melbourne , Victoria 3000 , Australia"},{"name":"Sebastian Sardina","slug":"sebastian-sardina","given":"Sebastian","family":"Sardina","affiliation":"RMIT University , Melbourne , Victoria 3000 , Australia"}],"abstract":"This work investigates the problem of optimising a partial-order plan’s (POP) flexibility through the simultaneous transformation of its action ordering and variable binding constraints. While the former has been extensively studied through the notions of deordering and reordering, the latter has received much less attention. We show that a plan’s variable bindings are often related to resource usage and their reinstantiation can yield more flexible plans. To do so, we extend existing POP optimality criteria to support variable reinstantiation, and prove that checking if a plan can be optimised further is NP-complete. We also propose a MaxSAT-based technique for increasing plan flexibility and provide a thorough experimental evaluation that suggests that there are benefits in action reinstantiation.","doi":"10.24963/ijcai.2020/573","url":"https://ijcai.org/proceedings/2020/573","pdf":"https://ijcai.org/proceedings/2020/0573.pdf","markdown":"https://ijcai.org/proceedings/2020/573.md","bibtex":"https://ijcai.org/proceedings/2020/bibtex/573","volume":{"slug":"2020","title":"Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2020","url":"https://ijcai.org/proceedings/2020/","year":2020,"location":"Yokohama","dates":"January 2021 (postponed from 11-17 July 2020)","editors":"Christian Bessiere","isbn":"978-0-9992411-6-5","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2020"},"section":"Planning and Scheduling","track":"Main track","number":573,"pages":{"first":4143,"last":4151},"keywords":["Planning and Scheduling: Planning and Scheduling"],"videos":[{"label":"Video","url":"https://videos.ijcai20.org/24169/file_24169.m3u8","length_sec":297,"provider":"hls"}],"references":[{"position":1,"raw":"[Aghighi and Bäckström, 2017] Meysam Aghighi and Christer Bäckström. Plan reordering and parallel execu- tion -A parameterized complexity view. In Proc. of AAAI, pages 3540-3546, 2017.","title":"Plan reordering and parallel execution -A parameterized complexity view","authors":"Bäckström Aghighi, Meysam Aghighi, Christer Bäckström","year":"2017","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bäckström, 1998] Christer Bäckström. Computational as- pects of reordering plans. Journal of Artificial Intelligence Research, 9:99-137, 1998.","title":"Computational aspects of reordering plans","authors":"Christer Bäckström, Bäckström","year":"1998","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Bercher and Olz, 2020] Pascal Bercher and Conny Olz. POP ≡ POCL, right? Complexity results for partial order (causal link) makespan minimization. In Proc. of AAAI, 2020.","title":"POP ≡ POCL, right? Complexity results for partial order (causal link) makespan minimization","authors":"Pascal Bercher, Conny Olz","year":"2020","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Berg et al., 2019] Jeremias Berg, Emir Demirovic, and Pe- ter J. Stuckey. Core-boosted linear search for incomplete MaxSAT. In Proc. of the 16th International Conference on the Integration of Constraint Programming, AI, and Oper- ations Research, pages 39-56, 2019.","title":"Core-boosted linear search for incomplete MaxSAT","authors":"Jeremias Berg, Emir Demirovic, Peter J Stuckey","year":"2019","venue":"Proc. of the 16th International Conference on the Integration of Constraint Programming, AI, and Operations Research","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Brachman and Levesque, 2004] Ronald Brachman and Hector Levesque. Knowledge Representation and Reasoning. Morgan Kaufmann Publishers, USA, 2004.","title":"Knowledge Representation and Reasoning","authors":"Levesque Brachman, Ronald Brachman, Hector Levesque","year":"2004","venue":null,"doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Fox and Long, 1999] Maria Fox and Derek Long. The de- tection and exploitation of symmetry in planning prob- lems. In Proc. of IJCAI, pages 956-961, 1999.","title":"The detection and exploitation of symmetry in planning problems","authors":"Maria Fox, Derek Long","year":"1999","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":"/proceedings/1999/136"},{"position":7,"raw":"[Joslin and Roy, 1997] David Joslin and Amitabha Roy. Ex- ploiting symmetry in lifted CSPs. In Proc.of AAAI, page 197-202, 1997.","title":"Exploiting symmetry in lifted CSPs","authors":"Roy ; Joslin, David Joslin, Amitabha Roy","year":"1997","venue":"Proc.of AAAI","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Kambhampati and Kedar, 1994] Subbarao Kambhampati and Smadar Kedar. A unified framework for explanation- based generalization of partially ordered and partially instantiated plans. Artificial Intelligence, 67(1):29-70, 1994.","title":"A unified framework for explanationbased generalization of partially ordered and partially instantiated plans","authors":"Subbarao Kambhampati, Smadar Kedar","year":"1994","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Kambhampati and Nau, 1996] Subbarao Kambhampati and Dana S. Nau. On the nature and role of modal truth criteria in planning. Artifical Intelligence, 82(1-2):129-155, 1996.","title":"On the nature and role of modal truth criteria in planning","authors":"Subbarao Kambhampati, Dana S Nau","year":"1996","venue":"Artifical Intelligence","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Korhonen et al., 2017] Tuukka Korhonen, Jeremias Berg, Paul Saikko, and Matti Järvisalo. MaxPre: An extended MaxSAT preprocessor. In Proc. of the 20th Int. Confer- ence on Theory and Applications of Satisfiability Testing, volume 10491 of LNCS, pages 449-456. Springer, 2017.","title":"MaxPre: An extended MaxSAT preprocessor","authors":"Tuukka Korhonen, Jeremias Berg, Paul Saikko, Matti Järvisalo","year":"2017","venue":"Proc. of the 20th Int. Conference on Theory and Applications of Satisfiability Testing","doi":null,"url":null,"internal_url":null},{"position":11,"raw":"[Lifschitz, 1987] Vladimir Lifschitz. On the semantics of STRIPS. In Michael Georgeff and Amy Lansky, editors, Reasoning about Actions and Plans, pages 1-9.","title":"On the semantics of STRIPS","authors":"Vladimir Lifschitz","year":null,"venue":"Reasoning about Actions and Plans","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"Morgan Kaufmann, San Mateo, CA, 1987.","title":null,"authors":"Morgan Kaufmann, San Mateo, Ca","year":"1987","venue":null,"doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Lipovetzky and Geffner, 2017] Nir Lipovetzky and Hector Geffner. Best-first width search: Exploration and exploita- tion in classical planning. In Proc. of AAAI, pages 3590- 3596, 2017.","title":"Best-first width search: Exploration and exploitation in classical planning","authors":"Geffner Lipovetzky, Nir Lipovetzky, Hector Geffner","year":"2017","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Muise et al., 2016] Christian Muise, J. Christopher Beck, and Sheila A. McIlraith. Optimal partial-order plan re- laxation via MaxSAT. Journal of Artificial Intelligence Research, 57:113 -149, 2016.","title":"Optimal partial-order plan relaxation via MaxSAT","authors":"Christian Muise, J Christopher Beck, Sheila A Mcilraith","year":"2016","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Nguyen and Kambhampati, 2001] XuanLong Nguyen and Subbarao Kambhampati. Reviving partial order planning. In Proc. of IJCAI, pages 459-464, 2001.","title":"XuanLong Nguyen and Subbarao Kambhampati. Reviving partial order planning","authors":"Kambhampati Nguyen","year":"2001","venue":"Proc. of IJCAI","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Olz and Bercher, 2019] Conny Olz and Pascal Bercher. Eliminating redundant actions in partially ordered plans - A complexity analysis. In Proc. of ICAPS, pages 310-319, 2019.","title":"Eliminating redundant actions in partially ordered plans -A complexity analysis","authors":"Bercher Olz, Conny Olz, Pascal Bercher","year":"2019","venue":"Proc. of ICAPS","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Pochter et al., 2011] Nir Pochter, Aviv Zohar, and Jeffrey S. Rosenschein. Exploiting problem symmetries in state- based planners. In Proc. of AAAI, 2011.","title":"Exploiting problem symmetries in statebased planners","authors":"Nir Pochter, Aviv Zohar, Jeffrey S Rosenschein","year":"2011","venue":"Proc. of AAAI","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Richter and Westphal, 2010] Silvia Richter and Matthias Westphal. The LAMA planner: Guiding cost-based any- time planning with landmarks. Journal of Artificial Intel- ligence Research, 39(1):127-177, 2010.","title":"The LAMA planner: Guiding cost-based anytime planning with landmarks","authors":"Silvia Richter, Matthias Westphal","year":"2010","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Riddle et al., 2016] Pat Riddle, Jordan Douglas, Mike Bar- ley, and Santiago Franco. Improving performance by re- formulating PDDL into a bagged representation. In Proc. of the 8th Workshop on Heuristics and Search for Domain- independent Planning, pages 28-36, 2016.","title":"Improving performance by reformulating PDDL into a bagged representation","authors":"Pat Riddle, Jordan Douglas, Mike Barley, Santiago Franco","year":"2016","venue":"Proc. of the 8th Workshop on Heuristics and Search for Domainindependent Planning","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Rintanen, 2003] Jussi Rintanen. Symmetry reduction for SAT representations of transition systems. In Enrico Giunchiglia, Nicola Muscettola, and Dana S. Nau, editors, Proc. of ICAPS, pages 32-40, 2003.","title":"Symmetry reduction for SAT representations of transition systems","authors":"Jussi Rintanen","year":"2003","venue":"Proc. of ICAPS","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Rintanen, 2010] Jussi Rintanen. Heuristics for planning with SAT. In David Cohen, editor, Proc. of CP, pages 414-428, 2010.","title":"Heuristics for planning with SAT","authors":"Jussi Rintanen","year":"2010","venue":"Proc. of CP","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[Say et al., 2016] Buser Say, André A. Ciré, and J. Christo- pher Beck. Mathematical programming models for op- timizing partial-order plan flexibility. In Proc. of ECAI, pages 1044-1052, 2016.","title":"Mathematical programming models for optimizing partial-order plan flexibility","authors":"Buser Say, André A Ciré, J Christopher Beck","year":"2016","venue":"Proc. of ECAI","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Shlyakhter, 2007] Ilya Shlyakhter. Generating effective symmetry-breaking predicates for search problems. Dis- crete Applied Mathematics, 155(12):1539-1548, 2007.","title":"Ilya Shlyakhter. Generating effective symmetry-breaking predicates for search problems","authors":"Shlyakhter","year":"2007","venue":"Discrete Applied Mathematics","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Siddiqui and Haslum, 2012] Fazlul Hasan Siddiqui and Pa- trik Haslum. Block-structured plan deordering. In Proc. of the 25th Australasian Joint Conference on Advances in Artificial Intelligence, pages 803-814, 2012.","title":"Block-structured plan deordering","authors":"Fazlul Hasan, Siddiqui, Patrik Haslum","year":"2012","venue":"Proc. of the 25th Australasian Joint Conference on Advances in Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Waters et al., 2018] Max Waters, Bernhard Nebel, Lin Padgham, and Sebastian Sardiña. Plan relaxation via ac- tion debinding and deordering. In Proc. of ICAPS, pages 278-287, 2018.","title":"Plan relaxation via action debinding and deordering","authors":"Waters","year":"2018","venue":"Proc. of ICAPS","doi":null,"url":null,"internal_url":null},{"position":26,"raw":"[Weld, 1994] Daniel S. Weld. An introduction to least com- mitment planning. AI Magazine, 15(4):27-61, 1994.","title":"An introduction to least commitment planning","authors":"S Daniel, Weld","year":"1994","venue":"AI Magazine","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}