Prof. Dr. Malte Helmert – Publications

(Show all abstracts) (Hide all abstracts)

2017

  • Salomé Eriksson, Gabriele Röger and Malte Helmert.
    Unsolvability Certificates for Classical Planning.
    In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017). 2017.
    (Show abstract) (PDF)

  • Florian Pommerening, Malte Helmert and Blai Bonet.
    Abstraction Heuristics, Cost Partitioning and Network Flows.
    In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017). 2017.
    (Show abstract) (PDF)

  • Jendrik Seipp, Thomas Keller and Malte Helmert.
    A Comparison of Cost Partitioning Algorithms for Optimal Classical Planning.
    In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017). 2017.
    (Show abstract) (PDF)

  • Florian Pommerening, Malte Helmert and Blai Bonet.
    Higher-Dimensional Potential Heuristics for Optimal Classical Planning.
    In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 3636-3643. 2017.
    (Show abstract) (PDF) (slides; PDF)

  • Jendrik Seipp, Thomas Keller and Malte Helmert.
    Narrowing the Gap Between Saturated and Optimal Cost Partitioning for Classical Planning.
    In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 3651-3657. 2017.
    (Show abstract) (PDF) (slides; PDF)

2016

  • Gerhard Friedrich, Malte Helmert and Franz Wotawa (eds.).
    KI 2016: Advances in Artificial Intelligence.
    Springer-Verlag 2016.
    (Springer Online)

  • Martin Wehrle, Silvan Sievers and Malte Helmert.
    Graph-Based Factorization of Classical Planning Problems.
    In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 3286-3292. 2016.
    (Show abstract) (PDF)

  • Jendrik Seipp, Florian Pommerening, Gabriele Röger and Malte Helmert.
    Correlation Complexity of Classical Planning Domains.
    In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 3242-3250. 2016.
    (Show abstract) (PDF) (slides; PDF)

  • Gerald Paul and Malte Helmert.
    Optimal Solitaire Game Solutions using A* Search and Deadlock Analysis.
    In Proceedings of the 9th Annual Symposium on Combinatorial Search (SoCS 2016), pp. 135-136. 2016.
    A non-archival, but longer version of this paper has been published at the HSDIP workshop of ICAPS 2016. See the separate entry for that paper. We recommend citing the SoCS paper in scholarly publications.
    (Show abstract) (PDF)

  • Silvan Sievers, Martin Wehrle and Malte Helmert.
    An Analysis of Merge Strategies for Merge-and-Shrink Heuristics.
    In Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS 2016), pp. 294-298. 2016.
    (Show abstract) (PDF) (technical report; PDF) (slides; PDF)

  • Gerald Paul and Malte Helmert.
    Optimal Solitaire Game Solutions using A* Search and Deadlock Analysis.
    In Proceedings of the ICAPS-2016 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2016), pp. 52-60. 2016.
    An archival, but shorter version of this paper has been published at SoCS 2016. See the separate entry for that paper. We recommend citing the SoCS paper in scholarly publications.
    (Show abstract) (PDF)

  • Jendrik Seipp, Florian Pommerening, Gabriele Röger and Malte Helmert.
    Correlation Complexity of Classical Planning Domains.
    In Proceedings of the ICAPS-2016 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2016), pp. 12-20. 2016.
    Superseded by the IJCAI 2016 paper by the same name.
    (Show abstract) (PDF) (slides; PDF)

2015

  • Silvan Sievers and Malte Helmert.
    A Doppelkopf Player Based on UCT.
    In Proceedings of the 38th Annual German Conference on Artificial Intelligence (KI 2015), pp. 151-165. 2015.
    (Show abstract) (PDF) (slides; PDF)

  • Silvan Sievers, Martin Wehrle, Malte Helmert and Michael Katz.
    An Empirical Case Study on Symmetry Handling in Cost-Optimal Planning as Heuristic Search.
    In Proceedings of the 38th Annual German Conference on Artificial Intelligence (KI 2015), pp. 166-180. 2015.
    (Show abstract) (PDF) (slides; PDF)

  • Florian Pommerening, Gabriele Röger, Malte Helmert and Blai Bonet.
    Heuristics for Cost-Optimal Classical Planning based on Linear Programming.
    In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 4303-4309. 2015.
    Note: This paper was invited for submission to the Best Papers From Sister Conferences Track, based on a paper that appeared in the International Conference on Automated Planning and Scheduling (ICAPS) 2014. When referring to this work, please cite the ICAPS 2014 paper instead of this version.
    (Show abstract) (PDF)

  • Martin Wehrle, Malte Helmert, Alexander Shleyfman and Michael Katz.
    Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning.
    In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015), pp. 1712-1718. 2015.
    (Show abstract) (PDF) (technical report; PDF)

  • Florian Pommerening and Malte Helmert.
    A Normal Form for Classical Planning Tasks.
    In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 188-192. 2015.
    (Show abstract) (PDF) (slides; PDF)

  • Malte Helmert, Gabriele Röger and Silvan Sievers.
    On the Expressive Power of Non-Linear Merge-and-Shrink Representations.
    In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 106-114. 2015.
    (Show abstract) (PDF)

  • Jendrik Seipp, Florian Pommerening and Malte Helmert.
    New Optimization Functions for Potential Heuristics.
    In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 193-201. 2015.
    (Show abstract) (PDF) (slides; PDF)

  • Jendrik Seipp, Silvan Sievers, Malte Helmert and Frank Hutter.
    Automatic Configuration of Sequential Planning Portfolios.
    In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3364-3370. 2015.
    (Show abstract) (PDF) (technical report with portfolios; PDF) (slides; PDF)

  • Alexander Shleyfman, Michael Katz, Malte Helmert, Silvan Sievers and Martin Wehrle.
    Heuristics and Symmetries in Classical Planning.
    In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3371-3377. 2015.
    (Show abstract) (PDF) (technical report; PDF)

  • Silvan Sievers, Martin Wehrle, Malte Helmert, Alexander Shleyfman and Michael Katz.
    Factored Symmetries for Merge-and-Shrink Abstractions.
    In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3378-3385. 2015.
    (Show abstract) (PDF)

  • Florian Pommerening, Malte Helmert, Gabriele Röger and Jendrik Seipp.
    From Non-Negative to General Operator Cost Partitioning.
    In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3335-3341. 2015.
    (Show abstract) (PDF) (slides; PDF) (technical report; PDF) (erratum; PDF)

2014

  • Silvan Sievers, Martin Wehrle and Malte Helmert.
    Bounded Intention Planning Revisited.
    In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), pp. 1097-1098. 2014.
    Erratum: On the first page, right column, the paper describes a zero-cost "freeze operator intention" operator Freeze(v, x). In addition to the stated precondition and effect, there should also be a prevail condition: prv[v]=x.
    (Show abstract) (PDF) (technical report; PDF)

  • Gabriele Röger, Florian Pommerening and Malte Helmert.
    Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context-Splitting.
    In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), pp. 765-770. 2014.
    (Show abstract) (PDF)

  • Nathan R. Sturtevant, Ariel Felner and Malte Helmert.
    Exploiting the Rubik's Cube 12-Edge PDB by Combining Partial Pattern Databases and Bloom Filters.
    In Proceedings of the Seventh Annual Symposium on Combinatorial Search (SoCS 2014), pp. 175-183. 2014.
    (Show abstract) (PDF)

  • Silvan Sievers, Martin Wehrle and Malte Helmert.
    Generalized Label Reduction for Merge-and-Shrink Heuristics.
    In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 2358-2366. 2014.
    (Show abstract) (PDF) (slides; PDF)

  • Florian Pommerening, Gabriele Röger, Malte Helmert and Blai Bonet.
    LP-based Heuristics for Cost-optimal Planning.
    In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 226-234. 2014.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF)

  • Jendrik Seipp and Malte Helmert.
    Diverse and Additive Cartesian Abstraction Heuristics.
    In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 289-297. 2014.
    (Show abstract) (PDF) (slides; PDF)

  • Martin Wehrle and Malte Helmert.
    Efficient Stubborn Sets: Generalized Algorithms and Selection Strategies.
    In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 323-331. 2014.
    (Show abstract) (PDF)

  • Manuel Heusner, Martin Wehrle, Florian Pommerening and Malte Helmert.
    Under-Approximation Refinement for Classical Planning.
    In Proceedings of the 24th International Conference on Automated Planning and Scheduling (ICAPS 2014), pp. 365-369. 2014.
    (Show abstract) (PDF)

  • Gabriele Röger, Florian Pommerening and Malte Helmert.
    Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context-Splitting.
    In Proceedings of the ICAPS-2014 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP), pp. 80-87. 2014.
    Superseded by the ECAI 2014 paper by the same name.
    (Show abstract) (PDF)

  • Silvan Sievers, Martin Wehrle and Malte Helmert.
    Generalized Label Reduction for Merge-and-Shrink Heuristics.
    In Proceedings of the ICAPS-2014 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP), pp. 107-115. 2014.
    Superseded by the AAAI 2014 paper by the same name.
    (Show abstract) (PDF)

  • Malte Helmert, Patrik Haslum, Jörg Hoffmann and Raz Nissim.
    Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces.
    Journal of the ACM 61 (3), pp. 16:1-63. 2014.
    Erratum: On page 16:44, the paper states that "A portfolio of two merge-and-shrink variants, namely RL-G-Ninfinity-T1 and RL-G-N200k-T200k, won a 2nd prize at this track of IPC'11". The second of the two mentioned variants should be RL-B-N200k-T200k.
    (Show abstract) (PDF)

2013

  • Thomas Keller and Malte Helmert.
    Trial-based Heuristic Tree Search for Finite Horizon MDPs.
    In Proceedings of the 1st Multidisciplinary Conference on Reinforcement Learning and Decision Making (RLDM 2013), pp. 101-105. Princeton, New Jersey, USA 2013.
    Superseded by the ICAPS 2013 paper by the same name.
    (Show abstract) (PDF)

  • Carlos Linares López, Sergio Jiménez and Malte Helmert.
    Automating the evaluation of planning systems.
    AI Communications 26 (4), pp. 331-354. 2013.
    (Show abstract) (PDF)

  • Florian Pommerening, Gabriele Röger and Malte Helmert.
    Getting the Most Out of Pattern Databases for Classical Planning.
    In Proceedings of the 23rd International Joint Conference on Artificial Intelligence (IJCAI 2013), pp. 2357-2364. 2013.
    (Show abstract) (PDF) (slides; PDF) (poster; PDF)

  • Jendrik Seipp and Malte Helmert.
    Additive Counterexample-guided Cartesian Abstraction Refinement.
    In Late-Breaking Developments in the Field of Artificial Intelligence - Papers Presented at the Twenty-Seventh AAAI Conference on Artificial Intelligence (AAAI 2013), pp. 119-121. 2013.
    (Show abstract) (PDF)

  • Malte Helmert and Gabriele Röger (eds.).
    Proceedings of the Sixth Annual Symposium on Combinatorial Search (SoCS 2013).
    AAAI Press 2013.

  • Jendrik Seipp and Malte Helmert.
    Counterexample-guided Cartesian Abstraction Refinement.
    In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 347-351. 2013.
    (Show abstract) (PDF) (slides; PDF)

  • Martin Wehrle, Malte Helmert, Yusra Alkhazraji and Robert Mattmüller.
    The Relative Pruning Power of Strong Stubborn Sets and Expansion Core.
    In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 251-259. 2013.
    (Show abstract) (PDF) (technical report; PDF)

  • Patrik Haslum, Malte Helmert and Anders Jonsson.
    Safe, Strong and Tractable Relevance Analysis for Planning.
    In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 317-321. 2013.
    (Show abstract) (PDF)

  • Patrick Eyerich and Malte Helmert.
    Stronger Abstraction Heuristics Through Perimeter Search.
    In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 303-307. 2013.
    (Show abstract) (PDF)

  • Thomas Keller and Malte Helmert.
    Trial-based Heuristic Tree Search for Finite Horizon MDPs.
    In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 135-143. 2013.
    (Show abstract) (PDF)

  • Florian Pommerening and Malte Helmert.
    Incremental LM-Cut.
    In Proceedings of the 23rd International Conference on Automated Planning and Scheduling (ICAPS 2013), pp. 162-170. 2013.
    (Show abstract) (PDF) (slides; PDF)

2012

  • Yusra Alkhazraji, Martin Wehrle, Robert Mattmüller and Malte Helmert.
    A Stubborn Set Algorithm for Optimal Planning.
    In Proceedings of the 20th European Conference on Artificial Intelligence (ECAI 2012), pp. 891-892. 2012.
    (Show abstract) (PDF)

  • Gabriele Röger and Malte Helmert.
    Non-optimal Multi-Agent Pathfinding is Solved (Since 1984).
    In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), pp. 173-174. 2012.
    A non-archival version of this paper was also presented at the AAAI 2012 Workshop on Multi-Agent Pathfinding (WoMP)..
    (Show abstract) (PDF)

  • Jordan T. Thayer, J. Benton and Malte Helmert.
    Better Parameter-Free Anytime Search by Minimizing Time Between Solutions.
    In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), pp. 120-128. 2012.
    The version of this paper that is published in the official SoCS 2012 proceedings is missing the correct graphs in Figure 4. Instead, it shows the same graphs as in Figure 5. The version of the paper available for download here corrects this error.
    (Show abstract) (PDF)

  • Silvan Sievers, Manuela Ortlieb and Malte Helmert.
    Efficient Implementation of Pattern Database Heuristics for Classical Planning.
    In Proceedings of the Fifth Annual Symposium on Combinatorial Search (SoCS 2012), pp. 105-111. 2012.
    (Show abstract) (PDF)

  • Florian Pommerening and Malte Helmert.
    Optimal Planning for Delete-free Tasks with Incremental LM-cut.
    In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 363-367. 2012.
    (Show abstract) (PDF) (slides; PDF)

  • Jendrik Seipp, Manuel Braun, Johannes Garimort and Malte Helmert.
    Learning Portfolios of Automatically Tuned Planners.
    In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 368-372. 2012.
    Erratum: This version of the paper fixes a small mistake in the published version. In Section "Tuning Planners", the published version states that preferred operators are used in 20 of the 21 configurations. The correct statement is that they are used in 19 of the 21 configurations.
    (Show abstract) (PDF) (technical report; PDF) (slides; PDF)

  • Martin Wehrle and Malte Helmert.
    About Partial Order Reduction in Planning and Computer Aided Verification.
    In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 297-305. 2012.
    (Show abstract) (PDF)

  • Michael Katz, Jörg Hoffmann and Malte Helmert.
    How to Relax a Bisimulation?
    In Proceedings of the 22nd International Conference on Automated Planning and Scheduling (ICAPS 2012), pp. 101-109. 2012.
    (Show abstract) (PDF) (technical report with extended version; PDF)

  • Ute Schmid, Stefan Mandl, Helmar Gust, Emanuel Kitzelmann, Malte Helmert, Hendrik Buschmeier, Ramin Yaghoubzadeh, Christian Pietsch, Stefan Kopp, Joachim Hertzberg, Jochen Sprickerhof and Thomas Wiemann.
    What Language Do You Use to Create Your AI Programs and Why?
    KI – Künstliche Intelligenz 26 (1), pp. 99-106. 2012.
    Authors' preprint. See also the final publication at www.springerlink.com.
    (PDF)

2011

  • Raz Nissim, Jörg Hoffmann and Malte Helmert.
    Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstractions in Optimal Planning.
    In Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (IJCAI 2011), pp. 1983-1990. 2011.
    Erratum: In Section 7, we introduce greedy bisimulation as only respecting the bisimulation property for transitions (s, l, s') where sd(s) <= sd(s'). The implementation we evaluate in Section 8 is actually even more greedy than that, only respecting transitions where sd(s) < sd(s'). Using the definition from Section 7 leads to a strategy that behaves very similarly to the strategies using regular (non-greedy) bisimulation on these benchmarks.
    (Show abstract) (PDF)

  • Carmel Domshlak, Malte Helmert, Erez Karpas, Emil Keyder, Silvia Richter, Gabriele Röger, Jendrik Seipp and Matthias Westphal.
    BJOLP: The Big Joint Optimal Landmarks Planner (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 91-95. 2011.
    (Show abstract) (PDF)

  • Silvia Richter, Matthias Westphal and Malte Helmert.
    LAMA 2008 and 2011 (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 50-54. 2011.
    (Show abstract) (PDF)

  • Malte Helmert and Carmel Domshlak.
    LM-Cut: Optimal Planning with the Landmark-Cut Heuristic (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 103-105. 2011.
    (Show abstract) (PDF)

  • Raz Nissim, Jörg Hoffmann and Malte Helmert.
    The Merge-and-Shrink Planner: Bisimulation-based Abstraction for Optimal Planning (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 106-107. 2011.
    (Show abstract) (PDF)

  • Carmel Domshlak, Malte Helmert, Erez Karpas and Shaul Markovitch.
    The SelMax Planner: Online Learning for Speeding up Optimal Planning (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 108-112. 2011.
    (Show abstract) (PDF)

  • Malte Helmert, Gabriele Röger, Jendrik Seipp, Erez Karpas, Jörg Hoffmann, Emil Keyder, Raz Nissim, Silvia Richter and Matthias Westphal.
    Fast Downward Stone Soup (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 38-45. 2011.
    (Show abstract) (PDF)

  • Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
    FD-Autotune: Automated Configuration of Fast Downward (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Deterministic Part, pp. 31-37. 2011.
    (Show abstract) (PDF)

  • Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
    FD-Autotune: Domain-Specific Configuration using Fast Downward (planner abstract).
    In Seventh International Planning Competition (IPC 2011), Planning and Learning Part. 2011.
    (Show abstract) (PDF)

  • Malte Helmert, Gabriele Röger and Erez Karpas.
    Fast Downward Stone Soup: A Baseline for Building Planner Portfolios.
    In Proceedings of the ICAPS-2011 Workshop on Planning and Learning (PAL), pp. 28-35. 2011.
    (Show abstract) (PDF)

  • Chris Fawcett, Malte Helmert, Holger Hoos, Erez Karpas, Gabriele Röger and Jendrik Seipp.
    FD-Autotune: Domain-Specific Configuration using Fast Downward.
    In Proceedings of the ICAPS-2011 Workshop on Planning and Learning (PAL), pp. 13-20. 2011.
    (Show abstract) (PDF)

  • Raz Nissim, Jörg Hoffmann and Malte Helmert.
    Computing Perfect Heuristics in Polynomial Time: On Bisimulation and Merge-and-Shrink Abstractions in Optimal Planning.
    In Proceedings of the ICAPS-2011 Workshop on Heuristics for Domain-independent Planning (HDIP), pp. 5-13. 2011.
    Superseded by the IJCAI 2011 paper by the same name..
    (Show abstract) (PDF)

  • Jendrik Seipp and Malte Helmert.
    Fluent Merging for Classical Planning Problems.
    In Proceedings of the ICAPS-2011 Workshop on Knowledge Engineering for Planning and Scheduling (KEPS), pp. 47-53. 2011.
    Note: This version of the paper fixes two mistakes (in Def. 2 and in the text after Def. 3) that are present in the version of the paper that is linked from the workshop webpage.
    (Show abstract) (PDF) (slides; PDF)

  • Fahiem Bacchus, Carmel Domshlak, Stefan Edelkamp and Malte Helmert (eds.).
    Proceedings of the 21st International Conference on Automated Planning and Scheduling (ICAPS 2011).
    AAAI Press 2011.

2010

  • Malte Helmert and Gabriele Röger.
    Relative-Order Abstractions for the Pancake Problem.
    In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 745-750. 2010.
    (Show abstract) (PDF)

  • Blai Bonet and Malte Helmert.
    Strengthening Landmark Heuristics via Hitting Sets.
    In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 329-334. 2010.
    (Show abstract) (PDF) (technical report with proofs; PDF)

  • Emil Keyder, Silvia Richter and Malte Helmert.
    Sound and Complete Landmarks for And/Or Graphs.
    In Proceedings of the 19th European Conference on Artificial Intelligence (ECAI 2010), pp. 335-340. 2010.
    (Show abstract) (PDF)

  • Malte Helmert.
    Lessons Learned from Benchmarking in the Automated Planning Community.
    In Proceedings of the ECAI 2010 Workshop on Benchmarking Intelligent (Multi-) Robot Systems. 2010.
    (PDF)

  • Patrick Eyerich, Thomas Keller and Malte Helmert.
    High-Quality Policies for the Canadian Traveler's Problem.
    In Proceedings of the Twenty-Fourth AAAI Conference on Artificial Intelligence (AAAI 2010), pp. 51-58. 2010.
    (Show abstract) (PDF)

  • Patrick Eyerich, Thomas Keller and Malte Helmert.
    High-Quality Policies for the Canadian Traveler's Problem (Extended Abstract).
    In Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS 2010), pp. 147-148. 2010.
    Extended abstract of the AAAI paper by the same name.
    (PDF)

  • Malte Helmert.
    Landmark Heuristics for the Pancake Problem.
    In Proceedings of the Third Annual Symposium on Combinatorial Search (SoCS 2010), pp. 109-110. 2010.
    (Show abstract) (PDF)

  • Malte Helmert and Hauke Lasinger.
    The Scanalyzer Domain: Greenhouse Logistics as a Planning Problem.
    In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 234-237. 2010.
    (Show abstract) (PDF)

  • Robert Mattmüller, Manuela Ortlieb, Malte Helmert and Pascal Bercher.
    Pattern Database Heuristics for Fully Observable Nondeterministic Planning.
    In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 105-112. 2010.
    (Show abstract) (PDF) (slides; PDF)

  • Gabriele Röger and Malte Helmert.
    The More, the Merrier: Combining Heuristic Estimators for Satisficing Planning.
    In Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), pp. 246-249. 2010.
    (Show abstract) (PDF) (technical report; PDF)

  • Patrick Eyerich, Thomas Keller and Malte Helmert.
    High-Quality Policies for the Canadian Traveler's Problem.
    In Proceedings of the ICAPS-2010 Workshop on Planning and Scheduling Under Uncertainty. 2010.
    Superseded by the AAAI 2010 paper by the same name.
    (Show abstract) (PDF)

2009

  • Dunbo Cai, Jörg Hoffmann and Malte Helmert.
    Enhancing the Context-Enhanced Additive Heuristic with Precedence Constraints.
    In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 50-57. 2009.
    (Show abstract) (PDF)

  • Malte Helmert and Carmel Domshlak.
    Landmarks, Critical Paths and Abstractions: What's the Difference Anyway?
    In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 162-169. 2009.
    (Show abstract) (PDF) (Dagstuhl abstract; PDF)

  • Silvia Richter and Malte Helmert.
    Preferred Operators and Deferred Evaluation in Satisficing Planning.
    In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), pp. 273-280. 2009.
    (Show abstract) (PDF)

  • Christoph Betz and Malte Helmert.
    Planning with h+ in Theory and Practice.
    In Proceedings of the 2nd Workshop on Heuristics for Domain-independent Planning at ICAPS 2009. 2009.
    (Show abstract) (PDF)

  • Gabriele Röger and Malte Helmert.
    Combining Heuristic Estimators for Satisficing Planning.
    In Proceedings of the 2nd Workshop on Heuristics for Domain-independent Planning at ICAPS 2009. 2009.
    (Show abstract) (PDF)

  • Christoph Betz and Malte Helmert.
    Planning with h+ in Theory and Practice.
    In Proceedings of the 32nd Annual German Conference on Artificial Intelligence (KI 2009), pp. 9-16. 2009.
    (Show abstract) (PDF)

  • Martin Wehrle and Malte Helmert.
    The Causal Graph Revisited for Directed Model Checking.
    In Proceedings of the 16th International Static Analysis Symposium (SAS 2009), pp. 86-101. 2009.
    Erratum: The first paragraph of Section 4 of the paper contains the following statement: "For now, let us just remark that deciding the existence of error traces is already PSPACE-complete for systems with acyclic causal graphs, even under the further restriction that all processes have only two locations [1]." However, the reference only shows that this problem variant is NP-hard. A proof of PSPACE-completeness has been given by Jonsson, Jonsson and Lööw (AIJ 210:36-55, 2014)..
    (Show abstract) (PDF) (Dagstuhl abstract; PDF)

  • Malte Helmert.
    Research Statement: Heuristic Search for Domain-Independent Planning.
    In 2nd International Symposium on Combinatorial Search (SoCS 2009). 2009.
    (PDF)

  • Jörg Hoffmann, Piergiorgio Bertoli, Malte Helmert and Marco Pistore.
    Message-Based Web Service Composition, Integrity Constraints, and Planning under Uncertainty: A New Connection.
    Journal of Artificial Intelligence Research 35, pp. 49-117. 2009.
    (Show abstract) (PDF)

  • Malte Helmert.
    Concise finite-domain representations for PDDL planning tasks.
    Artificial Intelligence 173 (5-6), pp. 503-535. 2009.
    (Show abstract) (PDF)

2008

  • Gabriele Röger, Malte Helmert and Bernhard Nebel.
    On the Relative Expressiveness of ADL and Golog: The Last Piece in the Puzzle.
    In Proceedings of the Eleventh International Conference on Principles of Knowledge Representation and Reasoning (KR 2008), pp. 544-550. 2008.
    (Show abstract) (PDF)

  • Malte Helmert and Héctor Geffner.
    Unifying the Causal Graph and Additive Heuristics.
    In Proceedings of the 18th International Conference on Automated Planning and Scheduling (ICAPS 2008), pp. 140-147. 2008.
    (Show abstract) (PDF)

  • Malte Helmert, Patrik Haslum and Jörg Hoffmann.
    Explicit-State Abstraction: A New Method for Generating Heuristic Functions.
    In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 1547-1550. 2008.
    (Show abstract) (PDF) (slides; PDF)

  • Malte Helmert and Gabriele Röger.
    How Good is Almost Perfect?
    In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 944-949. 2008.
    (Show abstract) (PDF) (slides; PDF)

  • Malte Helmert and Robert Mattmüller.
    Accuracy of Admissible Heuristic Functions in Selected Planning Domains.
    In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 938-943. 2008.
    (Show abstract) (PDF) (slides; PDF)

  • Silvia Richter, Malte Helmert and Matthias Westphal.
    Landmarks Revisited.
    In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), pp. 975-982. 2008.
    Note: After publication, we found a bug in our implementation that affects the results in the columns "CG heuristic/local" and "blind heuristic/local" of Table 1. The version of the paper available for download here corrects these errors.
    (Show abstract) (PDF) (slides; PDF)

  • Malte Helmert.
    Understanding Planning Tasks: Domain Complexity and Heuristic Decomposition.
    Springer-Verlag 2008.
    (Springer Online)

2007

  • Malte Helmert, Patrik Haslum and Jörg Hoffmann.
    Flexible Abstraction Heuristics for Optimal Sequential Planning.
    In Proceedings of the Seventeenth International Conference on Automated Planning and Scheduling (ICAPS 2007), pp. 176-183. 2007.
    (Show abstract) (PDF)

  • Malte Helmert and Gabriele Röger.
    How Good is Almost Perfect?
    In Proceedings of the ICAPS-2007 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges. 2007.
    Superseded by the AAAI 2008 paper by the same name.
    (Show abstract) (PDF)

  • Malte Helmert and Robert Mattmüller.
    On the Accuracy of Admissible Heuristic Functions in Selected Planning Domains.
    In Proceedings of the ICAPS-2007 Workshop on Heuristics for Domain-independent Planning: Progress, Ideas, Limitations, Challenges. 2007.
    Superseded by the AAAI 2008 paper by the same name.
    (Show abstract) (PDF)

  • Silvia Richter, Malte Helmert and Charles Gretton.
    A Stochastic Local Search Approach to Vertex Cover.
    In Proceedings of the 30th Annual German Conference on Artificial Intelligence (KI 2007), pp. 412-426. 2007.
    (Show abstract) (PDF)

  • Patrik Haslum, Adi Botea, Malte Helmert, Blai Bonet and Sven Koenig.
    Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning.
    In Proceedings of the 22nd AAAI Conference on Artificial Intelligence (AAAI 2007), pp. 1007-1012. 2007.
    (Show abstract) (PDF)

2006

  • Malte Helmert, Robert Mattmüller and Sven Schewe.
    Selective Approaches for Solving Weak Games.
    In Proceedings of the Fourth International Symposium on Automated Technology for Verification and Analysis (ATVA 2006), pp. 200-214. 2006.
    (Show abstract) (PDF)

  • Malte Helmert, Robert Mattmüller and Gabriele Röger.
    Approximation Properties of Planning Benchmarks.
    In Proceedings of the 17th European Conference on Artificial Intelligence (ECAI 2006), pp. 585-589. 2006.
    (Show abstract) (PDF)

  • Malte Helmert.
    New Complexity Results for Classical Planning Benchmarks.
    In Proceedings of the Sixteenth International Conference on Automated Planning and Scheduling (ICAPS 2006), pp. 52-61. 2006.
    (Show abstract) (PDF)

  • Sebastian Kupferschmid and Malte Helmert.
    A Skat Player Based on Monte Carlo Simulation.
    In Proceedings of the Fifth International Conference on Computer and Games (CG 2006), pp. 135-147. 2006.
    (Show abstract) (PDF)

  • Malte Helmert.
    The Fast Downward Planning System.
    Journal of Artificial Intelligence Research 26, pp. 191-246. 2006.
    (Show abstract) (PDF)

2004

  • Malte Helmert.
    A Planning Heuristic Based on Causal Graph Analysis.
    In Proceedings of the Fourteenth International Conference on Automated Planning and Scheduling (ICAPS 2004), pp. 161-170. 2004.
    (Show abstract) (PDF)

2003

  • Malte Helmert.
    Complexity results for standard benchmark domains in planning.
    Artificial Intelligence 143 (2), pp. 219-262. 2003.
    (Show abstract) (PDF)

2002

  • Malte Helmert.
    Decidability and Undecidability Results for Planning with Numerical State Variables.
    In Proceedings of the Sixth International Conference on Artificial Intelligence Planning and Scheduling (AIPS 2002), pp. 303-312. 2002.
    (Show abstract) (PDF)

2001

  • Stefan Edelkamp and Malte Helmert.
    The Model Checking Integrated Planning System (MIPS).
    AI Magazine 22 (3), pp. 67-71. 2001.
    (Show abstract) (PDF)

  • Malte Helmert.
    On the Complexity of Planning in Transportation Domains.
    In Proceedings of the 6th European Conference on Planning (ECP 2001), pp. 120-126. 2001.
    (Show abstract) (PDF)

  • Malte Helmert.
    On the Complexity of Planning in Transportation and Manipulation Domains.
    Diploma thesis, Albert-Ludwigs-Universität Freiburg, 2001.
    (Show abstract) (PDF)

2000

  • Stefan Edelkamp and Malte Helmert.
    On the Implementation of MIPS.
    In Proceedings of the AIPS-2000 Workshop on Model-Theoretic Approaches to Planning. 2000.
    (Show abstract) (PDF)

1999

  • Malte Helmert.
    Implementation eines Planers zur symbolischen Exploration mit binären Entscheidungsdiagrammen.
    Student project, Albert-Ludwigs-Universität Freiburg, 1999.
    In German.
    (Show abstract) (PDF)

  • Stefan Edelkamp and Malte Helmert.
    Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length.
    In Proceedings of the 5th European Conference on Planning (ECP 1999), pp. 135-147. 1999.
    (Show abstract) (PDF)