My name is Thorsten Klößner, born on the 25th of October, 1995 in
Saarland, Germany, where I currently live. Since two years, I am a PhD
student at the chair of professor Jörg Hoffmann, where I am currently
writing my dissertation on the topic of domain-independent admissible
heuristics in probabilistic planning.
Short Biography
In late 2013, I enrolled as a computer science student at Saarland University.
I received my Bachelor's Degree in Computer Science in 2018, and my Master's
Degree in late 2020 both at Saarbrücken University. Since then, I have
been a PhD student at the chair of professor Jörg Hoffmann, where I am
currently researching for my thesis.
Research Interests
My main research interest lies in the construction of admissible heuristics, as
well as admissible heuristic combination strategies in Probabilistic Planning.
In particular, my own research focuses primarily on abstraction heuristics, as
well as cost partitioning heuristics for stochastic shortest path problems. In
the long term, I am also interested in connections of my work to different
research areas, for example probabilistic model checking.
Publications
Awards
Best Student Paper Runner-Up for the paper
Cost Partitioning Heuristics for Stochastic Shortest Path Problems
together with
Florian Pommerening,
Thomas Keller and
Gabriele Röger at the 32nd International Conference on Automated
Planning and Scheduling (ICAPS 2022)
Best Student Paper for the paper
Pattern Databases for Stochastic Shortest Path Problems
together with
Jörg Hoffmann at the 14th Annual Symposium on Combinatorial
Search (SOCS 2021)
Thorsten Klößner,
Jendrik Seipp and
Marcel Steinmetz,
Cartesian Abstractions and Saturated Cost Partitioning in Probabilistic Planning
Proceedings of the 26th European Conference on Artificial Intelligence (ECAI 2023)
PDFAppendix
Thorsten Klößner and
Jörg Hoffmann,
Pattern Databases for Stochastic Shortest Path Problems
Proceedings of the 14th Annual Symposium on Combinatorial Search (SOCS
2021)
PDF
