Malte Helmert

Affiliations:
  • University of Basel, Switzerland
  • University of Freiburg, Germany


According to our database1, Malte Helmert authored at least 125 papers between 1999 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning.
Proceedings of the Thirty-Eighth AAAI Conference on Artificial Intelligence, 2024

2023
Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Landmark Progression in Heuristic Search.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

Planning over Integers: Compilations and Undecidability.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
On Producing Shortest Cost-Optimal Plans.
Proceedings of the Fifteenth International Symposium on Combinatorial Search, 2022

On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Detecting Unsolvability Based on Separating Functions.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

The FF Heuristic for Lifted Classical Planning.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems.
J. Artif. Intell. Res., 2021

Dantzig-Wolfe Decomposition for Cost Partitioning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Delete-Relaxation Heuristics for Lifted Classical Planning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Exploiting Cyclic Dependencies in Landmark Heuristics.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Saturated Post-hoc Optimization for Classical Planning.
Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020
Saturated Cost Partitioning for Optimal Classical Planning.
J. Artif. Intell. Res., 2020

A Guide to Budgeted Tree Search.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

An Atom-Centric Perspective on Stubborn Sets.
Proceedings of the Thirteenth International Symposium on Combinatorial Search, 2020

Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Lagrangian Decomposition for Classical Planning (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space.
Proceedings of the ECAI 2020 - 24th European Conference on Artificial Intelligence, 29 August-8 September 2020, Santiago de Compostela, Spain, August 29 - September 8, 2020, 2020

Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Certified Unsolvability for SAT Planning with Property Directed Reachability.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Lifted Successor Generation Using Query Optimization Techniques.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

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

2019
Exponential-Binary State-Space Search.
CoRR, 2019

Iterative Budgeted Exponential Search.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Subset-Saturated Cost Partitioning for Optimal Classical Planning.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Lagrangian Decomposition for Optimal Cost Partitioning.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2018
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning.
J. Artif. Intell. Res., 2018

Search Progress and Potentially Expanded States in Greedy Best-First Search.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Best-Case and Worst-Case Behavior of Greedy Best-First Search.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

Inductive Certificates of Unsolvability for Domain-Independent Planning.
Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

A Proof System for Unsolvable Planning Tasks.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

2017
Strengthening Canonical Pattern Databases with Structural Symmetries.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Optimal Solutions to Large Logistics Planning Domain Problems.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Understanding the Search Behaviour of Greedy Best-First Search.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

On Variable Dependencies and Compressed Pattern Databases.
Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Abstraction Heuristics, Cost Partitioning and Network Flows.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Unsolvability Certificates for Classical Planning.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Value Compression of Pattern Databases.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

Higher-Dimensional Potential Heuristics for Optimal Classical Planning.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis.
Proceedings of the Ninth Annual Symposium on Combinatorial Search, 2016

Graph-Based Factorization of Classical Planning Problems.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Correlation Complexity of Classical Planning Domains.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

An Analysis of Merge Strategies for Merge-and-Shrink Heuristics.
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.
Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015

A Doppelkopf Player Based on UCT.
Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015

Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Heuristics for Cost-Optimal Classical Planning Based on Linear Programming.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

New Optimization Functions for Potential Heuristics.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

A Normal Form for Classical Planning Tasks.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

On the Expressive Power of Non-Linear Merge-and-Shrink Representations.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

Factored Symmetries for Merge-and-Shrink Abstractions.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Heuristics and Symmetries in Classical Planning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

Automatic Configuration of Sequential Planning Portfolios.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

From Non-Negative to General Operator Cost Partitioning.
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.
J. ACM, 2014

Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters.
Proceedings of the Seventh Annual Symposium on Combinatorial Search, 2014

Bounded Intention Planning Revisited.
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.
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.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Diverse and Additive Cartesian Abstraction Heuristics.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

LP-Based Heuristics for Cost-Optimal Planning.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Under-Approximation Refinement for Classical Planning.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Generalized Label Reduction for Merge-and-Shrink Heuristics.
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence, 2014

2013
Automating the evaluation of planning systems.
AI Commun., 2013

Preface.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

SoCS 2013 Organization.
Proceedings of the Sixth Annual Symposium on Combinatorial Search, 2013

Getting the Most Out of Pattern Databases for Classical Planning.
Proceedings of the IJCAI 2013, 2013

The Relative Pruning Power of Strong Stubborn Sets and Expansion Core.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Counterexample-Guided Cartesian Abstraction Refinement.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Incremental LM-Cut.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Safe, Strong, and Tractable Relevance Analysis for Planning.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Stronger Abstraction Heuristics Through Perimeter Search.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Trial-Based Heuristic Tree Search for Finite Horizon MDPs.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

Additive Counterexample-Guided Cartesian Abstraction Refinement.
Proceedings of the Late-Breaking Developments in the Field of Artificial Intelligence, 2013

2012
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

Efficient Implementation of Pattern Database Heuristics for Classical Planning.
Proceedings of the Fifth Annual Symposium on Combinatorial Search, 2012

A Stubborn Set Algorithm for Optimal Planning.
Proceedings of the ECAI 2012, 2012

About Partial Order Reduction in Planning and Computer Aided Verification.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Learning Portfolios of Automatically Tuned Planners.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Optimal Planning for Delete-Free Tasks with Incremental LM-Cut.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

How to Relax a Bisimulation?
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984).
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.
Proceedings of the IJCAI 2011, 2011

2010
Landmark Heuristics for the Pancake Problem.
Proceedings of the Third Annual Symposium on Combinatorial Search, 2010

Sound and Complete Landmarks for And/Or Graphs.
Proceedings of the ECAI 2010, 2010

Relative-Order Abstractions for the Pancake Problem.
Proceedings of the ECAI 2010, 2010

Strengthening Landmark Heuristics via Hitting Sets.
Proceedings of the ECAI 2010, 2010

The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

Pattern Database Heuristics for Fully Observable Nondeterministic Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

High-Quality Policies for the Canadian Traveler's Problem.
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.
J. Artif. Intell. Res., 2009

Concise finite-domain representations for PDDL planning tasks.
Artif. Intell., 2009

The Causal Graph Revisited for Directed Model Checking.
Proceedings of the Static Analysis, 16th International Symposium, 2009

Planning with <i>h</i><sup> + </sup> in Theory and Practice.
Proceedings of the KI 2009: Advances in Artificial Intelligence, 2009

Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
Proceedings of the Graph Search Engineering, 29.11. - 04.12.2009, 2009

Preferred Operators and Deferred Evaluation in Satisficing Planning.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints.
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.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Eleventh International Conference, 2008

Unifying the Causal Graph and Additive Heuristics.
Proceedings of the Eighteenth International Conference on Automated Planning and Scheduling, 2008

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

How Good is Almost Perfect?.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Accuracy of Admissible Heuristic Functions in Selected Planning Domains.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Explicit-State Abstraction: A New Method for Generating Heuristic Functions.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition.
Lecture Notes in Computer Science 4929, Springer, ISBN: 978-3-540-77722-9, 2008

2007
A Stochastic Local Search Approach to Vertex Cover.
Proceedings of the KI 2007: Advances in Artificial Intelligence, 2007

Flexible Abstraction Heuristics for Optimal Sequential Planning.
Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling, 2007

Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.
Proceedings of the Twenty-Second AAAI Conference on Artificial Intelligence, 2007

2006
The Fast Downward Planning System.
J. Artif. Intell. Res., 2006

Aproximation Properties of Planning Benchmarks.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

A Skat Player Based on Monte-Carlo Simulation.
Proceedings of the Computers and Games, 5th International Conference, 2006

Selective Approaches for Solving Weak Games.
Proceedings of the Automated Technology for Verification and Analysis, 2006

New Complexity Results for Classical Planning Benchmarks.
Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling, 2006

2004
A Planning Heuristic Based on Causal Graph Analysis.
Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), 2004

2003
Complexity results for standard benchmark domains in planning.
Artif. Intell., 2003

2002
Decidability and Undecidability Results for Planning with Numerical State Variables.
Proceedings of the Proceedings Workshop Planen und Konfigurieren (PuK-2002), 2002

2001
MIPS: The Model-Checking Integrated Planning System.
AI Mag., 2001

1999
Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length.
Proceedings of the Recent Advances in AI Planning, 5th European Conference on Planning, 1999


  Loading...