Malte Helmert

Samuel von Allmen

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Certified Unsolvability for SAT Planning with Property Directed Reachability.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Lifted Successor Generation Using Query Optimization Techniques.

[BibT_eX]

[DOI]

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Planen.

[BibT_eX]

[DOI]

Proceedings of the Handbuch der Künstlichen Intelligenz, 6. Auflage, 2020

2019

Exponential-Binary State-Space Search.

[BibT_eX]

[DOI]

CoRR, 2019

Iterative Budgeted Exponential Search.

[BibT_eX]

[DOI]

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

Subset-Saturated Cost Partitioning for Optimal Classical Planning.

[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

Lagrangian Decomposition for Optimal Cost Partitioning.

[BibT_eX]

[DOI]

Louis-Martin Rousseau

Domenico Salvagnin

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

2018

Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2018

Search Progress and Potentially Expanded States in Greedy Best-First Search.

[BibT_eX]

[DOI]

Manuel Heusner

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

Best-Case and Worst-Case Behavior of Greedy Best-First Search.

[BibT_eX]

[DOI]

Manuel Heusner

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

Inductive Certificates of Unsolvability for Domain-Independent Planning.

[BibT_eX]

[DOI]

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

A Proof System for Unsolvable Planning Tasks.

[BibT_eX]

[DOI]

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

Optimal Solutions to Large Logistics Planning Domain Problems.

[BibT_eX]

[DOI]

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Understanding the Search Behaviour of Greedy Best-First Search.

[BibT_eX]

[DOI]

Manuel Heusner

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

On Variable Dependencies and Compressed Pattern Databases.

[BibT_eX]

[DOI]

Ariel Felner

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.

[BibT_eX]

[DOI]

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

Abstraction Heuristics, Cost Partitioning and Network Flows.

[BibT_eX]

[DOI]

Blai Bonet

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

Unsolvability Certificates for Classical Planning.

[BibT_eX]

[DOI]

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

Value Compression of Pattern Databases.

[BibT_eX]

[DOI]

Ariel Felner

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Higher-Dimensional Potential Heuristics for Optimal Classical Planning.

[BibT_eX]

[DOI]

Blai Bonet

Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016

Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis.

[BibT_eX]

[DOI]

Gerald Paul

Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Graph-Based Factorization of Classical Planning Problems.

[BibT_eX]

[DOI]

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

Correlation Complexity of Classical Planning Domains.

[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

Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning.

[BibT_eX]

[DOI]

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

Heuristics for Cost-Optimal Classical Planning Based on Linear Programming.

[BibT_eX]

[DOI]

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

New Optimization Functions for Potential Heuristics.

[BibT_eX]

[DOI]

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

A Normal Form for Classical Planning Tasks.

[BibT_eX]

[DOI]

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

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

[BibT_eX]

[DOI]

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

From Non-Negative to General Operator Cost Partitioning.

[BibT_eX]

[DOI]

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

2014

Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces.

[BibT_eX]

[DOI]

J. ACM, 2014

Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters.

[BibT_eX]

[DOI]

Ariel Felner

Proceedings of the Seventh Annual Symposium on Combinatorial Search, 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

Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting.

[BibT_eX]

[DOI]

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

Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Diverse and Additive Cartesian Abstraction Heuristics.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

LP-Based Heuristics for Cost-Optimal Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Under-Approximation Refinement for Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Generalized Label Reduction for Merge-and-Shrink Heuristics.

[BibT_eX]

[DOI]

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

2013

Automating the evaluation of planning systems.

[BibT_eX]

[DOI]

Carlos Linares López

Sergio Jiménez Celorrio

AI Commun., 2013

Preface.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

SoCS 2013 Organization.

[BibT_eX]

[DOI]

Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Getting the Most Out of Pattern Databases for Classical Planning.

[BibT_eX]

[DOI]

Proceedings of the IJCAI 2013, 2013

The Relative Pruning Power of Strong Stubborn Sets and Expansion Core.

[BibT_eX]

[DOI]

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

Counterexample-Guided Cartesian Abstraction Refinement.

[BibT_eX]

[DOI]

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

Incremental LM-Cut.

[BibT_eX]

[DOI]

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

Safe, Strong, and Tractable Relevance Analysis for Planning.

[BibT_eX]

[DOI]

Patrik Haslum

Anders Jonsson

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

Stronger Abstraction Heuristics Through Perimeter Search.

[BibT_eX]

[DOI]

Patrick Eyerich

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

Trial-Based Heuristic Tree Search for Finite Horizon MDPs.

[BibT_eX]

[DOI]

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

Additive Counterexample-Guided Cartesian Abstraction Refinement.

[BibT_eX]

[DOI]

Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012

Better Parameter-Free Anytime Search by Minimizing Time Between Solutions.

[BibT_eX]

[DOI]

Jordan Tyler Thayer

J. Benton

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Efficient Implementation of Pattern Database Heuristics for Classical Planning.

[BibT_eX]

[DOI]

Manuela Ortlieb

Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

A Stubborn Set Algorithm for Optimal Planning.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2012, 2012

About Partial Order Reduction in Planning and Computer Aided Verification.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Learning Portfolios of Automatically Tuned Planners.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Optimal Planning for Delete-Free Tasks with Incremental LM-Cut.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

How to Relax a Bisimulation?

[BibT_eX]

[DOI]

Michael Katz

Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984).

[BibT_eX]

[DOI]

Proceedings of the Multiagent Pathfinding, Papers from the 2012 AAAI Workshop, 2012

2011

Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning.

[BibT_eX]

[DOI]

Raz Nissim

Proceedings of the IJCAI 2011, 2011

2010

Landmark Heuristics for the Pancake Problem.

[BibT_eX]

[DOI]

Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Sound and Complete Landmarks for And/Or Graphs.

[BibT_eX]

[DOI]

Emil Keyder

Proceedings of the ECAI 2010, 2010

Relative-Order Abstractions for the Pancake Problem.

[BibT_eX]

[DOI]

Proceedings of the ECAI 2010, 2010

Strengthening Landmark Heuristics via Hitting Sets.

[BibT_eX]

[DOI]

Blai Bonet

Proceedings of the ECAI 2010, 2010

The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

Pattern Database Heuristics for Fully Observable Nondeterministic Planning.

[BibT_eX]

[DOI]

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem.

[BibT_eX]

[DOI]

Hauke Lasinger

Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

High-Quality Policies for the Canadian Traveler's Problem.

[BibT_eX]

[DOI]

Patrick Eyerich

Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence, 2010

2009

Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2009

Concise finite-domain representations for PDDL planning tasks.

[BibT_eX]

[DOI]

Artif. Intell., 2009

The Causal Graph Revisited for Directed Model Checking.

[BibT_eX]

[DOI]

Proceedings of the Static Analysis, 16th International Symposium, 2009

Planning with <i>h</i><sup> + </sup> in Theory and Practice.

[BibT_eX]

[DOI]

Christoph Betz

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

Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?

[BibT_eX]

[DOI]

Carmel Domshlak

Proceedings of the Graph Search Engineering, 29.11. - 04.12.2009, 2009

Preferred Operators and Deferred Evaluation in Satisficing Planning.

[BibT_eX]

[DOI]

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints.

[BibT_eX]

[DOI]

Dunbo Cai

Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008

On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle.

[BibT_eX]

[DOI]

Bernhard Nebel

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Unifying the Causal Graph and Additive Heuristics.

[BibT_eX]

[DOI]

Hector Geffner

Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

Landmarks Revisited.

[BibT_eX]

[DOI]

Matthias Westphal

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

How Good is Almost Perfect?.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Accuracy of Admissible Heuristic Functions in Selected Planning Domains.

[BibT_eX]

[DOI]

Robert Mattmüller

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Explicit-State Abstraction: A New Method for Generating Heuristic Functions.

[BibT_eX]

[DOI]

Patrik Haslum

Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition.

[BibT_eX]

[DOI]

Lecture Notes in Computer Science 4929, Springer, ISBN: 978-3-540-77722-9, 2008

2007

A Stochastic Local Search Approach to Vertex Cover.

[BibT_eX]

[DOI]

Charles Gretton

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

Flexible Abstraction Heuristics for Optimal Sequential Planning.

[BibT_eX]

[DOI]

Patrik Haslum

Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006

The Fast Downward Planning System.

[BibT_eX]

[DOI]

J. Artif. Intell. Res., 2006

Aproximation Properties of Planning Benchmarks.

[BibT_eX]

Robert Mattmüller

Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

A Skat Player Based on Monte-Carlo Simulation.

[BibT_eX]

[DOI]

Sebastian Kupferschmid

Proceedings of the Computers and Games, 5th International Conference, 2006

Selective Approaches for Solving Weak Games.

[BibT_eX]

[DOI]

Robert Mattmüller

Sven Schewe

Proceedings of the Automated Technology for Verification and Analysis, 2006

New Complexity Results for Classical Planning Benchmarks.

[BibT_eX]

[DOI]

Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2004

A Planning Heuristic Based on Causal Graph Analysis.

[BibT_eX]

[DOI]

Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

2003

Complexity results for standard benchmark domains in planning.

[BibT_eX]

[DOI]

Artif. Intell., 2003

2002

Decidability and Undecidability Results for Planning with Numerical State Variables.

[BibT_eX]

[DOI]

Proceedings of the Proceedings Workshop Planen und Konfigurieren (PuK-2002), 2002

2001

MIPS: The Model-Checking Integrated Planning System.

[BibT_eX]

[DOI]

Stefan Edelkamp

AI Mag., 2001

1999

Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length.

[BibT_eX]

[DOI]

Stefan Edelkamp