Álvaro Torralba

Dataset, March, 2024

Optimal Infinite Temporal Planning: Cyclic Plans for Priced Timed Automata.

[BibT_eX]

[DOI]

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

Computing Planning Centroids and Minimum Covering States Using Symbolic Bidirectional Search.

[BibT_eX]

[DOI]

Alberto Pozanco

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

Gotta Catch 'Em All! Sequence Flaws in CEGAR for Classical Planning.

[BibT_eX]

[DOI]

Martín Pozo

Proceedings of the ECAI 2024 - 27th European Conference on Artificial Intelligence, 19-24 October 2024, Santiago de Compostela, Spain, 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

When CEGAR Meets Regression: A Love Story in Optimal Classical Planning.

[BibT_eX]

[DOI]

Martín Pozo

Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023

Can I Really Do That? Verification of Meta-Operators via Stackelberg Planning.

[BibT_eX]

[DOI]

Florian Pham

Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 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

Automatic Metamorphic Test Oracles for Action-Policy Testing.

[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]

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

Reshaping State-Space Search: From Dominance to Contrastive Analysis.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

PDDL Generators.

[BibT_eX]

[DOI]

Jendrik Seipp

Dataset, March, 2022

Scaling up ML-based Black-box Planning with Partial STRIPS Models.

[BibT_eX]

[DOI]

CoRR, 2022

Additive Pattern Databases for Decoupled Search.

[BibT_eX]

[DOI]

Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

NetStack: A Game Approach to Synthesizing Consistent Network Updates.

[BibT_eX]

[DOI]

Stefan Schmid

Bernhard Clemens Schrenk

Proceedings of the IFIP Networking Conference, 2022

Pattern Selection Strategies for Pattern Databases in Probabilistic Planning.

[BibT_eX]

[DOI]

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

Optimal Mixed Strategies for Cost-Adversarial Planning Games.

[BibT_eX]

[DOI]

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

Beyond Stars - Generalized Topologies for Decoupled Search.

[BibT_eX]

[DOI]

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

Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search.

[BibT_eX]

[DOI]

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

Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics.

[BibT_eX]

[DOI]

Rostislav Horcík

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

Operator-Potential Heuristics for Symbolic Search.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted 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

Pattern Databases for Goal-Probability Maximization in Probabilistic Planning.

[BibT_eX]

[DOI]

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

Faster Stackelberg Planning via Symbolic Search and Information Sharing.

[BibT_eX]

[DOI]

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

On the Optimal Efficiency of A* with Dominance Pruning.

[BibT_eX]

[DOI]

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

2020

Applying Monte-Carlo Tree Search in HTN Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

MC-Saar-Instruct: a Platform for Minecraft Instruction Giving Agents.

[BibT_eX]

[DOI]

Proceedings of the 21th Annual Meeting of the Special Interest Group on Discourse and Dialogue, 2020

Plan-Space Explanation via Plan-Property Dependencies: Faster Algorithms & More Powerful Properties.

[BibT_eX]

[DOI]

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

Generating Instructions at Different Levels of Abstraction.

[BibT_eX]

[DOI]

Proceedings of the 28th International Conference on Computational Linguistics, 2020

Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning.

[BibT_eX]

[DOI]

Joschka Gross

Maximilian Fickert

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Interleaving Search and Heuristic Improvement.

[BibT_eX]

[DOI]

Santiago Franco

Proceedings of the Twelfth International Symposium on Combinatorial Search, 2019

Merge-and-Shrink Task Reformulation for Classical Planning.

[BibT_eX]

[DOI]

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

Bridging the Gap between Abstractions and Critical-Path Heuristics via Hypergraphs.

[BibT_eX]

[DOI]

Marcel Steinmetz

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

Symbolic Planning with Axioms.

[BibT_eX]

[DOI]

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

Learning How to Ground a Plan - Partial Grounding in Classical Planning.

[BibT_eX]

[DOI]

Martín Ariel Domínguez

Carlos Areces

Facundo Bustos

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

Operator Mutexes and Symmetries for Simplifying Planning Tasks.

[BibT_eX]

[DOI]

Alexander Shleyfman

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

2018

Symbolic perimeter abstraction heuristics for cost-optimal planning.

[BibT_eX]

[DOI]

Artif. Intell., 2018

Completeness-Preserving Dominance Techniques for Satisficing Planning.

[BibT_eX]

[DOI]

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

2017

Efficient symbolic search for cost-optimal planning.

[BibT_eX]

[DOI]

Artif. Intell., 2017

Symbolic Leaf Representation in Decoupled Search.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

From Qualitative to Quantitative Dominance Pruning for Optimal Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

On Creating Complementary Pattern Databases.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

Symmetry Breaking in Star-Topology Decoupled Search.

[BibT_eX]

[DOI]

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

2016

Search Challenges in Natural Language Generation with Complex Optimization Objectives.

[BibT_eX]

[DOI]

Künstliche Intell., 2016

Abstraction Heuristics for Symbolic Bidirectional Search.

[BibT_eX]

[DOI]

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

On State-Dominance Criteria in Fork-Decoupled Search.

[BibT_eX]

[DOI]

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

From OpenCCG to AI Planning: Detecting Infeasible Edges in Sentence Generation.

[BibT_eX]

[DOI]

Proceedings of the COLING 2016, 2016

Practical Undoability Checking via Contingent Planning.

[BibT_eX]

[DOI]

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

TIMIPLAN: A Tool for Transportation Tasks.

[BibT_eX]

[DOI]

Proceedings of the Autonomic Road Transport Support Systems, 2016

2015

Focusing on What Really Matters: Irrelevance Pruning in Merge-and-Shrink.

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Simulation-Based Admissible Dominance Pruning.

[BibT_eX]

[DOI]

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

A Reminder about the Importance of Computing and Exploiting Invariants in Planning.

[BibT_eX]

[DOI]

Vidal Alcázar

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

BDDs Strike Back (in AI Planning).

[BibT_eX]

[DOI]

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

2014

"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability.

[BibT_eX]

[DOI]

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

2013

Combining linear programming and automated planning to solve intermodal transportation problems.

[BibT_eX]

[DOI]

Javier García

José E. Flórez

Eur. J. Oper. Res., 2013

Constrained Symbolic Search: On Mutexes, BDD Minimization and More.

[BibT_eX]

[DOI]

Vidal Alcázar

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Symbolic Merge-and-Shrink for Cost-Optimal Planning.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

Transition Trees for Cost-Optimal Symbolic Planning.

[BibT_eX]

[DOI]

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

2012

Lex-Partitioning: A New Option for BDD Search

[BibT_eX]

[DOI]

Proceedings of the Proceedings First Workshop on GRAPH Inspection and Traversal Engineering, 2012

Precomputed-Direction Heuristics for Suboptimal Grid-Based Path-finding.

[BibT_eX]

[DOI]

Álvaro Parra

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Symbolic A<sup>*</sup> Search with Pattern Databases and the Merge-and-Shrink Abstraction.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

2011

Size-Independent Additive Pattern Databases for the Pancake Problem.

[BibT_eX]

[DOI]

Proceedings of the Fourth Annual Symposium on Combinatorial Search, 2011

Planning Multi-Modal Transportation Problems.

[BibT_eX]

[DOI]

José E. Flórez