Malte Helmert

Michael Katz, Jörg Hoffmann, Malte Helmert: How to Relax a Bisimulation? ICAPS 2012

Florian Pommerening, Malte Helmert: Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. ICAPS 2012

Jendrik Seipp, Manuel Braun, Johannes Garimort, Malte Helmert: Learning Portfolios of Automatically Tuned Planners. ICAPS 2012

Martin Wehrle, Malte Helmert: About Partial Order Reduction in Planning and Computer Aided Verification. ICAPS 2012

Yusra Alkhazraji, Martin Wehrle, Robert Mattmüller, Malte Helmert: A Stubborn Set Algorithm for Optimal Planning. ECAI 2012: 891-892

Gabriele Röger, Malte Helmert: Non-Optimal Multi-Agent Pathfinding is Solved (Since 1984). SOCS 2012

Silvan Sievers, Manuela Ortlieb, Malte Helmert: Efficient Implementation of Pattern Database Heuristics for Classical Planning. SOCS 2012

Jordan Tyler Thayer, J. Benton, Malte Helmert: Better Parameter-Free Anytime Search by Minimizing Time Between Solutions. SOCS 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: 1983-1990

Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp, Malte Helmert (Eds.): Proceedings of the 21st International Conference on Automated Planning and Scheduling, ICAPS 2011, Freiburg, Germany June 11-16, 2011. AAAI 2011

Malte Helmert: The Fast Downward Planning System. CoRR abs/1109.6051 (2011)

Patrick Eyerich, Thomas Keller, Malte Helmert: High-Quality Policies for the Canadian Traveler's Problem. AAAI 2010

Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher: Pattern Database Heuristics for Fully Observable Nondeterministic Planning. ICAPS 2010: 105-112

Malte Helmert, Hauke Lasinger: The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem. ICAPS 2010: 234-237

Gabriele Röger, Malte Helmert: The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning. ICAPS 2010: 246-249

Blai Bonet, Malte Helmert: Strengthening Landmark Heuristics via Hitting Sets. ECAI 2010: 329-334

Emil Keyder, Silvia Richter, Malte Helmert: Sound and Complete Landmarks for And/Or Graphs. ECAI 2010: 335-340

Malte Helmert, Gabriele Röger: Relative-Order Abstractions for the Pancake Problem. ECAI 2010: 745-750

Patrick Eyerich, Thomas Keller, Malte Helmert: High-Quality Policies for the Canadian Traveler's Problem. SOCS 2010

Malte Helmert: Landmark Heuristics for the Pancake Problem. SOCS 2010

Malte Helmert: Concise finite-domain representations for PDDL planning tasks. Artif. Intell. 173(5-6): 503-535 (2009)

Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert, Marco Pistore: Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection. J. Artif. Intell. Res. (JAIR) 35: 49-117 (2009)

Dunbo Cai, Jörg Hoffmann, Malte Helmert: Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints. ICAPS 2009

Malte Helmert, Carmel Domshlak: Landmarks, Critical Paths and Abstractions: What's the Difference Anyway? ICAPS 2009

Silvia Richter, Malte Helmert: Preferred Operators and Deferred Evaluation in Satisficing Planning. ICAPS 2009

Christoph Betz, Malte Helmert: Planning with h ⁺ in Theory and Practice. KI 2009: 9-16

Martin Wehrle, Malte Helmert: The Causal Graph Revisited for Directed Model Checking. SAS 2009: 86-101

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

Malte Helmert: Understanding planning tasks: domain complexity and heuristic decomposition. University of Freiburg 2008, isbn 978-3-540-77722-9, pp. 1-270

Malte Helmert, Robert Mattmüller: Accuracy of Admissible Heuristic Functions in Selected Planning Domains. AAAI 2008: 938-943

Malte Helmert, Gabriele Röger: How Good is Almost Perfect?. AAAI 2008: 944-949

Silvia Richter, Malte Helmert, Matthias Westphal: Landmarks Revisited. AAAI 2008: 975-982

Malte Helmert, Patrik Haslum, Jörg Hoffmann: Explicit-State Abstraction: A New Method for Generating Heuristic Functions. AAAI 2008: 1547-1550

Malte Helmert, Hector Geffner: Unifying the Causal Graph and Additive Heuristics. ICAPS 2008: 140-147

Gabriele Röger, Malte Helmert, Bernhard Nebel: On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle. KR 2008: 544-550

Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet, Sven Koenig: Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning. AAAI 2007: 1007-1012

Malte Helmert, Patrik Haslum, Jörg Hoffmann: Flexible Abstraction Heuristics for Optimal Sequential Planning. ICAPS 2007: 176-183

Silvia Richter, Malte Helmert, Charles Gretton: A Stochastic Local Search Approach to Vertex Cover. KI 2007: 412-426

Malte Helmert: The Fast Downward Planning System. J. Artif. Intell. Res. (JAIR) 26: 191-246 (2006)

Malte Helmert: New Complexity Results for Classical Planning Benchmarks. ICAPS 2006: 52-62

Malte Helmert, Robert Mattmüller, Sven Schewe: Selective Approaches for Solving Weak Games. ATVA 2006: 200-214

Sebastian Kupferschmid, Malte Helmert: A Skat Player Based on Monte-Carlo Simulation. Computers and Games 2006: 135-147

Malte Helmert, Robert Mattmüller, Gabriele Röger: Aproximation Properties of Planning Benchmarks. ECAI 2006: 585-589

Malte Helmert: A Planning Heuristic Based on Causal Graph Analysis. ICAPS 2004: 161-170

Malte Helmert: Complexity results for standard benchmark domains in planning. Artif. Intell. 143(2): 219-262 (2003)

Malte Helmert: Decidability and Undecidability Results for Planning with Numerical State Variables. AIPS 2002: 44-53

Malte Helmert: Decidability and Undecidability Results for Planning with Numerical State Variables. PuK 2002

Stefan Edelkamp, Malte Helmert: MIPS: The Model-Checking Integrated Planning System. AI Magazine 22(3): 67-72 (2001)

Stefan Edelkamp, Malte Helmert: Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length. ECP 1999: 135-147