Silvan Sievers

Thomas Keller

Gabriele Röger

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

Merge-and-Shrink Heuristics for SSPs with Prune Transformations.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 2024

2023

PARIS: Planning Algorithms for Reconfiguring Independent Sets.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement.

[BibT_eX]

[DOI]

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

A Theory of Merge-and-Shrink for Stochastic Shortest Path Problems.

[BibT_eX]

[DOI]

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

Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases.

[BibT_eX]

[DOI]

Daniel Gnad

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

2022

Additive Pattern Databases for Decoupled Search.

[BibT_eX]

[DOI]

Daniel Gnad

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond.

[BibT_eX]

[DOI]

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

2021

Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2021

On Weak Stubborn Sets in Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Automatic Instance Generation for Classical Planning.

[BibT_eX]

[DOI]

Jendrik Seipp

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

Dantzig-Wolfe Decomposition for Cost Partitioning.

[BibT_eX]

[DOI]

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

2020

An Atom-Centric Perspective on Stubborn Sets.

[BibT_eX]

[DOI]

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

Merge-and-Shrink Task Reformulation for Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks.

[BibT_eX]

[DOI]

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

Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning.

[BibT_eX]

[DOI]

Alexander Rovner

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

Deep Learning for Cost-Optimal Planning: Task-Dependent Planner Selection.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Merge-and-Shrink Heuristics for Classical Planning: Efficient Implementation and Partial Abstractions.

[BibT_eX]

[DOI]

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Symmetry-Based Task Reduction for Relaxed Reachability Analysis.

[BibT_eX]

[DOI]

Gabriele Röger

Michael Katz

Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017

Strengthening Canonical Pattern Databases with Structural Symmetries.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

2016

Graph-Based Factorization of Classical Planning Problems.

[BibT_eX]

[DOI]

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

An Analysis of Merge Strategies for Merge-and-Shrink Heuristics.

[BibT_eX]

[DOI]

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

2015

An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search.

[BibT_eX]

[DOI]

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

A Doppelkopf Player Based on UCT.

[BibT_eX]

[DOI]

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

On the Expressive Power of Non-Linear Merge-and-Shrink Representations.

[BibT_eX]

[DOI]

Gabriele Röger

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Factored Symmetries for Merge-and-Shrink Abstractions.

[BibT_eX]

[DOI]

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

Heuristics and Symmetries in Classical Planning.

[BibT_eX]

[DOI]

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

Automatic Configuration of Sequential Planning Portfolios.

[BibT_eX]

[DOI]

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

2014

Bounded Intention Planning Revisited.

[BibT_eX]

[DOI]

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

Generalized Label Reduction for Merge-and-Shrink Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2012

Efficient Implementation of Pattern Database Heuristics for Classical Planning.

[BibT_eX]

[DOI]

Manuela Ortlieb