About
Malte Helmert is a Professor at the University of Basel in the Department of Mathematics and Computer Science. He previously worked at the University of Freiburg's Research Group on the Foundations of Artificial Intelligence from 2001 to 2011. His research focuses on intelligent problem-solving, particularly in automated planning, combinatorial search, constraint satisfaction, and NP-hard graph problems. Helmert has made significant contributions to classical planning, including the development of the Fast Downward planning system and its derivatives.
- Education:
- Diploma in Computer Science (M.Sc.) from the University of Freiburg (2001)
- Ph.D. in Computer Science from the University of Freiburg (2006)
Research interests encompass the theoretical and practical aspects of automated planning, including heuristic search, optimal planning, abstraction techniques, and domain-independent planning. His work explores merge-and-shrink abstractions, landmark progression, and cost partitioning algorithms for classical planning systems.
Recent publications analyze advancements in pseudo-Boolean proof logging, higher-dimensional potential heuristics, and correlation complexity in planning domains. These works often integrate mathematical modeling, algorithm design, and empirical benchmarking.
Scientific awards include the AAAI Fellow (2021), EurAI Fellow (2020), multiple Best Paper Awards at ICAPS and SoCS conferences, and the Computers and Thought Award (2011). He also received the VDI-Förderpreis for his Master’s thesis.
Software contributions include the Fast Downward planning system, MIPS (now maintained by Stefan Edelkamp), and COVER (a vertex cover solver). Helmert has organized tutorials at ICAPS and AAAI conferences on topics like landmark progression, abstraction heuristics, and LP-based heuristics.
