Pattern Databases for Goal-Probability Maximization in Probabilistic Planning. - Thorsten Klößner; Jörg Hoffmann 001; Marcel Steinmetz; Álvaro Torralba (ICAPS, 2021)

Pattern Databases for Stochastic Shortest Path Problems. - Thorsten Klößner; Jörg Hoffmann 001 (SOCS, 2021)

Cost Partitioning Heuristics for Stochastic Shortest Path Problems. - Thorsten Klößner; Florian Pommerening; Thomas Keller 001; Gabriele Röger (ICAPS, 2022)

Pattern Selection Strategies for Pattern Databases in Probabilistic Planning. - Thorsten Klößner; Marcel Steinmetz; Álvaro Torralba; Jörg Hoffmann 001 (ICAPS, 2022)

A Theory of Merge-and-Shrink for Stochastic Shortest Path Problems. - Thorsten Klößner; Álvaro Torralba; Marcel Steinmetz; Silvan Sievers (ICAPS, 2023)

Cartesian Abstractions and Saturated Cost Partitioning in Probabilistic Planning. - Thorsten Klößner; Jendrik Seipp; Marcel Steinmetz (ECAI, 2023)

Merge-and-Shrink Heuristics for SSPs with Prune Transformations. - Thorsten Klößner; Álvaro Torralba; Marcel Steinmetz; Silvan Sievers (ECAI, 2024)