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 nu...
| Autores: | , , |
|---|---|
| Tipo de recurso: | artículo |
| Estado: | Versión aceptada para publicación |
| Fecha de publicación: | 2016 |
| País: | España |
| Institución: | Varias* (Consorci de Biblioteques Universitáries de Catalunya, Centre de Serveis Científics i Acadèmics de Catalunya) |
| Repositorio: | Recercat. Dipósit de la Recerca de Catalunya |
| OAI Identifier: | oai:recercat.cat:10256/14885 |
| Acceso en línea: | http://hdl.handle.net/10256/14885 |
| Access Level: | acceso abierto |
| Palabra clave: | Algorismes computacionals Computer algorithms Programació per restriccions (Informàtica) Constraint programming (Computer science) |
| Sumario: | 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 |
|---|