Automatic Bidding for the Game of Skat. - Thomas Keller 001; Sebastian Kupferschmid (KI, 2008)

Semantic Attachments for Domain-Independent Planning Systems. - Christian Dornhege; Patrick Eyerich; Thomas Keller 001; Sebastian Trüg; Michael Brenner 001; Bernhard Nebel (ICAPS, 2009)

Integrating Task and Motion Planning Using Semantic Attachments. - Christian Dornhege; Patrick Eyerich; Thomas Keller 001; Michael Brenner 001; Bernhard Nebel (Bridging the Gap Between Task and Motion Planning, 2010)

High-Quality Policies for the Canadian Traveler's Problem. - Patrick Eyerich; Thomas Keller 001; Malte Helmert (AAAI, 2010)

Coming up With Good Excuses: What to do When no Plan Can be Found. - Moritz Göbelbecker; Thomas Keller 001; Patrick Eyerich; Michael Brenner 001; Bernhard Nebel (Cognitive Robotics, 2010)

Task Planning for an Autonomous Service Robot. - Thomas Keller 001; Patrick Eyerich; Bernhard Nebel (KI, 2010)

A Polynomial All Outcome Determinization for Probabilistic Planning. - Thomas Keller 001; Patrick Eyerich (ICAPS, 2011)

A system for interactive learning in dialogue with a tutor. - Danijel Skocaj; Matej Kristan; Alen Vrecko; Marko Mahnic; Miroslav Janícek; Geert-Jan M. Kruijff; Marc Hanheide; Nick Hawes; Thomas Keller 001; Michael Zillich; Kai Zhou 003 (IROS, 2011)

PROST: Probabilistic Planning Based on UCT. - Thomas Keller 001; Patrick Eyerich (ICAPS, 2012)

A Planning Based Framework for Controlling Hybrid Systems. - Johannes Löhr; Patrick Eyerich; Thomas Keller 001; Bernhard Nebel (ICAPS, 2012)

Planning with Semantic Attachments: An Object-Oriented View. - Andreas Hertle; Christian Dornhege; Thomas Keller 001; Bernhard Nebel (ECAI, 2012)

Task Planning for an Autonomous Service Robot. - Thomas Keller 001; Patrick Eyerich; Bernhard Nebel (Towards Service Robots for Everyday Environments, 2012)

Semantic Attachments for Domain-Independent Planning Systems. - Christian Dornhege; Patrick Eyerich; Thomas Keller 001; Sebastian Trüg; Michael Brenner 001; Bernhard Nebel (Towards Service Robots for Everyday Environments, 2012)

Trial-Based Heuristic Tree Search for Finite Horizon MDPs. - Thomas Keller 001; Malte Helmert (ICAPS, 2013)

Robot george: interactive continuous learning of visual concepts. - Michael Zillich; Kai Zhou 003; Danijel Skocaj; Matej Kristan; Alen Vrecko; Miroslav Janícek; Geert-Jan M. Kruijff; Thomas Keller 001; Marc Hanheide; Nick Hawes; Marko Mahnic (HRI, 2013)

Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games. - Florian Geißer; Thomas Keller 001; Robert Mattmüller (ECAI, 2014)

An Experimental Comparison of Classical, FOND and Probabilistic Planning. - Andreas Hertle; Christian Dornhege; Thomas Keller 001; Robert Mattmüller; Manuela Ortlieb; Bernhard Nebel (KI, 2014)

Balancing Exploration and Exploitation in Classical Planning. - Tim Schulte; Thomas Keller 001 (SOCS, 2014)

Better Be Lucky than Good: Exceeding Expectations in MDP Evaluation. - Thomas Keller 001; Florian Geißer (AAAI, 2015)

Delete Relaxations for Planning with State-Dependent Action Costs. - Florian Geißer; Thomas Keller 001; Robert Mattmüller (IJCAI, 2015)

Anytime optimal MDP planning with trial-based heuristic tree search. - Thomas Keller 001 (2015)

Abstractions for Planning with State-Dependent Action Costs. - Florian Geißer; Thomas Keller 001; Robert Mattmüller (ICAPS, 2016)

State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning. - Thomas Keller 001; Florian Pommerening; Jendrik Seipp; Florian Geißer; Robert Mattmüller (IJCAI, 2016)

An integrated system for interactive continuous learning of categorical knowledge. - Danijel Skocaj; Alen Vrecko; Marko Mahnic; Miroslav Janícek; Geert-Jan M. Kruijff; Marc Hanheide; Nick Hawes; Jeremy L. Wyatt; Thomas Keller 001; Kai Zhou 003; Michael Zillich; Matej Kristan (J. Exp. Theor. Artif. Intell., 2016)

Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (AAAI, 2017)

A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (ICAPS, 2017)

Understanding the Search Behaviour of Greedy Best-First Search. - Manuel Heusner; Thomas Keller 001; Malte Helmert (SOCS, 2017)

Optimal Solutions to Large Logistics Planning Domain Problems. - Gerald Paul; Gabriele Röger; Thomas Keller 001; Malte Helmert (SOCS, 2017)

Best-Case and Worst-Case Behavior of Greedy Best-First Search. - Manuel Heusner; Thomas Keller 001; Malte Helmert (IJCAI, 2018)

Search Progress and Potentially Expanded States in Greedy Best-First Search. - Manuel Heusner; Thomas Keller 001; Malte Helmert (IJCAI, 2018)

Stochastic Planning with Lifted Symbolic Trajectory Optimization. - Hao Cui 003; Thomas Keller 001; Roni Khardon (ICAPS, 2019)

Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. - Silvan Sievers; Florian Pommerening; Thomas Keller 001; Malte Helmert (IJCAI, 2020)

Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces. - Florian Geißer; David Speck 001; Thomas Keller 001 (SOCS, 2020)

Saturated Cost Partitioning for Optimal Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (J. Artif. Intell. Res., 2020)

Saturated Post-hoc Optimization for Classical Planning. - Jendrik Seipp; Thomas Keller 001; Malte Helmert (AAAI, 2021)

Exploiting Cyclic Dependencies in Landmark Heuristics. - Clemens Büchner; Thomas Keller 001; Malte Helmert (ICAPS, 2021)

Dantzig-Wolfe Decomposition for Cost Partitioning. - Florian Pommerening; Thomas Keller 001; Valentina Halasi; Jendrik Seipp; Silvan Sievers; Malte Helmert (ICAPS, 2021)

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

Learning and Exploiting Progress States in Greedy Best-First Search. - Patrick Ferber; Liat Cohen; Jendrik Seipp; Thomas Keller 001 (IJCAI, 2022)

Landmark Progression in Heuristic Search. - Clemens Büchner; Thomas Keller 001; Salomé Eriksson; Malte Helmert (ICAPS, 2023)

Transition Landmarks from Abstraction Cuts. - Florian Pommerening; Clemens Büchner; Thomas Keller 001 (ICAPS, 2024)

Merging or Computing Saturated Cost Partitionings? A Merge Strategy for the Merge-and-Shrink Framework. - Silvan Sievers; Thomas Keller 001; Gabriele Röger (ICAPS, 2024)

Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning. - Clemens Büchner; Remo Christen; Salomé Eriksson; Thomas Keller 001 (SOCS, 2024)