The RANTANPLAN planner: system description

RANTANPLAN is a numeric planning solver that takes advantage of recent advances in SMT. It extends reduction to SAT approaches with an easy and efficient handling of numeric fluents using background theories. In this paper we describe the design choices and features of RANTANPLAN, especially, how numeric reasoning is integrated in the system. We also provide experimental results showing that RANTANPLAN is competitive with existing exact numeric planners.

[1]  Bart Selman,et al.  Planning as Satisfiability , 1992, ECAI.

[2]  L. D. Moura,et al.  The YICES SMT Solver , 2006 .

[3]  Mateu Villaret,et al.  A Semantic Notion of Interference for Planning Modulo Theories , 2016, ICAPS.

[4]  J. Christopher Beck,et al.  Planning Modulo Theories: Extending the Planning Paradigm , 2012, ICAPS.

[5]  Henry A. Kautz,et al.  State-space Planning by Integer Optimization , 1999, AAAI/IAAI.

[6]  Daniel S. Weld,et al.  The LPSAT Engine & Its Application to Resource Planning , 1999, IJCAI.

[7]  Jussi Rintanen.  Planning and SAT , 2009, Handbook of Satisfiability.

[8]  Alan M. Frisch,et al.  SAT Encodings of the At-Most-k Constraint Some Old , Some New , Some Fast , Some Slow , 2010 .

[9]  Bart Selman,et al.  Encoding Plans in Propositional Logic , 1996, KR.

[10]  Roman Barták,et al.  Solving Sequential Planning Problems via Constraint Satisfaction , 2010, Fundam. Informaticae.

[11]  Jussi Rintanen,et al.  Planning as Satisfiability with Relaxed $-Step Plans , 2007, Australian Conference on Artificial Intelligence.

[12]  Ilkka Niemelä,et al.  Planning as satisfiability: parallel plans and algorithms for plan search , 2006, Artif. Intell..

[13]  Agostino Dovier,et al.  Multivalued action languages with constraints in CLP(FD) , 2010, Theory Pract. Log. Program..

[14]  Jussi Rintanen,et al.  Planning as satisfiability: Heuristics , 2012, Artif. Intell..

[15]  Miquel Bofill,et al.  Efficient SMT Encodings for the Petrobras Domain , 2014 .

[16]  Jörg Hoffmann,et al.  The Metric-FF Planning System: Translating ''Ignoring Delete Lists'' to Numeric State Variables , 2003, J. Artif. Intell. Res..

[17]  Tomás Balyo.  Relaxing the Relaxed Exist-Step Parallel Planning Semantics , 2013, 2013 IEEE 25th International Conference on Tools with Artificial Intelligence.

[18]  Jörg Hoffmann,et al.  SAT Encodings of State-Space Reachability Problems in Numeric Domains , 2007, IJCAI.

[19]  Cesare Tinelli,et al.  Satisfiability Modulo Theories , 2021, Handbook of Satisfiability.

[20]  Ivan Serina,et al.  An approach to efficient planning with numerical fluents and multi-criteria plan quality , 2008, Artif. Intell..

[21]  F. Maris,et al.  SMT Spatio-Temporal Planning , 2012 .

[22]  Maria Fox,et al.  PDDL2.1: An Extension to PDDL for Expressing Temporal Planning Domains , 2003, J. Artif. Intell. Res..