Temporal Numeric Planning with Patterns

Differently from results highlight the strong performances of our planner, the classical case, where plans are sequences of instantaneous which achieved the highest coverage (i.e., number of solved actions and variables are Boolean, in these problems problems) in 9 out of 10 domains, while the second-best actions may have a duration, are executed concurrently over planner had the highest coverage in 4 domains. Additionally, time, and can affect Boolean and numeric variables at both compared to the other symbolic planners, our system is able the start and end of their execution. These two extensions to find a valid plan with a lower bound on all the problems.