Skip to main content
    • Aa
    • Aa

The RANTANPLAN planner: system description

  • Miquel Bofill (a1), Joan Espasa (a1) and Mateu Villaret (a1)

RANTANPLAN is a numeric planning solver that takes advantage of recent advances in satisfiability modulo theories. 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.

Linked references
Hide All

This list contains references from the content that can be linked to their source. For a full set of references and notes please see the PDF or HTML where available.

A. Dovier , A. Formisano & E. Pontelli 2010. Multivalued action languages with constraints in CLP (FD). Theory and Practice of Logic Programming 10(2), 167235.

A. E. Gerevini , A. Saetti & I. Serina 2008. An approach to efficient planning with numerical fluents and multi-criteria plan quality. Artificial Intelligence 172(8), 899944.

J. Rintanen 2012. Planning as satisfiability: heuristics. Artificial Intelligence 193, 4586.

J. Rintanen , K. Heljanko & I. Niemelä 2006. Planning as satisfiability: parallel plans and algorithms for plan search. Artificial Intelligence 170(12–13), 10311080.

Recommend this journal

Email your librarian or administrator to recommend adding this journal to your organisation's collection.

The Knowledge Engineering Review
  • ISSN: 0269-8889
  • EISSN: 1469-8005
  • URL: /core/journals/knowledge-engineering-review
Please enter your name
Please enter a valid email address
Who would you like to send this to? *


Full text views

Total number of HTML views: 1
Total number of PDF views: 18 *
Loading metrics...

Abstract views

Total abstract views: 141 *
Loading metrics...

* Views captured on Cambridge Core between 22nd December 2016 - 25th September 2017. This data will be updated every 24 hours.