Malte Helmert

Publication Activity (10 Years)

Years Active: 1999-2024
Publications (10 Years): 55

Top Venues

ICAPS

AAAI

IJCAI

SOCS

Publications

Simon Dold, Malte Helmert
Higher-Dimensional Potential Heuristics: Lower Bound Criterion and Connection to Correlation Complexity. ICAPS (2024)
Claudia Grundke, Gabriele Röger, Malte Helmert
Formal Representations of Classical Planning Domains. ICAPS (2024)
Simon Dold, Malte Helmert
Novelty vs. Potential Heuristics: A Comparison of Hardness Measures for Satisficing Planning. AAAI (2024)
Clemens Büchner, Patrick Ferber, Jendrik Seipp, Malte Helmert
Abstraction Heuristics for Factored Tasks. ICAPS (2024)
Songtuan Lin, Conny Olz, Malte Helmert, Pascal Bercher
On the Computational Complexity of Plan Verification, (Bounded) Plan-Optimality Verification, and Bounded Plan Existence. AAAI (2024)
Augusto B. Corrêa, Giuseppe De Giacomo, Malte Helmert, Sasha Rubin
Planning with Object Creation. ICAPS (2024)
Raphael Kreft, Clemens Büchner, Silvan Sievers, Malte Helmert
Computing Domain Abstractions for Optimal Classical Planning with Counterexample-Guided Abstraction Refinement. ICAPS (2023)
Clemens Büchner, Thomas Keller, Salomé Eriksson, Malte Helmert
Landmark Progression in Heuristic Search. ICAPS (2023)
Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. ICAPS (2023)
Daniel Gnad, Malte Helmert, Peter Jonsson, Alexander Shleyfman
Planning over Integers: Compilations and Undecidability. ICAPS (2023)
Malte Helmert, Silvan Sievers, Alexander Rovner, Augusto B. Corrêa
On the Complexity of Heuristic Synthesis for Satisficing Classical Planning: Potential Heuristics and Beyond. ICAPS (2022)
Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès
The FF Heuristic for Lifted Classical Planning. AAAI (2022)
Michael Katz, Gabriele Röger, Malte Helmert
On Producing Shortest Cost-Optimal Plans. SOCS (2022)
Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert
Detecting Unsolvability Based on Separating Functions. ICAPS (2022)
Patrick Ferber, Florian Geißer, Felipe W. Trevizan, Malte Helmert, Jörg Hoffmann
Neural Network Heuristic Functions for Classical Planning: Bootstrapping and Comparison to Other Methods. ICAPS (2022)
Augusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert
Delete-Relaxation Heuristics for Lifted Classical Planning. ICAPS (2021)
Clemens Büchner, Thomas Keller, Malte Helmert
Exploiting Cyclic Dependencies in Landmark Heuristics. ICAPS (2021)
Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert
Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS (2021)
Silvan Sievers, Malte Helmert
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems. J. Artif. Intell. Res. 71 (2021)
Jendrik Seipp, Thomas Keller, Malte Helmert
Saturated Post-hoc Optimization for Classical Planning. AAAI (2021)
Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès
Lifted Successor Generation Using Query Optimization Techniques. ICAPS (2020)
Patrick Ferber, Malte Helmert, Jörg Hoffmann
Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space. ECAI (2020)
Nathan R. Sturtevant, Malte Helmert
A Guide to Budgeted Tree Search. SOCS (2020)
Salomé Eriksson, Malte Helmert
Certified Unsolvability for SAT Planning with Property Directed Reachability. ICAPS (2020)
Gabriele Röger, Malte Helmert, Jendrik Seipp, Silvan Sievers
An Atom-Centric Perspective on Stubborn Sets. SOCS (2020)
Jendrik Seipp, Thomas Keller, Malte Helmert
Saturated Cost Partitioning for Optimal Classical Planning. J. Artif. Intell. Res. 67 (2020)
Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI (2020)
Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. IJCAI (2020)
Jendrik Seipp, Samuel von Allmen, Malte Helmert
Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. ICAPS (2020)
Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant
Iterative Budgeted Exponential Search. IJCAI (2019)
Jendrik Seipp, Malte Helmert
Subset-Saturated Cost Partitioning for Optimal Classical Planning. ICAPS (2019)
Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin
Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS (2019)
Florian Pommerening, Malte Helmert, Blai Bonet
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. CoRR (2019)
Nathan R. Sturtevant, Malte Helmert
Exponential-Binary State-Space Search. CoRR (2019)
Alexander Rovner, Silvan Sievers, Malte Helmert
Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. ICAPS (2019)
Malte Helmert, Tor Lattimore, Levi H. S. Lelis, Laurent Orseau, Nathan R. Sturtevant
Iterative Budgeted Exponential Search. CoRR (2019)
Jendrik Seipp, Malte Helmert
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. J. Artif. Intell. Res. 62 (2018)
Manuel Heusner, Thomas Keller, Malte Helmert
Best-Case and Worst-Case Behavior of Greedy Best-First Search. IJCAI (2018)
Manuel Heusner, Thomas Keller, Malte Helmert
Search Progress and Potentially Expanded States in Greedy Best-First Search. IJCAI (2018)
Salomé Eriksson, Gabriele Röger, Malte Helmert
Inductive Certificates of Unsolvability for Domain-Independent Planning. IJCAI (2018)
Salomé Eriksson, Gabriele Röger, Malte Helmert
A Proof System for Unsolvable Planning Tasks. ICAPS (2018)
Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz
Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS (2017)
Manuel Heusner, Thomas Keller, Malte Helmert
Understanding the Search Behaviour of Greedy Best-First Search. SOCS (2017)
Salomé Eriksson, Gabriele Röger, Malte Helmert
Unsolvability Certificates for Classical Planning. ICAPS (2017)
Nathan R. Sturtevant, Ariel Felner, Malte Helmert
Value Compression of Pattern Databases. AAAI (2017)
Florian Pommerening, Malte Helmert, Blai Bonet
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. AAAI (2017)
Florian Pommerening, Malte Helmert, Blai Bonet
Abstraction Heuristics, Cost Partitioning and Network Flows. ICAPS (2017)
Jendrik Seipp, Thomas Keller, Malte Helmert
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. AAAI (2017)
Jendrik Seipp, Thomas Keller, Malte Helmert
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. ICAPS (2017)
Malte Helmert, Nathan R. Sturtevant, Ariel Felner
On Variable Dependencies and Compressed Pattern Databases. SOCS (2017)
Gerald Paul, Gabriele Röger, Thomas Keller, Malte Helmert
Optimal Solutions to Large Logistics Planning Domain Problems. SOCS (2017)
Gerald Paul, Malte Helmert
Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. SOCS (2016)
Jendrik Seipp, Florian Pommerening, Gabriele Röger, Malte Helmert
Correlation Complexity of Classical Planning Domains. IJCAI (2016)
Silvan Sievers, Martin Wehrle, Malte Helmert
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics. ICAPS (2016)
Martin Wehrle, Silvan Sievers, Malte Helmert
Graph-Based Factorization of Classical Planning Problems. IJCAI (2016)
Silvan Sievers, Malte Helmert
A Doppelkopf Player Based on UCT. KI (2015)
Jendrik Seipp, Silvan Sievers, Malte Helmert, Frank Hutter
Automatic Configuration of Sequential Planning Portfolios. AAAI (2015)
Malte Helmert, Gabriele Röger, Silvan Sievers
On the Expressive Power of Non-Linear Merge-and-Shrink Representations. ICAPS (2015)
Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers, Martin Wehrle
Heuristics and Symmetries in Classical Planning. AAAI (2015)
Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp
From Non-Negative to General Operator Cost Partitioning. AAAI (2015)
Florian Pommerening, Malte Helmert
A Normal Form for Classical Planning Tasks. ICAPS (2015)
Silvan Sievers, Martin Wehrle, Malte Helmert, Michael Katz
An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search. KI (2015)
Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz
Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. IJCAI (2015)
Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet
Heuristics for Cost-Optimal Classical Planning Based on Linear Programming. IJCAI (2015)
Silvan Sievers, Martin Wehrle, Malte Helmert, Alexander Shleyfman, Michael Katz
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI (2015)
Jendrik Seipp, Florian Pommerening, Malte Helmert
New Optimization Functions for Potential Heuristics. ICAPS (2015)
Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. CoRR (2014)
Manuel Heusner, Martin Wehrle, Florian Pommerening, Malte Helmert
Under-Approximation Refinement for Classical Planning. ICAPS (2014)
Jendrik Seipp, Malte Helmert
Diverse and Additive Cartesian Abstraction Heuristics. ICAPS (2014)
Silvan Sievers, Martin Wehrle, Malte Helmert
Bounded Intention Planning Revisited. ECAI (2014)
Nathan R. Sturtevant, Ariel Felner, Malte Helmert
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. SOCS (2014)
Silvan Sievers, Martin Wehrle, Malte Helmert
Generalized Label Reduction for Merge-and-Shrink Heuristics. AAAI (2014)
Gabriele Röger, Florian Pommerening, Malte Helmert
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. ECAI (2014)
Martin Wehrle, Malte Helmert
Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies. ICAPS (2014)
Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet
LP-Based Heuristics for Cost-Optimal Planning. ICAPS (2014)
Malte Helmert, Patrik Haslum, Jörg Hoffmann, Raz Nissim
Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces. J. ACM 61 (3) (2014)
Malte Helmert, Gabriele Röger
SoCS 2013 Organization. SOCS (2013)
Jendrik Seipp, Malte Helmert
Counterexample-Guided Cartesian Abstraction Refinement. ICAPS (2013)
Malte Helmert, Gabriele Röger
Preface. SOCS (2013)
Patrik Haslum, Malte Helmert, Anders Jonsson
Safe, Strong, and Tractable Relevance Analysis for Planning. ICAPS (2013)
Jendrik Seipp, Malte Helmert
Additive Counterexample-Guided Cartesian Abstraction Refinement. AAAI (Late-Breaking Developments) (2013)
Thomas Keller, Malte Helmert
Trial-Based Heuristic Tree Search for Finite Horizon MDPs. ICAPS (2013)
Carlos Linares López, Sergio Jiménez Celorrio, Malte Helmert
Automating the evaluation of planning systems. AI Commun. 26 (4) (2013)
Martin Wehrle, Malte Helmert, Yusra Alkhazraji, Robert Mattmüller
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. ICAPS (2013)
Patrick Eyerich, Malte Helmert
Stronger Abstraction Heuristics Through Perimeter Search. ICAPS (2013)
Florian Pommerening, Malte Helmert
Incremental LM-Cut. ICAPS (2013)
Florian Pommerening, Gabriele Röger, Malte Helmert
Getting the Most Out of Pattern Databases for Classical Planning. IJCAI (2013)
Michael Katz, Jörg Hoffmann, Malte Helmert
How to Relax a Bisimulation? ICAPS (2012)
Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert
Learning Portfolios of Automatically Tuned Planners. ICAPS (2012)
Yusra Alkhazraji, Martin Wehrle, Robert Mattmüller, Malte Helmert
A Stubborn Set Algorithm for Optimal Planning. ECAI (2012)
Silvan Sievers, Manuela Ortlieb, Malte Helmert
Efficient Implementation of Pattern Database Heuristics for Classical Planning. SOCS (2012)
Martin Wehrle, Malte Helmert
About Partial Order Reduction in Planning and Computer Aided Verification. ICAPS (2012)
Gabriele Röger, Malte Helmert
Non-Optimal Multi-Agent Pathfinding Is Solved (Since 1984). MAPF@AAAI (2012)
Gabriele Röger, Malte Helmert
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). SOCS (2012)
Jordan Tyler Thayer, J. Benton, Malte Helmert
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. SOCS (2012)
Florian Pommerening, Malte Helmert
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. ICAPS (2012)
Raz Nissim, Jörg Hoffmann, Malte Helmert
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI (2011)
Malte Helmert
The Fast Downward Planning System CoRR (2011)
Malte Helmert, Hauke Lasinger
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. ICAPS (2010)
Malte Helmert
Landmark Heuristics for the Pancake Problem. SOCS (2010)

Malte Helmert.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Malte Helmert