Malte Helmert
115 publications
8 venues
H Index 35
Affiliation
University of Basel, SwitzerlandUniversity of Freiburg, Germany
Links
| Name | Venue | Year | citations |
|---|---|---|---|
Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning.
|
AAAI | 2024 | 0 |
| On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence.
|
AAAI | 2024 | 0 |
| Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity.
|
ICAPS | 2024 | 0 |
| Planning with Object Creation.
|
ICAPS | 2024 | 0 |
| Formal Representations of Classical Planning Domains.
|
ICAPS | 2024 | 0 |
| Abstraction Heuristics for Factored Tasks.
|
ICAPS | 2024 | 0 |
| Improving Reproducibility in AI Research: Four Mechanisms Adopted by JAIR.
|
JAIR | 2024 | 0 |
| Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.
|
ICAPS | 2023 | 0 |
| Landmark Progression in Heuristic Search.
|
ICAPS | 2023 | 0 |
| Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement.
|
ICAPS | 2023 | 0 |
| Planning over Integers: Compilations and Undecidability.
|
ICAPS | 2023 | 0 |
| The FF Heuristic for Lifted Classical Planning.
|
AAAI | 2022 | 1 |
| On Producing Shortest Cost-Optimal Plans.
|
SOCS | 2022 | 0 |
| On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond.
|
ICAPS | 2022 | 1 |
| Detecting Unsolvability Based on Separating Functions.
|
ICAPS | 2022 | 0 |
| Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods.
|
ICAPS | 2022 | 3 |
| Delete-Relaxation Heuristics for Lifted Classical Planning.
|
ICAPS | 2021 | 9 |
| Dantzig-Wolfe Decomposition for Cost Partitioning.
|
ICAPS | 2021 | 1 |
| Saturated Post-hoc Optimization for Classical Planning.
|
AAAI | 2021 | 0 |
| Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems.
|
JAIR | 2021 | 4 |
| Exploiting Cyclic Dependencies in Landmark Heuristics.
|
ICAPS | 2021 | 2 |
| Lagrangian Decomposition for Classical Planning (Extended Abstract).
|
IJCAI | 2020 | 1 |
| Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement.
|
ICAPS | 2020 | 2 |
| Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space.
|
ECAI | 2020 | 25 |
| Saturated Cost Partitioning for Optimal Classical Planning.
|
JAIR | 2020 | 25 |
| Certified Unsolvability for SAT Planning with Property Directed Reachability.
|
ICAPS | 2020 | 5 |
| Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning.
|
IJCAI | 2020 | 2 |
| Lifted Successor Generation Using Query Optimization Techniques.
|
ICAPS | 2020 | 18 |
| A Guide to Budgeted Tree Search.
|
SOCS | 2020 | 0 |
| An Atom-Centric Perspective on Stubborn Sets.
|
SOCS | 2020 | 0 |
| Iterative Budgeted Exponential Search.
|
IJCAI | 2019 | 11 |
| Lagrangian Decomposition for Optimal Cost Partitioning.
|
ICAPS | 2019 | 5 |
| Subset-Saturated Cost Partitioning for Optimal Classical Planning.
|
ICAPS | 2019 | 9 |
| Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning.
|
ICAPS | 2019 | 7 |
| A Proof System for Unsolvable Planning Tasks.
|
ICAPS | 2018 | 14 |
| Search Progress and Potentially Expanded States in Greedy Best-First Search.
|
IJCAI | 2018 | 1 |
| Inductive Certificates of Unsolvability for Domain-Independent Planning.
|
IJCAI | 2018 | 2 |
| Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning.
|
JAIR | 2018 | 53 |
| Best-Case and Worst-Case Behavior of Greedy Best-First Search.
|
IJCAI | 2018 | 9 |
| Unsolvability Certificates for Classical Planning.
|
ICAPS | 2017 | 30 |
| Higher-Dimensional Potential Heuristics for Optimal Classical Planning.
|
AAAI | 2017 | 10 |
| Strengthening Canonical Pattern Databases with Structural Symmetries.
|
SOCS | 2017 | 5 |
| Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.
|
AAAI | 2017 | 19 |
| A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.
|
ICAPS | 2017 | 22 |
| Value Compression of Pattern Databases.
|
AAAI | 2017 | 5 |
| Abstraction Heuristics, Cost Partitioning and Network Flows.
|
ICAPS | 2017 | 4 |
| Understanding the Search Behaviour of Greedy Best-First Search.
|
SOCS | 2017 | 0 |
| On Variable Dependencies and Compressed Pattern Databases.
|
SOCS | 2017 | 0 |
| Optimal Solutions to Large Logistics Planning Domain Problems.
|
SOCS | 2017 | 0 |
| Graph-Based Factorization of Classical Planning Problems.
|
IJCAI | 2016 | 3 |
| An Analysis of Merge Strategies for Merge-and-Shrink Heuristics.
|
ICAPS | 2016 | 27 |
| Correlation Complexity of Classical Planning Domains.
|
IJCAI | 2016 | 14 |
| Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis.
|
SOCS | 2016 | 0 |
| New Optimization Functions for Potential Heuristics.
|
ICAPS | 2015 | 39 |
| On the Expressive Power of Non-Linear Merge-and-Shrink Representations.
|
ICAPS | 2015 | 11 |
| A Normal Form for Classical Planning Tasks.
|
ICAPS | 2015 | 25 |
| From Non-Negative to General Operator Cost Partitioning.
|
AAAI | 2015 | 74 |
| Heuristics and Symmetries in Classical Planning.
|
AAAI | 2015 | 50 |
| Factored Symmetries for Merge-and-Shrink Abstractions.
|
AAAI | 2015 | 25 |
| Heuristics for Cost-Optimal Classical Planning Based on Linear Programming.
|
IJCAI | 2015 | 7 |
| Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning.
|
IJCAI | 2015 | 16 |
| Automatic Configuration of Sequential Planning Portfolios.
|
AAAI | 2015 | 53 |
| Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies.
|
ICAPS | 2014 | 57 |
| Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters.
|
SOCS | 2014 | 4 |
| Generalized Label Reduction for Merge-and-Shrink Heuristics.
|
AAAI | 2014 | 53 |
| Diverse and Additive Cartesian Abstraction Heuristics.
|
ICAPS | 2014 | 39 |
| Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting.
|
ECAI | 2014 | 15 |
| Under-Approximation Refinement for Classical Planning.
|
ICAPS | 2014 | 6 |
| Bounded Intention Planning Revisited.
|
ECAI | 2014 | 0 |
| LP-Based Heuristics for Cost-Optimal Planning.
|
ICAPS | 2014 | 73 |
| Preface.
|
SOCS | 2013 | 0 |
| Incremental LM-Cut.
|
ICAPS | 2013 | 17 |
| The Relative Pruning Power of Strong Stubborn Sets and Expansion Core.
|
ICAPS | 2013 | 33 |
| Counterexample-Guided Cartesian Abstraction Refinement.
|
ICAPS | 2013 | 69 |
| SoCS 2013 Organization.
|
SOCS | 2013 | 0 |
| Getting the Most Out of Pattern Databases for Classical Planning.
|
IJCAI | 2013 | 60 |
| Safe, Strong, and Tractable Relevance Analysis for Planning.
|
ICAPS | 2013 | 14 |
| Stronger Abstraction Heuristics Through Perimeter Search.
|
ICAPS | 2013 | 6 |
| Trial-Based Heuristic Tree Search for Finite Horizon MDPs.
|
ICAPS | 2013 | 101 |
| About Partial Order Reduction in Planning and Computer Aided Verification.
|
ICAPS | 2012 | 46 |
| Learning Portfolios of Automatically Tuned Planners.
|
ICAPS | 2012 | 48 |
| How to Relax a Bisimulation?
|
ICAPS | 2012 | 16 |
| A Stubborn Set Algorithm for Optimal Planning.
|
ECAI | 2012 | 36 |
| Optimal Planning for Delete-Free Tasks with Incremental LM-Cut.
|
ICAPS | 2012 | 29 |
| Better Parameter-Free Anytime Search by Minimizing Time Between Solutions.
|
SOCS | 2012 | 0 |
| Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984).
|
SOCS | 2012 | 0 |
| Efficient Implementation of Pattern Database Heuristics for Classical Planning.
|
SOCS | 2012 | 0 |
| Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning.
|
IJCAI | 2011 | 67 |
| Sound and Complete Landmarks for And/Or Graphs.
|
ECAI | 2010 | 104 |
| Strengthening Landmark Heuristics via Hitting Sets.
|
ECAI | 2010 | 87 |
| The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem.
|
ICAPS | 2010 | 38 |
| The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning.
|
ICAPS | 2010 | 80 |
| Landmark Heuristics for the Pancake Problem.
|
SOCS | 2010 | 76 |
| High-Quality Policies for the Canadian Traveler's Problem.
|
AAAI | 2010 | 72 |
| Relative-Order Abstractions for the Pancake Problem.
|
ECAI | 2010 | 11 |
| High-Quality Policies for the Canadian Traveler's Problem.
|
SOCS | 2010 | 0 |
| Pattern Database Heuristics for Fully Observable Nondeterministic Planning.
|
ICAPS | 2010 | 0 |
| Concise finite-domain representations for PDDL planning tasks.
|
Artificial Intelligence | 2009 | 262 |
| Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints.
|
ICAPS | 2009 | 25 |
| Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection.
|
JAIR | 2009 | 56 |
| Preferred Operators and Deferred Evaluation in Satisficing Planning.
|
ICAPS | 2009 | 114 |
| Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
|
ICAPS | 2009 | 475 |
| Landmarks Revisited.
|
AAAI | 2008 | 258 |
| Unifying the Causal Graph and Additive Heuristics.
|
ICAPS | 2008 | 119 |
| Explicit-State Abstraction: A New Method for Generating Heuristic Functions.
|
AAAI | 2008 | 26 |
| How Good is Almost Perfect?.
|
AAAI | 2008 | 127 |
| On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle.
|
KR | 2008 | 13 |
| Accuracy of Admissible Heuristic Functions in Selected Planning Domains.
|
AAAI | 2008 | 35 |
| Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.
|
AAAI | 2007 | 223 |
| Flexible Abstraction Heuristics for Optimal Sequential Planning.
|
ICAPS | 2007 | 275 |
| New Complexity Results for Classical Planning Benchmarks.
|
ICAPS | 2006 | 68 |
| The Fast Downward Planning System.
|
JAIR | 2006 | 1525 |
| Aproximation Properties of Planning Benchmarks.
|
ECAI | 2006 | 12 |
| A Planning Heuristic Based on Causal Graph Analysis.
|
ICAPS | 2004 | 252 |
| Complexity results for standard benchmark domains in planning.
|
Artificial Intelligence | 2003 | 133 |