Malte Helmert

99 publications

8 venues

H Index 34


University of Basel, Switzerland
University of Freiburg, Germany


Name Venue Year citations
Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS 2021 0
Merge-and-Shrink: A Compositional Theory of Transformations of Factored Transition Systems. JAIR 2021 0
Exploiting Cyclic Dependencies in Landmark Heuristics. ICAPS 2021 1
Delete-Relaxation Heuristics for Lifted Classical Planning. ICAPS 2021 1
Saturated Post-hoc Optimization for Classical Planning. AAAI 2021 0
Neural Network Heuristics for Classical Planning: A Study of Hyperparameter Space. ECAI 2020 13
Lifted Successor Generation Using Query Optimization Techniques. ICAPS 2020 7
Incremental Search for Counterexample-Guided Cartesian Abstraction Refinement. ICAPS 2020 1
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. IJCAI 2020 2
A Guide to Budgeted Tree Search. SOCS 2020 1
Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI 2020 1
An Atom-Centric Perspective on Stubborn Sets. SOCS 2020 2
Saturated Cost Partitioning for Optimal Classical Planning. JAIR 2020 17
Certified Unsolvability for SAT Planning with Property Directed Reachability. ICAPS 2020 4
Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS 2019 5
Iterative Budgeted Exponential Search. IJCAI 2019 8
Subset-Saturated Cost Partitioning for Optimal Classical Planning. ICAPS 2019 9
Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. ICAPS 2019 3
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
Best-Case and Worst-Case Behavior of Greedy Best-First Search. IJCAI 2018 8
A Proof System for Unsolvable Planning Tasks. ICAPS 2018 12
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. JAIR 2018 35
Optimal Solutions to Large Logistics Planning Domain Problems. SOCS 2017 2
On Variable Dependencies and Compressed Pattern Databases. SOCS 2017 1
Unsolvability Certificates for Classical Planning. ICAPS 2017 24
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. AAAI 2017 6
Abstraction Heuristics, Cost Partitioning and Network Flows. ICAPS 2017 4
Understanding the Search Behaviour of Greedy Best-First Search. SOCS 2017 10
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. AAAI 2017 17
Value Compression of Pattern Databases. AAAI 2017 3
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. ICAPS 2017 20
Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS 2017 4
Graph-Based Factorization of Classical Planning Problems. IJCAI 2016 3
Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. SOCS 2016 7
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics. ICAPS 2016 20
Correlation Complexity of Classical Planning Domains. IJCAI 2016 8
Heuristics and Symmetries in Classical Planning. AAAI 2015 42
A Normal Form for Classical Planning Tasks. ICAPS 2015 23
From Non-Negative to General Operator Cost Partitioning. AAAI 2015 57
New Optimization Functions for Potential Heuristics. ICAPS 2015 28
Automatic Configuration of Sequential Planning Portfolios. AAAI 2015 48
On the Expressive Power of Non-Linear Merge-and-Shrink Representations. ICAPS 2015 11
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI 2015 23
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 13
LP-Based Heuristics for Cost-Optimal Planning. ICAPS 2014 64
Bounded Intention Planning Revisited. ECAI 2014 0
Generalized Label Reduction for Merge-and-Shrink Heuristics. AAAI 2014 48
Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies. ICAPS 2014 54
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. ECAI 2014 13
Diverse and Additive Cartesian Abstraction Heuristics. ICAPS 2014 38
Under-Approximation Refinement for Classical Planning. ICAPS 2014 6
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. SOCS 2014 3
Trial-Based Heuristic Tree Search for Finite Horizon MDPs. ICAPS 2013 96
Stronger Abstraction Heuristics Through Perimeter Search. ICAPS 2013 6
Getting the Most Out of Pattern Databases for Classical Planning. IJCAI 2013 50
Counterexample-Guided Cartesian Abstraction Refinement. ICAPS 2013 65
SoCS 2013 Organization. SOCS 2013 0
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. ICAPS 2013 33
Safe, Strong, and Tractable Relevance Analysis for Planning. ICAPS 2013 12
Incremental LM-Cut. ICAPS 2013 16
Preface. SOCS 2013 0
About Partial Order Reduction in Planning and Computer Aided Verification. ICAPS 2012 44
Efficient Implementation of Pattern Database Heuristics for Classical Planning. SOCS 2012 39
A Stubborn Set Algorithm for Optimal Planning. ECAI 2012 32
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. SOCS 2012 22
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. ICAPS 2012 30
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). SOCS 2012 28
How to Relax a Bisimulation? ICAPS 2012 15
Learning Portfolios of Automatically Tuned Planners. ICAPS 2012 47
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI 2011 63
High-Quality Policies for the Canadian Traveler's Problem. SOCS 2010 64
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. ICAPS 2010 36
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. ICAPS 2010 74
Sound and Complete Landmarks for And/Or Graphs. ECAI 2010 100
Landmark Heuristics for the Pancake Problem. SOCS 2010 70
Relative-Order Abstractions for the Pancake Problem. ECAI 2010 11
Strengthening Landmark Heuristics via Hitting Sets. ECAI 2010 86
Pattern Database Heuristics for Fully Observable Nondeterministic Planning. ICAPS 2010 32
High-Quality Policies for the Canadian Traveler's Problem. AAAI 2010 0
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. JAIR 2009 56
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. ICAPS 2009 25
Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence 2009 246
Preferred Operators and Deferred Evaluation in Satisficing Planning. ICAPS 2009 105
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? ICAPS 2009 427
How Good is Almost Perfect?. AAAI 2008 119
On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle. KR 2008 13
Landmarks Revisited. AAAI 2008 247
Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI 2008 26
Accuracy of Admissible Heuristic Functions in Selected Planning Domains. AAAI 2008 33
Unifying the Causal Graph and Additive Heuristics. ICAPS 2008 114
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007 208
Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007 265
Aproximation Properties of Planning Benchmarks. ECAI 2006 12
New Complexity Results for Classical Planning Benchmarks. ICAPS 2006 66
The Fast Downward Planning System. JAIR 2006 1396
A Planning Heuristic Based on Causal Graph Analysis. ICAPS 2004 243
Complexity results for standard benchmark domains in planning. Artificial Intelligence 2003 127
Copyright ©2019 Universit├Ąt W├╝rzburg

Impressum | Privacy | FAQ