default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Keller 0001
Person information
- affiliation: University of Basel, Switzerland
- affiliation: Albert-Ludwigs-Universität Freiburg, Germany
Other persons with the same name
- Thomas Keller — disambiguation page
- Thomas Keller 0002 — University of Southampton, UK
- Thomas Keller 0003 — ABB Daimler-Benz Transportation, Zürich, Switzerland
- Thomas Keller 0004 — ST Ericsson S.A., Zurich, Switzerland
- Thomas Keller 0005 — Oregon Graduate Institute
- Thomas Keller 0006
![[0000-0002-8100-6900]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8100-6900")
— ZHAW School of Management and Law, Winterthur, Switzerland - Thomas Keller 0007 — Rice University, Department of Electrical and Computer Engineering, Houston, TX, USA
Other persons with a similar name
- Thomas Anderson Keller
- Thomas E. Keller
- Thomas H. Keller
- Thomas L. Keller
- Thomas Michael Keller
- T. Anderson Keller 0001 (aka: Thomas A. Keller 0001) — The Kempner Institute for the Study of Natural and Artificial Intelligence at Harvard University, Cambridge, USA (and 1 more)
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c40]Florian Pommerening, Clemens Büchner, Thomas Keller:
Transition Landmarks from Abstraction Cuts. ICAPS 2024: 445-454- [c39]Silvan Sievers, Thomas Keller, Gabriele Röger:
Merging or Computing Saturated Cost Partitionings? A Merge Strategy for the Merge-and-Shrink Framework. ICAPS 2024: 541-545 - [c38]Clemens Büchner, Remo Christen, Salomé Eriksson, Thomas Keller:
Hitting Set Heuristics for Overlapping Landmarks in Satisficing Planning. SOCS 2024: 198-202 - 2023
- [c37]Clemens Büchner, Thomas Keller, Salomé Eriksson, Malte Helmert:
Landmark Progression in Heuristic Search. ICAPS 2023: 70-79 - 2022
- [c36]Thorsten Klößner, Florian Pommerening, Thomas Keller, Gabriele Röger:
Cost Partitioning Heuristics for Stochastic Shortest Path Problems. ICAPS 2022: 193-202 - [c35]Patrick Ferber, Liat Cohen, Jendrik Seipp, Thomas Keller:
Learning and Exploiting Progress States in Greedy Best-First Search. IJCAI 2022: 4740-4746 - 2021
- [c34]Jendrik Seipp, Thomas Keller, Malte Helmert:
Saturated Post-hoc Optimization for Classical Planning. AAAI 2021: 11947-11953 - [c33]Clemens Büchner, Thomas Keller, Malte Helmert:
Exploiting Cyclic Dependencies in Landmark Heuristics. ICAPS 2021: 65-73 - [c32]Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert:
Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS 2021: 271-280 - 2020
- [j2]Jendrik Seipp, Thomas Keller, Malte Helmert:
Saturated Cost Partitioning for Optimal Classical Planning. J. Artif. Intell. Res. 67: 129-167 (2020) - [c31]Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert:
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. IJCAI 2020: 4152-4160 - [c30]Florian Geißer, David Speck, Thomas Keller:
Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces. SOCS 2020: 38-47
2010 – 2019
- 2019
- [c29]Hao Cui, Thomas Keller, Roni Khardon:
Stochastic Planning with Lifted Symbolic Trajectory Optimization. ICAPS 2019: 119-127 - 2018
- [c28]Manuel Heusner, Thomas Keller, Malte Helmert:
Best-Case and Worst-Case Behavior of Greedy Best-First Search. IJCAI 2018: 1463-1470 - [c27]Manuel Heusner, Thomas Keller, Malte Helmert:
Search Progress and Potentially Expanded States in Greedy Best-First Search. IJCAI 2018: 5269-5273 - 2017
- [c26]Jendrik Seipp, Thomas Keller, Malte Helmert:
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. AAAI 2017: 3651-3657 - [c25]Jendrik Seipp, Thomas Keller, Malte Helmert:
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. ICAPS 2017: 259-268 - [c24]Manuel Heusner, Thomas Keller, Malte Helmert:
Understanding the Search Behaviour of Greedy Best-First Search. SOCS 2017: 47-55 - [c23]Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert:
Optimal Solutions to Large Logistics Planning Domain Problems. SOCS 2017: 73-81 - 2016
- [j1]Danijel Skocaj, Alen Vrecko, Marko Mahnic, Miroslav Janícek, Geert-Jan M. Kruijff, Marc Hanheide, Nick Hawes, Jeremy L. Wyatt, Thomas Keller, Kai Zhou, Michael Zillich, Matej Kristan:
An integrated system for interactive continuous learning of categorical knowledge. J. Exp. Theor. Artif. Intell. 28(5): 823-848 (2016) - [c22]Florian Geißer, Thomas Keller, Robert Mattmüller:
Abstractions for Planning with State-Dependent Action Costs. ICAPS 2016: 140-148 - [c21]Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer, Robert Mattmüller:
State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning. IJCAI 2016: 3161-3169 - 2015
- [b1]Thomas Keller:
Anytime optimal MDP planning with trial-based heuristic tree search. University of Freiburg, Freiburg im Breisgau, Germany, 2015 - [c20]Thomas Keller, Florian Geißer:
Better Be Lucky than Good: Exceeding Expectations in MDP Evaluation. AAAI 2015: 3540-3547 - [c19]Florian Geißer, Thomas Keller, Robert Mattmüller:
Delete Relaxations for Planning with State-Dependent Action Costs. IJCAI 2015: 1573-1579 - [c18]Florian Geißer, Thomas Keller, Robert Mattmüller:
Delete Relaxations for Planning with State-Dependent Action Costs. SOCS 2015: 228-229 - 2014
- [c17]Florian Geißer, Thomas Keller, Robert Mattmüller:
Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games. ECAI 2014: 357-362 - [c16]Andreas Hertle, Christian Dornhege, Thomas Keller, Robert Mattmüller, Manuela Ortlieb, Bernhard Nebel:
An Experimental Comparison of Classical, FOND and Probabilistic Planning. KI 2014: 297-308 - [c15]Tim Schulte, Thomas Keller:
Balancing Exploration and Exploitation in Classical Planning. SOCS 2014: 139-147 - 2013
- [c14]Thomas Keller, Malte Helmert:
Trial-Based Heuristic Tree Search for Finite Horizon MDPs. ICAPS 2013 - [c13]Michael Zillich, Kai Zhou, Danijel Skocaj, Matej Kristan, Alen Vrecko, Miroslav Janícek, Geert-Jan M. Kruijff, Thomas Keller, Marc Hanheide, Nick Hawes, Marko Mahnic:
Robot george: interactive continuous learning of visual concepts. HRI 2013: 425-426 - 2012
- [c12]Thomas Keller, Patrick Eyerich:
PROST: Probabilistic Planning Based on UCT. ICAPS 2012 - [c11]Johannes Löhr, Patrick Eyerich, Thomas Keller, Bernhard Nebel:
A Planning Based Framework for Controlling Hybrid Systems. ICAPS 2012 - [c10]Andreas Hertle, Christian Dornhege, Thomas Keller, Bernhard Nebel:
Planning with Semantic Attachments: An Object-Oriented View. ECAI 2012: 402-407 - [p2]Christian Dornhege, Patrick Eyerich, Thomas Keller, Sebastian Trüg, Michael Brenner, Bernhard Nebel:
Semantic Attachments for Domain-Independent Planning Systems. Towards Service Robots for Everyday Environments 2012: 99-115 - [p1]Thomas Keller, Patrick Eyerich, Bernhard Nebel:
Task Planning for an Autonomous Service Robot. Towards Service Robots for Everyday Environments 2012: 117-124 - 2011
- [c9]Thomas Keller, Patrick Eyerich:
A Polynomial All Outcome Determinization for Probabilistic Planning. ICAPS 2011 - [c8]Danijel Skocaj, Matej Kristan, Alen Vrecko, Marko Mahnic, Miroslav Janícek, Geert-Jan M. Kruijff, Marc Hanheide, Nick Hawes, Thomas Keller, Michael Zillich, Kai Zhou:
A system for interactive learning in dialogue with a tutor. IROS 2011: 3387-3394 - 2010
- [c7]Christian Dornhege, Patrick Eyerich, Thomas Keller, Michael Brenner, Bernhard Nebel:
Integrating Task and Motion Planning Using Semantic Attachments. Bridging the Gap Between Task and Motion Planning 2010 - [c6]Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. AAAI 2010: 51-58 - [c5]Moritz Göbelbecker, Thomas Keller, Patrick Eyerich, Michael Brenner, Bernhard Nebel:
Coming Up With Good Excuses: What to do When no Plan Can be Found. ICAPS 2010: 81-88 - [c4]Thomas Keller, Patrick Eyerich, Bernhard Nebel:
Task Planning for an Autonomous Service Robot. KI 2010: 358-365 - [c3]Patrick Eyerich, Thomas Keller, Malte Helmert:
High-Quality Policies for the Canadian Traveler's Problem. SOCS 2010: 147-148 - [i1]Moritz Göbelbecker, Thomas Keller, Patrick Eyerich, Michael Brenner, Bernhard Nebel:
Coming up With Good Excuses: What to do When no Plan Can be Found. Cognitive Robotics 2010
2000 – 2009
- 2009
- [c2]Christian Dornhege, Patrick Eyerich, Thomas Keller, Sebastian Trüg, Michael Brenner, Bernhard Nebel:
Semantic Attachments for Domain-Independent Planning Systems. ICAPS 2009 - 2008
- [c1]Thomas Keller, Sebastian Kupferschmid:
Automatic Bidding for the Game of Skat. KI 2008: 95-102
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-07 01:01 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
