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

von Sievers, Silvan
Veröffentlicht in International Symposium on Combinatorial Search (11. : 2018 : Stockholm) Proceedings of the Eleventh International Symposium on Combinatorial Search (SoCS 2018) (2018)

Symmetry-Based Task Reduction for Relaxed Reachability Analysis

von Röger, Gabriele
Veröffentlicht in International Conference on Automated Planning and Scheduling (28. : 2018 : Delft) Proceedings of the Twenty-eighth International Conference on Automated Planning and Scheduling (2018)

AUTOMATIC INSTANCE GENERATION FOR CLASSICAL PLANNING

von Torralba, Alvaro
Veröffentlicht in International Conference on Automated Planning and Scheduling (31. : 2021 : Online) Thirty-first International Conference on Automated Planning and Scheduling (ICAPS 2021) (2021)

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

von Rovner, Alexander
Veröffentlicht in International Conference on Automated Planning and Scheduling (29. : 2019 : Berkeley, Calif.) Proceedings of the Twenty-ninth International Conference on Automated Planning and Scheduling (2019)

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

von Gnad, Daniel
Veröffentlicht in International Conference on Automated Planning and Scheduling (33. : 2023 : Prag) Thirty-third International Conference on Automated Planning and Scheduling (ICAPS 2023) (2023)

Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks

von Sievers, Silvan
Veröffentlicht in International Conference on Automated Planning and Scheduling (29. : 2019 : Berkeley, Calif.) Proceedings of the Twenty-ninth International Conference on Automated Planning and Scheduling (2019)

An Atom-Centric Perspective on Stubborn Sets

von Röger, Gabriele
Veröffentlicht in International Symposium on Combinatorial Search (13. : 2020 : Online) Proceedings of the Thirteenth International Symposium on Combinatorial Search (SoCS 2020) (2020)

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

von Klößner, Thorsten
Veröffentlicht in International Conference on Automated Planning and Scheduling (33. : 2023 : Prag) Thirty-third International Conference on Automated Planning and Scheduling (ICAPS 2023) (2023)

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

von Kreft, Raphael
Veröffentlicht in International Conference on Automated Planning and Scheduling (33. : 2023 : Prag) Thirty-third International Conference on Automated Planning and Scheduling (ICAPS 2023) (2023)

DANTZIG-WOLFE DECOMPOSITION FOR COST PARTITIONING

von Pommerening, Florian
Veröffentlicht in International Conference on Automated Planning and Scheduling (31. : 2021 : Online) Thirty-first International Conference on Automated Planning and Scheduling (ICAPS 2021) (2021)