Optimal Planning Modulo Theories

Francesco Leofante, Enrico Giunchiglia, Erika Ábráham, Armando Tacchella

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence

Main track. Pages 4128-4134.

https://doi.org/10.24963/ijcai.2020/571

PDF BibTeX Video

Abstract

We consider the problem of planning with arithmetic

theories, and focus on generating optimal

plans for numeric domains with constant and state-dependent action costs.

Solving these problems efficiently requires a seamless integration between

propositional and numeric reasoning. We propose a novel approach that leverages Optimization

Modulo Theories (OMT) solvers to implement a domain-independent optimal

theory-planner. We present a new encoding

for optimal planning in this setting and

we evaluate our approach using well-known, as well as new, numeric benchmarks.

Keywords

  • Planning and Scheduling: Planning Algorithms
  • Constraints and SAT: Satisfiability Modulo Theories
Welcome Future Conferences AI Journal Division IJCAI Proceedings Travel Grant Program IJCAI Awards