{"type":"ScholarlyArticle","title":"Can I Really Do That? Verification of Meta-Operators via Stackelberg Planning","authors":[{"name":"Florian Pham","slug":"florian-pham","given":"Florian","family":"Pham","affiliation":"Saarland University , Saarbrücken , Germany"},{"name":"Alvaro Torralba","slug":"alvaro-torralba","given":"Álvaro","family":"Torralba","affiliation":"Aalborg University , Aalborg , Denmark"}],"abstract":"Macro-operators are a common reformulation method in planning that adds high-level operators corresponding to a fixed sequence of primitive operators. We introduce meta-operators, which allow using different sequences of actions in each state. We show how to automatically verify whether a meta-operator is valid, i.e., the represented behavior is always doable. This can be checked at once for all instantiations of the meta-operator and all reachable states via a compilation into Stackelberg planning, a form of adversarial planning.  Our results show that meta-operators learned for multiple domains can often express useful high-level behaviors very compactly, improving planners' performance.","doi":"10.24963/ijcai.2023/602","url":"https://ijcai.org/proceedings/2023/602","pdf":"https://ijcai.org/proceedings/2023/0602.pdf","markdown":"https://ijcai.org/proceedings/2023/602.md","bibtex":"https://ijcai.org/proceedings/2023/bibtex/602","volume":{"slug":"2023","title":"Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2023","url":"https://ijcai.org/proceedings/2023/","year":2023,"location":"Macao, SAR","dates":"19-25 August 2023","editors":"Edith Elkind","isbn":"978-1-956792-03-4","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2023"},"section":"Planning and Scheduling","track":"Main Track","number":602,"pages":{"first":5420,"last":5428},"keywords":["Planning and Scheduling: PS: Learning in planning and scheduling","Planning and Scheduling: PS: Planning algorithms","Planning and Scheduling: PS: Search in planning and scheduling"],"videos":[],"references":[{"position":1,"raw":"[Botea et al., 2005] Adi Botea, Markus Enzenberger, Mar- tin Müller, and Jonathan Schaeffer. Macro-FF: Improving AI planning with automatically learned macro-operators. Journal of Artificial Intelligence Research, 24:581-621, 2005.","title":"Macro-FF: Improving AI planning with automatically learned macro-operators","authors":"Adi Botea, Markus Enzenberger, Martin Müller, Jonathan Schaeffer","year":"2005","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Bylander, 1994] Tom Bylander. The computational com- plexity of propositional STRIPS planning. Artificial In- telligence, 69(1-2):165-204, 1994.","title":"The computational complexity of propositional STRIPS planning","authors":"Tom Bylander, Bylander","year":"1994","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Chrpa and Vallati, 2022] Lukás Chrpa and Mauro Vallati. Planning with critical section macros: Theory and prac- tice. Journal of Artificial Intelligence Research, 74:691- 732, 2022.","title":"Lukás Chrpa and Mauro Vallati. Planning with critical section macros: Theory and practice","authors":"Vallati Chrpa","year":"2022","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Chrpa et al., 2014] Lukás Chrpa, Mauro Vallati, and Thomas Leo McCluskey. MUM: A technique for max- imising the utility of macro-operators by constrained gen- eration and use. In Steve Chien, Alan Fern, Wheeler Ruml, and Minh Do, editors, Proceedings of the Twenty- Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014). AAAI Press, 2014.","title":"MUM: A technique for maximising the utility of macro-operators by constrained generation and use","authors":"Chrpa","year":"2014","venue":"Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling (ICAPS 2014)","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Chrpa et al., 2018] Lukás Chrpa, Mauro Vallati, and Thomas Leo McCluskey. Outer entanglements: a general heuristic technique for improving the efficiency of plan- ning algorithms. J. Exp. Theor. Artif. Intell., 30(6):831- 856, 2018.","title":"Outer entanglements: a general heuristic technique for improving the efficiency of planning algorithms","authors":"Chrpa","year":"2018","venue":"J. Exp. Theor. Artif. Intell","doi":null,"url":null,"internal_url":null},{"position":6,"raw":"[Chrpa et al., 2019] Lukás Chrpa, Mauro Vallati, and Thomas Leo McCluskey. Inner entanglements: Narrowing the search in classical planning by problem reformulation. Computational Intelligence, 35(2):395-429, 2019.","title":"Inner entanglements: Narrowing the search in classical planning by problem reformulation","authors":"Chrpa","year":"2019","venue":"Computational Intelligence","doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Chrpa, 2010] Lukás Chrpa. Generation of macro-operators via investigation of action dependencies in plans. The Knowledge Engineering Review, 25(3):281-297, 2010.","title":"Lukás Chrpa. Generation of macro-operators via investigation of action dependencies in plans","authors":"Chrpa","year":"2010","venue":"The Knowledge Engineering Review","doi":null,"url":null,"internal_url":null},{"position":8,"raw":"[Coles and Smith, 2007] Andrew Coles and Amanda Smith. Marvin: A heuristic search planner with online macro- action learning. Journal of Artificial Intelligence Research, 28:119-156, 2007.","title":"Marvin: A heuristic search planner with online macroaction learning","authors":"Smith ; Coles, Andrew Coles, Amanda Smith","year":"2007","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":9,"raw":"[Daum et al., 2016] Jeanette Daum, Álvaro Torralba, Jörg Hoffmann, Patrik Haslum, and Ingo Weber. Practi- cal undoability checking via contingent planning. In Amanda Coles, Andrew Coles, Stefan Edelkamp, Daniele Magazzeni, and Scott Sanner, editors, Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, London, UK, June 12-17, 2016, pages 106-114. AAAI Press, 2016.","title":"Practical undoability checking via contingent planning","authors":"Jeanette Daum, Álvaro Torralba, Jörg Hoffmann, Patrik Haslum, Ingo Weber","year":"2016","venue":"Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016","doi":null,"url":null,"internal_url":null},{"position":10,"raw":"[Eiter et al., 2007] Thomas Eiter, Esra Erdem, and Wolfgang Faber. On reversing actions: Algorithms and complexity. In Manuela M. Veloso, editor, Proceedings of the 20th In- ternational Joint Conference on Artificial Intelligence (IJ- CAI 2007), pages 336-341, 2007.","title":"On reversing actions: Algorithms and complexity","authors":"Thomas Eiter, Esra Erdem, Wolfgang Faber","year":"2007","venue":"Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJ-CAI 2007)","doi":null,"url":null,"internal_url":"/proceedings/2007/52"},{"position":11,"raw":"[Eiter et al., 2008] Thomas Eiter, Esra Erdem, and Wolfgang Faber. Undoing the effects of action sequences. Journal of Applied Logic, 6(3):380-415, 2008.","title":"Undoing the effects of action sequences","authors":"Thomas Eiter, Esra Erdem, Wolfgang Faber","year":"2008","venue":"Journal of Applied Logic","doi":null,"url":null,"internal_url":null},{"position":12,"raw":"[Fikes and Nilsson, 1971] Richard E. Fikes and Nils J. Nils- son. STRIPS: A new approach to the application of the- orem proving to problem solving. Artificial Intelligence, 2:189-208, 1971.","title":"STRIPS: A new approach to the application of the-orem proving to problem solving","authors":"Richard E Fikes, Nils J Nilsson","year":"1971","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":13,"raw":"[Fikes et al., 1972] Richard Fikes, Peter E. Hart, and Nils J. Nilsson. Learning and executing generalized robot plans. Artificial Intelligence, 3(1-3):251-288, 1972.","title":"Learning and executing generalized robot plans","authors":"Richard Fikes, Peter E Hart, Nils J Nilsson","year":"1972","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":14,"raw":"[Fišer, 2020] Daniel Fišer. Lifted fact-alternating mutex groups and pruned grounding of classical planning prob- lems. In Vincent Conitzer and Fei Sha, editors, Proceed- ings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020), pages 9835-9842. AAAI Press, 2020.","title":"Lifted fact-alternating mutex groups and pruned grounding of classical planning problems","authors":"Daniel Fišer","year":"2020","venue":"Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2020)","doi":null,"url":null,"internal_url":null},{"position":15,"raw":"[Gazen and Knoblock, 1997] B. Cenk Gazen and Craig A. Knoblock. Combining the expressivity of UCPOP with the efficiency of Graphplan. In Sam Steel and Rachid Alami, editors, Recent Advances in AI Planning. 4th Euro- pean Conference on Planning (ECP 1997), volume 1348 of Lecture Notes in Artificial Intelligence, pages 221-233. Springer-Verlag, 1997.","title":"Combining the expressivity of UCPOP with the efficiency of Graphplan","authors":"B, Cenk Gazen, Craig A Knoblock","year":"1997","venue":"Recent Advances in AI Planning. 4th European Conference on Planning (ECP 1997)","doi":null,"url":null,"internal_url":null},{"position":16,"raw":"[Gerevini et al., 2009] Alfonso E. Gerevini, Alessandro Saetti, and Mauro Vallati. An automatically configurable portfolio-based planner with macro-actions: PbP. In Al- fonso Gerevini, Adele Howe, Amedeo Cesta, and Ioannis Refanidis, editors, Proceedings of the Nineteenth Interna- tional Conference on Automated Planning and Scheduling (ICAPS 2009), pages 350-353. AAAI Press, 2009.","title":"An automatically configurable portfolio-based planner with macro-actions: PbP","authors":"Alfonso E Gerevini, Alessandro Saetti, Mauro Vallati","year":"2009","venue":"Proceedings of the Nineteenth International Conference on Automated Planning and Scheduling (ICAPS 2009)","doi":null,"url":null,"internal_url":null},{"position":17,"raw":"[Helmert, 2006] Malte Helmert. The Fast Downward plan- ning system. Journal of Artificial Intelligence Research, 26:191-246, 2006.","title":"The Fast Downward planning system","authors":"Malte Helmert","year":"2006","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":18,"raw":"[Helmert, 2009] Malte Helmert. Concise finite-domain rep- resentations for PDDL planning tasks. Artificial Intelli- gence, 173:503-535, 2009.","title":"Concise finite-domain representations for PDDL planning tasks","authors":"Malte Helmert, Helmert","year":"2009","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":19,"raw":"[Hoffmann and Nebel, 2001] Jörg Hoffmann and Bernhard Nebel. The FF planning system: Fast plan generation through heuristic search. Journal of Artificial Intelligence Research, 14:253-302, 2001.","title":"The FF planning system: Fast plan generation through heuristic search","authors":"Nebel Hoffmann, Jörg Hoffmann, Bernhard Nebel","year":"2001","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":20,"raw":"[Korf, 1985] Richard E. Korf. Depth-first iterative- deepening: An optimal admissible tree search. Artificial Intelligence, 27(1):97-109, 1985.","title":"Depth-first iterativedeepening: An optimal admissible tree search","authors":"Richard E Korf","year":"1985","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":21,"raw":"[Long and Fox, 2003] Derek Long and Maria Fox. The 3rd International Planning Competition: Results and analysis. Journal of Artificial Intelligence Research, 20:1-59, 2003.","title":"The 3rd International Planning Competition: Results and analysis","authors":"Derek Long, Maria Fox","year":"2003","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":22,"raw":"[McDermott, 2000] Drew McDermott. The 1998 AI Plan- ning Systems competition. AI Magazine, 21(2):35-55, 2000.","title":"The 1998 AI Planning Systems competition","authors":"Drew Mcdermott","year":"2000","venue":"AI Magazine","doi":null,"url":null,"internal_url":null},{"position":23,"raw":"[Morak et al., 2020] Michael Morak, Lukas Chrpa, Wolf- gang Faber, and Daniel Fišer. On the reversibility of ac- tions in planning. In Proceedings of the 17th Interna- tional Conference on Principles of Knowledge Represen- tation and Reasoning, pages 652-661, 9 2020.","title":"On the reversibility of actions in planning","authors":"Michael Morak, Lukas Chrpa, Wolfgang Faber, Daniel Fišer","year":"2020","venue":"Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning","doi":null,"url":null,"internal_url":null},{"position":24,"raw":"[Nebel, 2000] Bernhard Nebel. On the compilability and expressive power of propositional planning formalisms. Journal of Artificial Intelligence Research, 12:271-315, 2000.","title":"On the compilability and expressive power of propositional planning formalisms","authors":"Bernhard Nebel","year":"2000","venue":"Journal of Artificial Intelligence Research","doi":null,"url":null,"internal_url":null},{"position":25,"raw":"[Pham and Torralba, 2023] Florian Pham and Álvaro Tor- ralba. Code, benchmarks, and experimental data for the IJCAI 2023 paper \"can i really do that? verification of meta-operators via stackelberg planning\". https://doi.org/ 10.5281/zenodo.7942439, 2023.","title":"Florian Pham and Álvaro Torralba","authors":"Torralba Pham","year":"2023","venue":"Code, benchmarks, and experimental data for the IJCAI 2023 paper \"can i really do that? verification of meta-operators via stackelberg planning","doi":"10.5281/zenodo.7942439","url":"https://doi.org/10.5281/zenodo.7942439,2023","internal_url":null},{"position":26,"raw":"[Richter and Westphal, 2008] Silvia Richter and Matthias Westphal. The LAMA planner -Using landmark count- ing in heuristic search. IPC 2008 short papers, http: //ipc.informatik.uni-freiburg.de/Planners, 2008.","title":"The LAMA planner -Using landmark counting in heuristic search","authors":"Westphal Richter, Silvia Richter, Matthias Westphal","year":"2008","venue":"IPC 2008 short papers","doi":null,"url":"http://ipc.informatik.uni-freiburg.de/Planners","internal_url":null},{"position":27,"raw":"[Sauer et al., 2023] Philipp Sauer, Marcel Steinmetz, Robert Künnemann, and Jörg Hoffmann. Lifted stackelberg plan- ning. In Proceedings of the 33rd International Conference on Automated Planning and Scheduling, ICAPS 2023, 2023.","title":"Lifted stackelberg planning","authors":"Philipp Sauer, Marcel Steinmetz, Robert Künnemann, Jörg Hoffmann","year":"2023","venue":"Proceedings of the 33rd International Conference on Automated Planning and Scheduling, ICAPS 2023","doi":null,"url":null,"internal_url":null},{"position":28,"raw":"[Seipp et al., 2017] Jendrik Seipp, Florian Pommerening, Silvan Sievers, and Malte Helmert. Downward Lab. https: //doi.org/10.5281/zenodo.790461, 2017.","title":"Downward Lab","authors":"Seipp","year":"2017","venue":null,"doi":"10.5281/zenodo.790461","url":"https://doi.org/10.5281/zenodo.790461,2017","internal_url":null},{"position":29,"raw":"[Speicher et al., 2018] Patrick Speicher, Marcel Steinmetz, Michael Backes, Jörg Hoffmann, and Robert Künnemann. Stackelberg planning: Towards effective leader-follower state space search. In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018), pages 6286-6293. AAAI Press, 2018.","title":"Stackelberg planning: Towards effective leader-follower state space search","authors":"Patrick Speicher, Marcel Steinmetz, Michael Backes, Jörg Hoffmann, Robert Künnemann","year":"2018","venue":"Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018)","doi":null,"url":null,"internal_url":null},{"position":30,"raw":"[Tambe, 2011] Milind Tambe. Security and game theory: Algorithms, deployed systems, lessons learned. Cam- bridge University Press, 2011.","title":"Security and game theory: Algorithms, deployed systems, lessons learned","authors":"Milind Tambe","year":"2011","venue":null,"doi":null,"url":null,"internal_url":null},{"position":31,"raw":"[Torralba et al., 2017] Álvaro Torralba, Vidal Alcázar, Pe- ter Kissmann, and Stefan Edelkamp. Efficient symbolic search for cost-optimal planning. Artificial Intelligence, 242:52-79, 2017.","title":"Efficient symbolic search for cost-optimal planning","authors":"Álvaro Torralba, Peter Vidal Alcázar, Stefan Kissmann, Edelkamp","year":"2017","venue":"Artificial Intelligence","doi":null,"url":null,"internal_url":null},{"position":32,"raw":"[Torralba et al., 2021] Álvaro Torralba, Patrick Speicher, Robert Künnemann, Marcel Steinmetz, and Jörg Hoff- mann. Faster stackelberg planning via symbolic search and information sharing. In Kevin Leyton-Brown and Mausam, editors, Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021), pages 11998-12006. AAAI Press, 2021.","title":"Faster stackelberg planning via symbolic search and information sharing","authors":"Álvaro Torralba, Patrick Speicher, Robert Künnemann, Marcel Steinmetz, Jörg Hoffmann","year":"2021","venue":"Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence (AAAI 2021)","doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}