Interval-Based Relaxation for General Numeric Planning
We generalise the interval-based relaxation to sequential numeric planning problems with non-linear conditions and effects, and cyclic dependencies. This effectively removes all the limitations on the problem placed in previous work on numeric planning heuristics, and even allows us to extend the planning language with a wider set of mathematical functions. Heuristics obtained from the generalised relaxation are pruning-safe. We derive one such heuristic and use it to solve discrete-time...[Show more]
|Collections||ANU Research Publications|
|Source:||Interval-Based Relaxation for General Numeric Planning|
|Access Rights:||Open Access|
|01_Scala_Interval-Based_Relaxation_for_2016.pdf||301.17 kB||Adobe PDF|
Items in Open Research are protected by copyright, with all rights reserved, unless otherwise indicated.