Malte Helmert

86 publications

8 venues

H Index30

Affiliation

University of Freiburg, Germany
University of Basel, Switzerland

Links

Name Venue Year Citations
Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. SOCS 2012 19
Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstraction in Optimal Planning. IJCAI 2011 52
Landmark Heuristics for the Pancake Problem. SOCS 2010 50
Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. JAIR 2009 45
Preface. SOCS 2013 0
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. ECAI 2014 12
A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning. ICAPS 2017 10
Search Progress and Potentially Expanded States in Greedy Best-First Search. IJCAI 2018 1
Efficient Implementation of Pattern Database Heuristics for Classical Planning. SOCS 2012 34
SoCS 2013 Organization. SOCS 2013 0
Stronger Abstraction Heuristics Through Perimeter Search. ICAPS 2013 5
Relative-Order Abstractions for the Pancake Problem. ECAI 2010 5
Inductive Certificates of Unsolvability for Domain-Independent Planning. IJCAI 2018 1
Incremental LM-Cut. ICAPS 2013 10
Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007 161
Unsolvability Certificates for Classical Planning. ICAPS 2017 14
Value Compression of Pattern Databases. AAAI 2017 2
Trial-Based Heuristic Tree Search for Finite Horizon MDPs. ICAPS 2013 64
Under-Approximation Refinement for Classical Planning. ICAPS 2014 4
New Optimization Functions for Potential Heuristics. ICAPS 2015 20
Landmarks Revisited. AAAI 2008 180
The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. ICAPS 2010 25
Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007 200
A Normal Form for Classical Planning Tasks. ICAPS 2015 19
Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS 2019 2
Optimal Solutions to Large Logistics Planning Domain Problems. SOCS 2017 1
Counterexample-Guided Cartesian Abstraction Refinement for Classical Planning. JAIR 2018 12
New Complexity Results for Classical Planning Benchmarks. ICAPS 2006 51
Learning Portfolios of Automatically Tuned Planners. ICAPS 2012 41
Accuracy of Admissible Heuristic Functions in Selected Planning Domains. AAAI 2008 22
Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning. IJCAI 2015 10
Diverse and Additive Cartesian Abstraction Heuristics. ICAPS 2014 23
Unifying the Causal Graph and Additive Heuristics. ICAPS 2008 86
Factored Symmetries for Merge-and-Shrink Abstractions. AAAI 2015 14
Iterative Budgeted Exponential Search. IJCAI 2019 0
Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters. SOCS 2014 3
Abstraction Heuristics, Cost Partitioning and Network Flows. ICAPS 2017 3
The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. ICAPS 2010 50
Safe, Strong, and Tractable Relevance Analysis for Planning. ICAPS 2013 9
On Variable Dependencies and Compressed Pattern Databases. SOCS 2017 0
Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? ICAPS 2009 301
Counterexample-Guided Abstraction Refinement for Pattern Selection in Optimal Classical Planning. ICAPS 2019 0
Sound and Complete Landmarks for And/Or Graphs. ECAI 2010 71
LP-Based Heuristics for Cost-Optimal Planning. ICAPS 2014 42
Subset-Saturated Cost Partitioning for Optimal Classical Planning. ICAPS 2019 4
Aproximation Properties of Planning Benchmarks. ECAI 2006 8
Concise finite-domain representations for PDDL planning tasks. Artificial Intelligence 2009 176
Preferred Operators and Deferred Evaluation in Satisficing Planning. ICAPS 2009 79
Bounded Intention Planning Revisited. ECAI 2014 0
Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies. ICAPS 2014 40
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. ICAPS 2012 23
From Non-Negative to General Operator Cost Partitioning. AAAI 2015 36
Best-Case and Worst-Case Behavior of Greedy Best-First Search. IJCAI 2018 4
Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning. AAAI 2017 11
On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle. KR 2008 12
A Proof System for Unsolvable Planning Tasks. ICAPS 2018 6
Optimal Solitaire Game Solutions Using A* Search and Deadlock Analysis. SOCS 2016 3
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. ICAPS 2013 26
Heuristics for Cost-Optimal Classical Planning Based on Linear Programming. IJCAI 2015 5
A Planning Heuristic Based on Causal Graph Analysis. ICAPS 2004 182
Pattern Database Heuristics for Fully Observable Nondeterministic Planning. ICAPS 2010 25
Strengthening Canonical Pattern Databases with Structural Symmetries. SOCS 2017 4
How to Relax a Bisimulation? ICAPS 2012 13
How Good is Almost Perfect?. AAAI 2008 96
Automatic Configuration of Sequential Planning Portfolios. AAAI 2015 30
On the Expressive Power of Non-Linear Merge-and-Shrink Representations. ICAPS 2015 9
Strengthening Landmark Heuristics via Hitting Sets. ECAI 2010 67
Complexity results for standard benchmark domains in planning. Artificial Intelligence 2003 94
Understanding the Search Behaviour of Greedy Best-First Search. SOCS 2017 7
The Fast Downward Planning System. JAIR 2006 970
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. AAAI 2017 4
Correlation Complexity of Classical Planning Domains. IJCAI 2016 6
Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. ICAPS 2009 23
About Partial Order Reduction in Planning and Computer Aided Verification. ICAPS 2012 33
High-Quality Policies for the Canadian Traveler's Problem. SOCS 2010 54
A Stubborn Set Algorithm for Optimal Planning. ECAI 2012 23
Getting the Most Out of Pattern Databases for Classical Planning. IJCAI 2013 35
Graph-Based Factorization of Classical Planning Problems. IJCAI 2016 2
Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI 2008 18
Heuristics and Symmetries in Classical Planning. AAAI 2015 29
Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). SOCS 2012 23
Saturated Cost Partitioning for Optimal Classical Planning. JAIR 2020 2
Generalized Label Reduction for Merge-and-Shrink Heuristics. AAAI 2014 34
Counterexample-Guided Cartesian Abstraction Refinement. ICAPS 2013 42
An Analysis of Merge Strategies for Merge-and-Shrink Heuristics. ICAPS 2016 13
High-Quality Policies for the Canadian Traveler's Problem. AAAI 2010 0
Copyright ©2019 Universit├Ąt W├╝rzburg
Website created in context of the REGIO Project
Impressum | Privacy | FAQ