Should this item rank higher or lower?
For three decades, temporal numeric planning (scheduling actions with time and quantity constraints) and PDDL+ solvers have been incompatible. This paper closes the gap with a polynomial-time, semantics-preserving compilation — letting the full ecosystem of PDDL+ solvers tackle temporal problems they could not touch before. Strong results on industrial benchmarks validate the theory.
Explore all rankings and community verdicts for Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version on its canonical entity profile.
Comments on "Compiling Temporal Numeric Planning into Discrete PDDL+: Extended Version"
Be the first to share your thoughts!
Have a take on this ranking?
Save your rankings and see how you compare. Comments are how the argument actually happens here. Posting one needs a free account — it takes about a minute.
No comments yet.
The first comment sets the terms of the argument.