Beyond Distance Estimates: A New Theory of Heuristics for State-Space Search

Informacje na temat projektu

BDE

Identyfikator umowy o grant: 817639

DOI

10.3030/817639

Projekt został zamknięty

Data podpisania przez KE 18 Grudnia 2018

Data rozpoczęcia 1 Lutego 2019

Data zakończenia 31 Stycznia 2024

Finansowanie w ramach

• EXCELLENT SCIENCE - European Research Council (ERC)

Koszt całkowity

€ 1 997 510,00

Wkład UE

€ 1 997 510,00

Koordynowany przez

UNIVERSITAT BASEL
Switzerland

CORDIS oferuje możliwość skorzystania z odnośników do publicznie dostępnych publikacji i rezultatów projektów realizowanych w ramach programów ramowych HORYZONT.

Odnośniki do rezultatów i publikacji związanych z poszczególnymi projektami 7PR, a także odnośniki do niektórych konkretnych kategorii wyników, takich jak zbiory danych i oprogramowanie, są dynamicznie pobierane z systemu OpenAIRE .

Publikacje

Conference proceedings (39)

Learning and Exploiting Progress States in Greedy Best-First Search

Autorzy: Patrick Ferber, Liat Cohen, Jendrik Seipp, Thomas Keller
Opublikowane w: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2022, Strona(/y) 4740-4746
Wydawca: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2022/657

Saturated Post-hoc Optimization for Classical Planning

Autorzy: Jendrik Seipp, Thomas Keller, Malte Helmert
Opublikowane w: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), 2021, Strona(/y) 11947-11953
Wydawca: AAAI Press
DOI: 10.5451/unibas-ep84299

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

Autorzy: Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert
Opublikowane w: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Strona(/y) 4152-4160, ISBN 978-0-9992411-6-5
Wydawca: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/574

Lagrangian Decomposition for Optimal Cost Partitioning

Autorzy: Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
Opublikowane w: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Strona(/y) 338-347
Wydawca: AAAI Press

An Empirical Study of Perfect Potential Heuristics

Autorzy: Augusto B. Corrêa, Florian Pommerening
Opublikowane w: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Strona(/y) 114-118
Wydawca: AAAI Press

Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity

Autorzy: Simon Dold,Malte Helmert
Opublikowane w: Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024
Wydawca: AAAI Press

Subset-Saturated Cost Partitioning for Optimal Classical Planning

Autorzy: Jendrik Seipp, Malte Helmert
Opublikowane w: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Strona(/y) 391-400
Wydawca: AAAI Press

Dantzig-Wolfe Decomposition for Cost Partitioning

Autorzy: Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert
Opublikowane w: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Strona(/y) 271-280
Wydawca: AAAI Press
DOI: 10.5451/unibas-ep84307

Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks

Autorzy: Silvan Sievers, Gabriele Röger, Martin Wehrle, Michael Katz
Opublikowane w: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Strona(/y) 446-454
Wydawca: AAAI Press

Additive Pattern Databases for Decoupled Search

Autorzy: Silvan Sievers, Daniel Gnad, Álvaro Torralba
Opublikowane w: Proceedings of the 15th International Symposium on Combinatorial Search (SoCS 2022), 2022, Strona(/y) 180-189
Wydawca: AAAI Press
DOI: 10.1609/socs.v15i1.21766

Landmark Progression in Heuristic Search

Autorzy: Clemens Büchner, Thomas Keller, Salomé Eriksson, Malte Helmert
Opublikowane w: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Strona(/y) 70-79
Wydawca: AAAI Press
DOI: 10.1609/icaps.v33i1.27180

Trial-based Heuristic Tree Search for MDPs with Factored Action Spaces

Autorzy: Florian Geißer, David Speck, Thomas Keller
Opublikowane w: Proceedings of the 13th Annual Symposium on Combinatorial Search (SoCS 2020), 2020, Strona(/y) 38-47
Wydawca: AAAI Press

Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning

Autorzy: Jendrik Seipp
Opublikowane w: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Strona(/y) 5621-5627, ISBN 978-0-9992411-4-1
Wydawca: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2019/780

Subset-Saturated Transition Cost Partitioning

Autorzy: Dominik Drexler, Jendrik Seipp, David Speck
Opublikowane w: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Strona(/y) 131-139
Wydawca: AAAI Press
DOI: 10.5451/unibas-ep84301

Merging or Computing Saturated Cost Partitionings? A Merge Strategy for the Merge-and-Shrink Framework

Autorzy: Silvan Sievers, Thomas Keller, Gabriele Röger
Opublikowane w: Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024
Wydawca: AAAI Press

On Weak Stubborn Sets in Classical Planning

Autorzy: Silvan Sievers, Martin Wehrle
Opublikowane w: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021, Strona(/y) 4167-4174, ISBN 978-0-9992411-9-6
Wydawca: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2021/573

An Analysis of the Probabilistic Track of the IPC 2018

Autorzy: Florian Geißer, David Speck, Thomas Keller
Opublikowane w: Proceedings of the ICAPS-2019 Workshop on the International Planning Competition (WIPC 2019), 2019, Strona(/y) 27-35
Wydawca: Workshop on the International Planning Competition

Iterative Budgeted Exponential Search

Autorzy: Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant
Opublikowane w: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Strona(/y) 1249-1257, ISBN 978-0-9992411-4-1
Wydawca: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2019/174

Kronk (planner abstract)

Autorzy: Jendrik Seipp
Opublikowane w: Proceedings of the Sparkle Planning Challenge 2019, 2019
Wydawca: Sparkle Planning Challenge 2019

Detecting Unsolvability Based on Separating Functions

Autorzy: Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert
Opublikowane w: Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), 2022, Strona(/y) 44-52
Wydawca: AAAI Press
DOI: 10.1609/icaps.v32i1.19784

A Comparison of Abstraction Heuristics for Rubik's Cube

Autorzy: Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert
Opublikowane w: Proceedings of the ICAPS 2022 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2022), 2022
Wydawca: Workshop on Heuristics and Search for Domain-Independent Planning

Lagrangian Decomposition for Classical Planning (Extended Abstract)

Autorzy: Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazad, Louis-Martin Rousseau, Domenico Salvagnin
Opublikowane w: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Strona(/y) 4770-4774, ISBN 978-0-9992411-6-5
Wydawca: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/663

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

Autorzy: Thorsten Klößner, Álvaro Torralba, Marcel Steinmetz, Silvan Sievers
Opublikowane w: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Strona(/y) 203-211
Wydawca: AAAI Press
DOI: 10.1609/icaps.v33i1.27196

Planner Metrics Should Satisfy Independence of Irrelevant Alternatives (position paper)

Autorzy: Jendrik Seipp
Opublikowane w: Proceedings of the ICAPS-2019 Workshop on the International Planning Competition (WIPC 2019), 2019, Strona(/y) 40-41
Wydawca: Workshop on the International Planning Competition

Transition Landmarks from Abstraction Cuts

Autorzy: Florian Pommerening, Clemens Büchner, Thomas Keller
Opublikowane w: Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024
Wydawca: AAAI Press

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

Autorzy: Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa
Opublikowane w: Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), 2022, Strona(/y) 124-133
Wydawca: AAAI Press
DOI: 10.1609/icaps.v32i1.19793

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

Autorzy: Daniel Gnad, Silvan Sievers, Álvaro Torralba
Opublikowane w: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Strona(/y) 138-147
Wydawca: AAAI Press
DOI: 10.1609/icaps.v33i1.27188

Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement

Autorzy: Jendrik Seipp, Samuel von Allmen, Malte Helmert
Opublikowane w: Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020), 2020, Strona(/y) 244-248
Wydawca: AAAI Press

Online Saturated Cost Partitioning for Classical Planning

Autorzy: Jendrik Seipp
Opublikowane w: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Strona(/y) 317-321
Wydawca: AAAI Press
DOI: 10.5451/unibas-ep84300

Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning

Autorzy: Simon Dold, Malte Helmert
Opublikowane w: Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024), 2024
Wydawca: AAAI Press

Merge-and-Shrink Task Reformulation for Classical Planning

Autorzy: Álvaro Torralba, Silvan Sievers
Opublikowane w: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Strona(/y) 5644-5652, ISBN 978-0-9992411-4-1
Wydawca: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2019/783

Exploiting Cyclic Dependencies in Landmark Heuristics

Autorzy: Clemens Büchner, Thomas Keller, Malte Helmert
Opublikowane w: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Strona(/y) 65-73
Wydawca: AAAI Press
DOI: 10.5451/unibas-ep84308

An Atom-Centric Perspective on Stubborn Sets

Autorzy: Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers
Opublikowane w: Proceedings of the 13th Annual Symposium on Combinatorial Search (SoCS 2020), 2020, Strona(/y) 57-65
Wydawca: AAAI Press

LM-BFS: A Framework for Landmarks in Planning

Autorzy: Clemens Büchner, Thomas Keller
Opublikowane w: Proceedings of the ICAPS 2021 Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2021), 2021
Wydawca: Workshop on Heuristics and Search for Domain-Independent Planning

Stochastic Planning with Lifted Symbolic Trajectory Optimization

Autorzy: Hao Cui, Thomas Keller, Roni Khardon
Opublikowane w: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Strona(/y) 119-127
Wydawca: AAAI Press

Neural Network Heuristic Functions: Taking Confidence into Account

Autorzy: Daniel Heller, Patrick Ferber, Julian Bitterwolf, Matthias Hein, Jörg Hoffmann
Opublikowane w: Proceedings of the 15th International Symposium on Combinatorial Search (SoCS 2022), 2022, Strona(/y) 223-228
Wydawca: AAAI Press
DOI: 10.1609/socs.v15i1.21771

Oversubscription Planning as Classical Planning with Multiple Cost Functions

Autorzy: Michael Katz, Emil Keyder, Florian Pommerening, Dominik Winterer
Opublikowane w: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Strona(/y) 237-245
Wydawca: AAAI Press

Cost Partitioning Heuristics for Stochastic Shortest Path Problems

Autorzy: Thorsten Klößner, Florian Pommerening, Thomas Keller, Gabriele Röger
Opublikowane w: Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), 2022, Strona(/y) 193-202
Wydawca: AAAI Press
DOI: 10.1609/icaps.v32i1.19802

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

Autorzy: Raphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert
Opublikowane w: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Strona(/y) 221-226
Wydawca: AAAI Press
DOI: 10.1609/icaps.v33i1.27198

Peer reviewed articles (2)

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

Autorzy: Silvan Sievers, Malte Helmert
Opublikowane w: Journal of Artificial Intelligence Research, Numer 71, 2021, Strona(/y) 781-883, ISSN 1076-9757
Wydawca: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12557

Saturated Cost Partitioning for Optimal Classical Planning

Autorzy: Jendrik Seipp, Thomas Keller, Malte Helmert
Opublikowane w: Journal of Artificial Intelligence Research, Numer 67, 2020, Strona(/y) 129-167, ISSN 1076-9757
Wydawca: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.11673