Publications

This page shows the publications of the Artificial Intelligence group of the University of Basel. For a full list of an author's publications, please consult their personal publications page:

[Salomé Eriksson]    [Cedric Geissmann]    [Malte Helmert]    [Manuel Heusner]    [Thomas Keller]    [Florian Pommerening]    [Gabriele Röger]    [Jendrik Seipp]    [Silvan Sievers]   

Publications by year

[2017]    [2016]    [2015]    [2014]    [2013]    [2012]    [2011]   

(Show all abstracts) (Hide all abstracts)

2017

  • Silvan Sievers, Gabriele Röger, Martin Wehrle and Michael Katz.
    Structural Symmetries of the Lifted Representation of Classical Planning Tasks.
    In Proceedings of the ICAPS-2017 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2017). 2017.
    (Show abstract) (PDF)

  • Silvan Sievers, Martin Wehrle, Malte Helmert and Michael Katz.
    Strengthening Canonical Pattern Databases with Structural Symmetries.
    In Proceedings of the ICAPS-2017 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP 2017). 2017.
    Superseded by the SoCS 2017 paper by the same name.
    (Show abstract) (PDF)

  • Dominik Winterer, Yusra Alkhazraji, Michael Katz and Martin Wehrle.
    Stubborn Sets for Fully Observable Nondeterministic Planning.
    In Proceedings of the 27th International Conference on Automated Planning and Scheduling (ICAPS 2017). 2017.
    (Show abstract)

  • 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)

  • Silvan Sievers, Martin Wehrle, Malte Helmert and Michael Katz.
    Strengthening Canonical Pattern Databases with Structural Symmetries.
    In Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017). 2017.
    (Show abstract) (PDF)

  • Manuel Heusner, Thomas Keller and Malte Helmert.
    Understanding the Search Behaviour of Greedy Best-First Search.
    In Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017). 2017.
    (Show abstract) (PDF)

  • Jendrik Seipp.
    Better Orders for Saturated Cost Partitioning in Optimal Classical Planning.
    In Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017). 2017.
    (Show abstract) (PDF)

  • Gerald Paul, Gabriele Röger, Thomas Keller and Malte Helmert.
    Optimal Solutions to Large Logistics Planning Domain Problems.
    In Proceedings of the 10th Annual Symposium on Combinatorial Search (SoCS 2017). 2017.
    (Show abstract) (PDF) (technical report; 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)

  • Nathan R. Sturtevant, Ariel Felner and Malte Helmert.
    Value Compression of Pattern Databases.
    In Proceedings of the 31st AAAI Conference on Artificial Intelligence (AAAI 2017), pp. 912-918. 2017.
    (Show abstract) (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)

  • Sergiy Bogomolov, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor T. Johnson, Hamed Ladan, Andreas Podelski and Martin Wehrle.
    Guided Search for Hybrid Systems Based on Coarse-Grained Space Abstractions.
    International Journal on Software Tools for Technology Transfer 18 (4), pp. 449-467. 2016.
    (Show abstract) (PDF)

  • Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer and Robert Mattmüller.
    State-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning.
    In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 3161-3169. 2016.
    (Show abstract) (PDF) (technical report; PDF)

  • Daniel Gnad, Martin Wehrle and Jörg Hoffmann.
    Decoupled Strong Stubborn Sets.
    In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 3110-3116. 2016.
    Note: A non-archival version of this paper has also been presented at the HSDIP workshop at ICAPS 2016.
    (Show abstract) (PDF)

  • Dominik Winterer, Martin Wehrle and Michael Katz.
    Structural Symmetries for Fully Observable Nondeterministic Planning.
    In Proceedings of the 25th International Joint Conference on Artificial Intelligence (IJCAI 2016), pp. 3293-3299. 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)

  • Yusra Alkhazraji and Martin Wehrle.
    Sleep Sets Meet Duplicate Elimination.
    In Proceedings of the 9th Annual Symposium on Combinatorial Search (SoCS 2016), pp. 2-9. 2016.
    (Show abstract) (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)

  • Florian Geißer, Thomas Keller and Robert Mattmüller.
    Abstractions for Planning with State-Dependent Action Costs.
    In Proceedings of the 26th International Conference on Automated Planning and Scheduling (ICAPS 2016), pp. 140-148. 2016.
    (Show abstract) (PDF)

  • Jendrik Seipp, Florian Pommerening, Silvan Sievers, Martin Wehrle, Chris Fawcett and Yusra Alkhazraji.
    Fast Downward Aidos (planner abstract).
    In First Unsolvability International Planning Competition. 2016.
    (PDF)

  • Daniel Gnad, Álvaro Torralba, Jörg Hoffmann and Martin Wehrle.
    Decoupled Search for Proving Unsolvability (planner abstract).
    In First Unsolvability International Planning Competition. 2016.
    (PDF)

  • Florian Pommerening and Jendrik Seipp.
    Fast Downward Dead-End Pattern Database (planner abstract).
    In First Unsolvability International Planning Competition. 2016.
    (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)

  • Danijel Skočaj, Alen Vrečko, Marko Mahnič, Miroslav Janíček, Geert-Jan Kruijff, Marc Hanheide, Nick Hawes, Jeremy Wyatt, Thomas Keller, Kai Zhou, Michael Zillich and Matej Kristan.
    An integrated system for interactive continuous learning of categorical knowledge.
    Journal of Experimental & Theoretical Artificial Intelligence, pp. 823-848. 2016.
    (Show abstract) (Link)

  • Martin Wehrle and Sebastian Kupferschmid.
    Downward Pattern Refinement for Timed Automata.
    International Journal on Software Tools for Technology Transfer 18 (1), pp. 41-56. 2016.
    (Show abstract) (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)

  • Ahmad Siyar Andisha, Martin Wehrle and Bernd Westphal.
    Directed Model Checking for PROMELA with Relaxation-Based Distance Functions.
    In Proceedings of the 22nd International SPIN Symposium on Model Checking of Software (SPIN 2015), pp. 153-159. 2015.
    (Show abstract) (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)

  • Salomé Simon and Gabriele Röger.
    Finding and Exploiting LTL Trajectory Constraints in Heuristic Search.
    In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015), pp. 113-121. 2015.
    A non-archival version of this paper was also presented at the ICAPS-2015 Workshop on Heuristics and Search for Domain-independent Planning (HSDIP).
    (Show abstract) (PDF) (slides; PDF) (slides HSDIP; PDF)

  • Sascha Scherrer, Florian Pommerening and Martin Wehrle.
    Improved Pattern Selection for PDB Heuristics in Classical Planning (Extended Abstract).
    In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015), pp. 216-217. 2015.
    (Show abstract) (PDF) (poster; PDF)

  • Sergiy Bogomolov, Daniele Magazzeni, Stefano Minopoli and Martin Wehrle.
    PDDL+ Planning with Hybrid Automata: Foundations of Translating Must Behavior.
    In Proceedings of the 25th International Conference on Automated Planning and Scheduling (ICAPS 2015), pp. 42-46. 2015.
    (Show abstract) (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)

  • Dominik Winterer, Robert Mattmüller and Martin Wehrle.
    Stubborn Sets for Fully Observable Nondeterministic Planning.
    In Proceedings of the ICAPS-2015 Workshop on Model Checking and Automated Planning (MOCHAP), pp. 6-12. 2015.
    (Show abstract) (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)

  • Robert C. Holte, Yusra Alkhazraji and Martin Wehrle.
    A Generalization of Sleep Sets Based on Operator Sequence Redundancy.
    In Proceedings of the 29th AAAI Conference on Artificial Intelligence (AAAI 2015), pp. 3291-3297. 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)

  • Gabriele Röger and Florian Pommerening.
    Linear Programming for Heuristics in Optimal Planning.
    In Proceedings of the AAAI-2015 Workshop on Planning, Search, and Optimization (PlanSOpt), pp. 69-76. 2015.
    (Show abstract) (PDF)

2014

  • Jendrik Seipp, Silvan Sievers and Frank Hutter.
    Fast Downward Cedalion (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Planning and Learning Part. 2014.
    (PDF)

  • Jendrik Seipp, Silvan Sievers and Frank Hutter.
    Fast Downward SMAC (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Planning and Learning Part. 2014.
    (PDF)

  • 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)

  • Sergiy Bogomolov, Daniele Magazzeni, Andreas Podelski and Martin Wehrle.
    Planning as Model Checking in Hybrid Domains.
    In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 2228-2234. 2014.
    (Show abstract) (PDF)

  • Johannes Löhr, Martin Wehrle, Maria Fox and Bernhard Nebel.
    Symbolic Domain Predictive Control.
    In Proceedings of the 28th AAAI Conference on Artificial Intelligence (AAAI 2014), pp. 2315-2321. 2014.
    (Show abstract) (PDF)

  • Stephan Arlt, Andreas Podelski and Martin Wehrle.
    Reducing GUI Test Suites via Program Slicing.
    In Proceedings of the International Symposium on Software Testing and Analysis (ISSTA 2014), pp. 270-281. 2014.
    (Show abstract) (PDF)

  • Gabriele Röger, Florian Pommerening and Jendrik Seipp.
    Fast Downward Stone Soup 2014 (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Deterministic Part, pp. 28-31. 2014.
    (PDF)

  • Yusra Alkhazraji, Michael Katz, Robert Mattmüller, Florian Pommerening, Alexander Shleyfman and Martin Wehrle.
    Metis: Arming Fast Downward with Pruning and Incremental Computation.
    In Eighth International Planning Competition (IPC 2014), Deterministic Part, pp. 88-92. 2014.
    (PDF)

  • Jendrik Seipp, Silvan Sievers and Frank Hutter.
    Fast Downward Cedalion (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Deterministic Part, pp. 17-27. 2014.
    (PDF)

  • Jendrik Seipp, Manuel Braun and Johannes Garimort.
    Fast Downward Uniform Portfolio (planner abstract).
    In Eighth International Planning Competition (IPC 2014), Deterministic Part, p. 32. 2014.
    (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.

  • Sergiy Bogomolov, Alexandre Donzé, Goran Frehse, Radu Grosu, Taylor T. Johnson, Hamed Ladan, Andreas Podelski and Martin Wehrle.
    Abstraction-Based Guided Search for Hybrid Systems.
    In Proceedings of the 20th International SPIN Symposium on Model Checking of Software (SPIN 2013), pp. 117-134. 2013.
    (Show abstract) (PDF)

  • 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

  • Martin Wehrle and Sebastian Kupferschmid.
    Mcta: Heuristics and Search for Timed Systems.
    In Proceedings of the 10th International Conference on Formal Modeling and Analysis of Timed Systems (FORMATS 2012), pp. 252-266. 2012.
    (Show abstract) (PDF)

  • 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)

  • Sergiy Bogomolov, Goran Frehse, Radu Grosu, Hamed Ladan, Andreas Podelski and Martin Wehrle.
    A Box-based Distance between Regions for Guiding the Reachability Analysis of SpaceEx.
    In Proceedings of the 24th International Conference on Computer Aided Verification (CAV 2012), pp. 479-494. 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)

  • Jens Claßen, Gabriele Röger, Gerhard Lakemeyer and Bernhard Nebel.
    PLATAS – Integrating Planning and the Action Language Golog.
    KI – Künstliche Intelligenz 26 (1), pp. 61-67. 2012.
    Authors' preprint. See also the final publication at www.springerlink.com.
    (Show abstract) (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.