Numeric Planning with Disjunctive Global Constraints via SMT
This paper describes a novel encoding for sequential numeric planning into the problem of determining the satisfiability of a logical theory T. We introduce a novel technique, orthogonal to existing work aiming at producing more succinct encodings that enables the theory solver to roll up an unbounded yet finite number of instances of an action into a single plan step, greatly reducing the horizon at which T models valid plans. The technique is then extended to deal with problems featuring...[Show more]
|Collections||ANU Research Publications|
|Source:||Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling (ICAPS 2016)|
|Access Rights:||Open Access|
|01_Scala_Numeric_Planning_with_2016.pdf||688.55 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.