Thomas Keller

Gabriele Röger

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Transition Landmarks from Abstraction Cuts.

[BibT_eX]

[DOI]

Florian Pommerening

Clemens Büchner

Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

2023

Landmark Progression in Heuristic Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022

Learning and Exploiting Progress States in Greedy Best-First Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

Cost Partitioning Heuristics for Stochastic Shortest Path Problems.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021

Dantzig-Wolfe Decomposition for Cost Partitioning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Exploiting Cyclic Dependencies in Landmark Heuristics.

[BibT_eX]

[DOI]

Clemens Büchner

Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Saturated Post-hoc Optimization for Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

Saturated Cost Partitioning for Optimal Classical Planning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2020

Trial-Based Heuristic Tree Search for MDPs with Factored Action Spaces.

[BibT_eX]

[DOI]

David Speck

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

2019

Stochastic Planning with Lifted Symbolic Trajectory Optimization.

[BibT_eX]

[DOI]

Hao Cui

Roni Khardon

Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018

Search Progress and Potentially Expanded States in Greedy Best-First Search.

[BibT_eX]

[DOI]

Manuel Heusner

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Best-Case and Worst-Case Behavior of Greedy Best-First Search.

[BibT_eX]

[DOI]

Manuel Heusner

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Optimal Solutions to Large Logistics Planning Domain Problems.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Understanding the Search Behaviour of Greedy Best-First Search.

[BibT_eX]

[DOI]

Manuel Heusner

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

An integrated system for interactive continuous learning of categorical knowledge.

[BibT_eX]

[DOI]

J. Exp. Theor. Artif. Intell., 2016

State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Abstractions for Planning with State-Dependent Action Costs.

[BibT_eX]

[DOI]

Robert Mattmüller

Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015

Anytime optimal MDP planning with trial-based heuristic tree search.

[BibT_eX]

[DOI]

PhD thesis, 2015

Delete Relaxations for Planning with State-Dependent Action Costs.

[BibT_eX]

[DOI]

Robert Mattmüller

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Better Be Lucky than Good: Exceeding Expectations in MDP Evaluation.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014

Balancing Exploration and Exploitation in Classical Planning.

[BibT_eX]

[DOI]

Tim Schulte

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

An Experimental Comparison of Classical, FOND and Probabilistic Planning.

[BibT_eX]

[DOI]

Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games.

[BibT_eX]

[DOI]

Robert Mattmüller

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013

Robot george: interactive continuous learning of visual concepts.

[BibT_eX]

[DOI]

Proceedings of the ACM/IEEE International Conference on Human-Robot Interaction, 2013

Trial-Based Heuristic Tree Search for Finite Horizon MDPs.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012

Semantic Attachments for Domain-Independent Planning Systems.

[BibT_eX]

[DOI]

Proceedings of the Towards Service Robots for Everyday Environments, 2012

Task Planning for an Autonomous Service Robot.

[BibT_eX]

[DOI]

Bernhard Nebel

Proceedings of the Towards Service Robots for Everyday Environments, 2012

Planning with Semantic Attachments: An Object-Oriented View.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

A Planning Based Framework for Controlling Hybrid Systems.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

PROST: Probabilistic Planning Based on UCT.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

2011

A system for interactive learning in dialogue with a tutor.

[BibT_eX]

[DOI]

Proceedings of the 2011 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2011

A Polynomial All Outcome Determinization for Probabilistic Planning.

[BibT_eX]

[DOI]

Proceedings of the 21st International Conference on Automated Planning and Scheduling, 2011

2010

Task Planning for an Autonomous Service Robot.

[BibT_eX]

[DOI]

Bernhard Nebel

Proceedings of the KI 2010: Advances in Artificial Intelligence, 2010

Coming up With Good Excuses: What to do When no Plan Can be Found.

[BibT_eX]

[DOI]

Proceedings of the Cognitive Robotics, 21.02. - 26.02.2010, 2010

High-Quality Policies for the Canadian Traveler's Problem.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

Integrating Task and Motion Planning Using Semantic Attachments.

[BibT_eX]

[DOI]

Proceedings of the Bridging the Gap Between Task and Motion Planning, 2010

2009

Semantic Attachments for Domain-Independent Planning Systems.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

Automatic Bidding for the Game of Skat.

[BibT_eX]

[DOI]