Can I Really Do That? Verification of Meta-Operators via Stackelberg Planning

Florian Pham, Álvaro Torralba

Research output: Contribution to book/anthology/report/conference proceedingArticle in proceedingResearchpeer-review

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.

Original languageEnglish
Title of host publicationProceedings of the 32nd International Joint Conference on Artificial Intelligence, IJCAI 2023
EditorsEdith Elkind
Number of pages9
PublisherInternational Joint Conferences on Artificial Intelligence
Publication date2023
Pages5420-5428
ISBN (Electronic)978-1-956792-03-4
DOIs
Publication statusPublished - 2023
Event32nd International Joint Conference on Artificial Intelligence, IJCAI 2023 - Macao, China
Duration: 19 Aug 202325 Aug 2023

Conference

Conference32nd International Joint Conference on Artificial Intelligence, IJCAI 2023
Country/TerritoryChina
CityMacao
Period19/08/202325/08/2023
SponsorInternational Joint Conferences on Artifical Intelligence (IJCAI)
SeriesIJCAI International Joint Conference on Artificial Intelligence
Volume2023-August
ISSN1045-0823

Bibliographical note

Publisher Copyright:
© 2023 International Joint Conferences on Artificial Intelligence. All rights reserved.

Fingerprint

Dive into the research topics of 'Can I Really Do That? Verification of Meta-Operators via Stackelberg Planning'. Together they form a unique fingerprint.

Cite this