Photo of Daniel Gnad

Daniel Gnad

Assistant Professor

My research interests are in the fields of artificial intelligence planning and model checking.

Artificial intelligence planning and model checking

I am assistant professor at the Artificial Intelligence and Integrated Computer Systems division (AIICS). I am working on state space search methods such as decoupled state space search and have some experience in developing domain-independent heuristics such as red-black heuristics. More recently, I got interested in the grounding process that most planning systems perform as preprocessing. Together with my co-authors, I work on partial grounding methods that try to tackle the exponential blow-up that can occur during grounding by leveraging machine learning techniques.

CV in brief

Short bio

I did my studies in Computer Science at Saarland University. After finishing my MSc. degree, I stayed on as a PhD student in the group of Prof. Jörg Hoffmann. In 2022, I joined the RLPLab at Linköping University as a postdoctoral researcher, where I became assistant professor in 2023.


  • Dr.-Eduard-Martin-Preis for the best dissertation of the Faculty for Mathematics and Computer Science in 2021 awarded by Saarland University.
  • SoCS 2022 Best Paper Award at the 15th Annual Symposium on Combinatorial Search for the paper Additive Pattern Databases for Decoupled Search

  • ICAPS 2022 Best Dissertation Award for the doctoral thesis Star-Topology Decoupled State-Space Search in AI Planning and Model Checking at the 32th International Conference on Automated Planning and Scheduling.
  • Nominated for the Dissertation Award 2021 of the German Society for Computer Science (GI). This is a national award (joint with Switzerland and Austria) for the best dissertation in the field of Computer Science. Nominated by Saarland University.
  • SPIN 2018 Best Paper Award for the paper Star-Topology Decoupling in SPIN at the 25th International Symposium on Model Checking of Software.

  • Runner-Up, Deterministic Sequential Agile Track for the planning system Saarplan at the 9th International Planning Competition (IPC 2018) at ICAPS 2018.
  • Runner-Up, Deterministic Sequential Bounded-Cost Track for the planning system Saarplan at the 9th International Planning Competition (IPC 2018) at ICAPS 2018.
  • Special Recognition for the planning system Saarplan for solving the highest number of problems of all planners in both the Agile and the Satisficing track at the 9th International Planning Competition (IPC 2018) at ICAPS 2018.



Alexander Shleyfman, Daniel Gnad, Peter Jonsson (2023) Structurally Restricted Fragments of Numeric Planning - a Complexity Analysis
Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman (2023) Planning over Integers: Compilations and Undecidability
David Speck, Paul Höft, Daniel Gnad, Jendrik Seipp (2023) Finding Matrix Multiplication Algorithms with Classical Planning Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), p. 411-416
Daniel Gnad, Silvan Sievers, Alvaro Torralba (2023) Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases


Daniel Gnad, Álvaro Torralba, Daniel Fišer (2022) Beyond Stars - Generalized Topologies for Decoupled Search Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, ICAPS 2022, p. 110-118 Continue to DOI


About the division

Colleagues at AIICS

About the department