Skip to main content
Vai all'homepage della Commissione europea (si apre in una nuova finestra)
italiano italiano
CORDIS - Risultati della ricerca dell’UE
CORDIS

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

CORDIS fornisce collegamenti ai risultati finali pubblici e alle pubblicazioni dei progetti ORIZZONTE.

I link ai risultati e alle pubblicazioni dei progetti del 7° PQ, così come i link ad alcuni tipi di risultati specifici come dataset e software, sono recuperati dinamicamente da .OpenAIRE .

Pubblicazioni

Learning and Exploiting Progress States in Greedy Best-First Search (si apre in una nuova finestra)

Autori: Patrick Ferber, Liat Cohen, Jendrik Seipp, Thomas Keller
Pubblicato in: Proceedings of the 31st International Joint Conference on Artificial Intelligence (IJCAI 2022), 2022, Pagina/e 4740-4746
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2022/657

Saturated Post-hoc Optimization for Classical Planning (si apre in una nuova finestra)

Autori: Jendrik Seipp, Thomas Keller, Malte Helmert
Pubblicato in: Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), 2021, Pagina/e 11947-11953
Editore: AAAI Press
DOI: 10.5451/unibas-ep84299

Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning (si apre in una nuova finestra)

Autori: Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert
Pubblicato in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Pagina/e 4152-4160, ISBN 978-0-9992411-6-5
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/574

Lagrangian Decomposition for Optimal Cost Partitioning

Autori: Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
Pubblicato in: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Pagina/e 338-347
Editore: AAAI Press

An Empirical Study of Perfect Potential Heuristics

Autori: Augusto B. Corrêa, Florian Pommerening
Pubblicato in: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Pagina/e 114-118
Editore: AAAI Press

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

Autori: Simon Dold,Malte Helmert
Pubblicato in: Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024
Editore: AAAI Press

Subset-Saturated Cost Partitioning for Optimal Classical Planning

Autori: Jendrik Seipp, Malte Helmert
Pubblicato in: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Pagina/e 391-400
Editore: AAAI Press

Dantzig-Wolfe Decomposition for Cost Partitioning (si apre in una nuova finestra)

Autori: Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert
Pubblicato in: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Pagina/e 271-280
Editore: AAAI Press
DOI: 10.5451/unibas-ep84307

Theoretical Foundations for Structural Symmetries of Lifted PDDL Tasks

Autori: Silvan Sievers, Gabriele Röger, Martin Wehrle, Michael Katz
Pubblicato in: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Pagina/e 446-454
Editore: AAAI Press

Additive Pattern Databases for Decoupled Search (si apre in una nuova finestra)

Autori: Silvan Sievers, Daniel Gnad, Álvaro Torralba
Pubblicato in: Proceedings of the 15th International Symposium on Combinatorial Search (SoCS 2022), 2022, Pagina/e 180-189
Editore: AAAI Press
DOI: 10.1609/socs.v15i1.21766

Landmark Progression in Heuristic Search (si apre in una nuova finestra)

Autori: Clemens Büchner, Thomas Keller, Salomé Eriksson, Malte Helmert
Pubblicato in: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Pagina/e 70-79
Editore: AAAI Press
DOI: 10.1609/icaps.v33i1.27180

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

Autori: Florian Geißer, David Speck, Thomas Keller
Pubblicato in: Proceedings of the 13th Annual Symposium on Combinatorial Search (SoCS 2020), 2020, Pagina/e 38-47
Editore: AAAI Press

Pattern Selection for Optimal Classical Planning with Saturated Cost Partitioning (si apre in una nuova finestra)

Autori: Jendrik Seipp
Pubblicato in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Pagina/e 5621-5627, ISBN 978-0-9992411-4-1
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2019/780

Subset-Saturated Transition Cost Partitioning (si apre in una nuova finestra)

Autori: Dominik Drexler, Jendrik Seipp, David Speck
Pubblicato in: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Pagina/e 131-139
Editore: AAAI Press
DOI: 10.5451/unibas-ep84301

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

Autori: Silvan Sievers, Thomas Keller, Gabriele Röger
Pubblicato in: Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024
Editore: AAAI Press

On Weak Stubborn Sets in Classical Planning (si apre in una nuova finestra)

Autori: Silvan Sievers, Martin Wehrle
Pubblicato in: Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021, Pagina/e 4167-4174, ISBN 978-0-9992411-9-6
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2021/573

An Analysis of the Probabilistic Track of the IPC 2018

Autori: Florian Geißer, David Speck, Thomas Keller
Pubblicato in: Proceedings of the ICAPS-2019 Workshop on the International Planning Competition (WIPC 2019), 2019, Pagina/e 27-35
Editore: Workshop on the International Planning Competition

Iterative Budgeted Exponential Search (si apre in una nuova finestra)

Autori: Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant
Pubblicato in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Pagina/e 1249-1257, ISBN 978-0-9992411-4-1
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2019/174

Kronk (planner abstract)

Autori: Jendrik Seipp
Pubblicato in: Proceedings of the Sparkle Planning Challenge 2019, 2019
Editore: Sparkle Planning Challenge 2019

Detecting Unsolvability Based on Separating Functions (si apre in una nuova finestra)

Autori: Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert
Pubblicato in: Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), 2022, Pagina/e 44-52
Editore: AAAI Press
DOI: 10.1609/icaps.v32i1.19784

A Comparison of Abstraction Heuristics for Rubik's Cube

Autori: Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert
Pubblicato in: Proceedings of the ICAPS 2022 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2022), 2022
Editore: Workshop on Heuristics and Search for Domain-Independent Planning

Lagrangian Decomposition for Classical Planning (Extended Abstract) (si apre in una nuova finestra)

Autori: Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazad, Louis-Martin Rousseau, Domenico Salvagnin
Pubblicato in: Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020, Pagina/e 4770-4774, ISBN 978-0-9992411-6-5
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2020/663

A Theory of Merge-and-Shrink for Stochastic Shortest Path Problems (si apre in una nuova finestra)

Autori: Thorsten Klößner, Álvaro Torralba, Marcel Steinmetz, Silvan Sievers
Pubblicato in: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Pagina/e 203-211
Editore: AAAI Press
DOI: 10.1609/icaps.v33i1.27196

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

Autori: Jendrik Seipp
Pubblicato in: Proceedings of the ICAPS-2019 Workshop on the International Planning Competition (WIPC 2019), 2019, Pagina/e 40-41
Editore: Workshop on the International Planning Competition

Transition Landmarks from Abstraction Cuts

Autori: Florian Pommerening, Clemens Büchner, Thomas Keller
Pubblicato in: Proceedings of the 34th International Conference on Automated Planning and Scheduling (ICAPS 2024), 2024
Editore: AAAI Press

On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond (si apre in una nuova finestra)

Autori: Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa
Pubblicato in: Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), 2022, Pagina/e 124-133
Editore: AAAI Press
DOI: 10.1609/icaps.v32i1.19793

Efficient Evaluation of Large Abstractions for Decoupled Search: Merge-and-Shrink and Symbolic Pattern Databases (si apre in una nuova finestra)

Autori: Daniel Gnad, Silvan Sievers, Álvaro Torralba
Pubblicato in: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Pagina/e 138-147
Editore: AAAI Press
DOI: 10.1609/icaps.v33i1.27188

Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement

Autori: Jendrik Seipp, Samuel von Allmen, Malte Helmert
Pubblicato in: Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020), 2020, Pagina/e 244-248
Editore: AAAI Press

Online Saturated Cost Partitioning for Classical Planning (si apre in una nuova finestra)

Autori: Jendrik Seipp
Pubblicato in: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Pagina/e 317-321
Editore: AAAI Press
DOI: 10.5451/unibas-ep84300

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

Autori: Simon Dold, Malte Helmert
Pubblicato in: Proceedings of the 38th AAAI Conference on Artificial Intelligence (AAAI 2024), 2024
Editore: AAAI Press

Merge-and-Shrink Task Reformulation for Classical Planning (si apre in una nuova finestra)

Autori: Álvaro Torralba, Silvan Sievers
Pubblicato in: Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019, Pagina/e 5644-5652, ISBN 978-0-9992411-4-1
Editore: International Joint Conferences on Artificial Intelligence Organization
DOI: 10.24963/ijcai.2019/783

Exploiting Cyclic Dependencies in Landmark Heuristics (si apre in una nuova finestra)

Autori: Clemens Büchner, Thomas Keller, Malte Helmert
Pubblicato in: Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), 2021, Pagina/e 65-73
Editore: AAAI Press
DOI: 10.5451/unibas-ep84308

An Atom-Centric Perspective on Stubborn Sets

Autori: Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers
Pubblicato in: Proceedings of the 13th Annual Symposium on Combinatorial Search (SoCS 2020), 2020, Pagina/e 57-65
Editore: AAAI Press

LM-BFS: A Framework for Landmarks in Planning

Autori: Clemens Büchner, Thomas Keller
Pubblicato in: Proceedings of the ICAPS 2021 Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2021), 2021
Editore: Workshop on Heuristics and Search for Domain-Independent Planning

Stochastic Planning with Lifted Symbolic Trajectory Optimization

Autori: Hao Cui, Thomas Keller, Roni Khardon
Pubblicato in: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Pagina/e 119-127
Editore: AAAI Press

Neural Network Heuristic Functions: Taking Confidence into Account (si apre in una nuova finestra)

Autori: Daniel Heller, Patrick Ferber, Julian Bitterwolf, Matthias Hein, Jörg Hoffmann
Pubblicato in: Proceedings of the 15th International Symposium on Combinatorial Search (SoCS 2022), 2022, Pagina/e 223-228
Editore: AAAI Press
DOI: 10.1609/socs.v15i1.21771

Oversubscription Planning as Classical Planning with Multiple Cost Functions

Autori: Michael Katz, Emil Keyder, Florian Pommerening, Dominik Winterer
Pubblicato in: Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), 2019, Pagina/e 237-245
Editore: AAAI Press

Cost Partitioning Heuristics for Stochastic Shortest Path Problems (si apre in una nuova finestra)

Autori: Thorsten Klößner, Florian Pommerening, Thomas Keller, Gabriele Röger
Pubblicato in: Proceedings of the 32nd International Conference on Automated Planning and Scheduling (ICAPS 2022), 2022, Pagina/e 193-202
Editore: AAAI Press
DOI: 10.1609/icaps.v32i1.19802

Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement (si apre in una nuova finestra)

Autori: Raphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert
Pubblicato in: Proceedings of the 33rd International Conference on Automated Planning and Scheduling (ICAPS 2023), 2023, Pagina/e 221-226
Editore: AAAI Press
DOI: 10.1609/icaps.v33i1.27198

Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems (si apre in una nuova finestra)

Autori: Silvan Sievers, Malte Helmert
Pubblicato in: Journal of Artificial Intelligence Research, Numero 71, 2021, Pagina/e 781-883, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.12557

Saturated Cost Partitioning for Optimal Classical Planning (si apre in una nuova finestra)

Autori: Jendrik Seipp, Thomas Keller, Malte Helmert
Pubblicato in: Journal of Artificial Intelligence Research, Numero 67, 2020, Pagina/e 129-167, ISSN 1076-9757
Editore: Morgan Kaufmann Publishers, Inc.
DOI: 10.1613/jair.1.11673

È in corso la ricerca di dati su OpenAIRE...

Si è verificato un errore durante la ricerca dei dati su OpenAIRE

Nessun risultato disponibile

Il mio fascicolo 0 0