Author:
Bofill Miquel,Espasa Joan,Villaret Mateu
Abstract
AbstractRANTANPLAN 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.
Publisher
Cambridge University Press (CUP)
Subject
Artificial Intelligence,Software
Reference19 articles.
1. Bofill M. , Espasa J. & Villaret M. 2014. Efficient SMT encodings for the petrobras domain. In Proceedings of the 13th International Workshop on Constraint Modelling and Reformulation (ModRef 2014), 68–84.
2. Planning as satisfiability: Heuristics
3. Multivalued action languages with constraints in CLP(FD)
4. Bofill M. , Espasa J. & Villaret M. 2016. A semantic notion of interference for planning modulo theories. In Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, ICAPS 2016, 56–64.
5. Planning as satisfiability: parallel plans and algorithms for plan search
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献