Skip to content

Author

Daniel Gnad

We have 2 of 62 papers

We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.

Not the right person? Other researchers publish under this name.

Open access Aug 2026

Domain-Abstraction Heuristics for Simple Numeric Planning

Abstraction heuristics are among the most effective approaches in optimal classical planning. For numeric planning, however, existing abstraction heuristics suffer from the infiniteness of the abstract state spaces, which is an immediate consequence of numeric state variables. This has recently been analyzed for numeri...

M. Fritzsche, Mikhail Gruntov, Alexander Shleyfman et al. · 0 citations

Incremental Planning over Lifted Abstractions

This work proposes to abstract the planning task for abstract solutions that are then repaired into concrete plans for the input task, and showcases domains in which drawing an abstract plan and repairing it is significantly faster than solving the original problem.

M. Kornherr, Daniel Gnad, Z. G. Saribatur et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.