Uni-Logo

Publications

Complete list of publications

Recent publications (last 12 months):

(Show all abstracts) (Hide all abstracts)

  • Roman Barták, Simona Ondrčková, Gregor Behnke and Pascal Bercher.
    Correcting Hierarchical Plans by Action Deletion.
    In Proceedings of the 18th International Conference on Principles of Knowledge Representation and Reasoning (KR-2021). 2021.
    (PDF)

  • Roman Barták, Simona Ondrčková, Gregor Behnke and Pascal Bercher.
    Correcting Hierarchical Plans by Action Deletion.
    In Proceedings of the Fourth ICAPS Workshop on Hierarchical Planning. 2021.
    (PDF)

  • Roman Barták, Simona Ondrčková, Gregor Behnke and Pascal Bercher.
    On the Verification of Totally-Ordered HTN Plans.
    In Proceedings of the Fourth ICAPS Workshop on Hierarchical Planning, pp. 44-48. 2021.
    (PDF)

  • Daniel Höller, Julia Whichlacz, Pascal Bercher and Gregor Behnke.
    Compiling HTN Plan Verification Problems into HTN Planning Problems.
    In Proceedings of the Fourth ICAPS Workshop on Hierarchical Planning, pp. 8-15. 2021.
    (PDF)

  • Pascal Bercher, Gregor Behnke, Matthias Kraus, Marvin Schiller, Dietrich Manstetten, Michael Dambier, Michael Dorna, Wolfgang Minker, Birte Glimm and Susanne Biundo.
    Do It Yourself, but Not Alone: Companion-Technology for Home Improvement - Bringing a Planning-Based Interactive DIY Assistant to Life.
    Künstliche Intelligenz -- Special Issue on NLP and Semantics. 2021.
    (Show abstract)

  • Gregor Behnke.
    Block Compression and Invariant Pruning for SAT-based Totally-Ordered HTN Planning.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
    (Show abstract) (PDF)

  • Daniel Höller and Gregor Behnke.
    Loop Detection in the PANDA Planning System.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021). 2021.
    (Show abstract) (PDF)

  • David Speck, David Borukhson, Robert Mattmüller and Bernhard Nebel.
    On the Compilability and Expressive Power of State-Dependent Action Costs.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 358-366. 2021.
    (Show abstract) (PDF)

  • David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller and Marius Lindauer.
    Learning Heuristic Selection with Dynamic Algorithm Configuration.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 597-605. 2021.
    (Show abstract) (PDF)

  • Dominik Drexler, Jendrik Seipp and David Speck.
    Subset-Saturated Transition Cost Partitioning.
    In Proceedings of the 31st International Conference on Automated Planning and Scheduling (ICAPS 2021), pp. 131-139. 2021.
    (Show abstract) (PDF)

  • Thorsten Engesser, Robert Mattmüller, Bernhard Nebel and Michael Thielscher.
    Game description language and dynamic epistemic logic compared.
    Artificial Intelligence 292. 2021.
    (Show abstract)

  • Daniel Höller, Gregor Behnke, Pascal Bercher and Susanne Biundo.
    The PANDA Framework for Hierarchical Planning.
    KI - Künstliche Intelligenz. 2021.
    (Online)

  • David Speck and Michael Katz.
    Symbolic Search for Oversubscription Planning.
    In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), pp. 11972-11980. 2021.
    (Show abstract) (PDF)

  • Gregor Behnke and David Speck.
    Symbolic Search for Optimal Total-Order HTN Planning.
    In Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI 2021), p. 11744–11754. 2021.
    (Show abstract) (PDF)

  • Patrick Caspari, Robert Mattmüller and Tim Schulte.
    A Framework to Prove Strong Privacy in Multi-Agent Planning.
    In Proceedings of the 6th Workshop on Distributed and Multi-Agent Planning (DMAP 2020), pp. 32-39. 2020.
    (PDF)

  • David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller and Marius Lindauer.
    Learning Heuristic Selection with Dynamic Algorithm Configuration.
    In Proceedings of the Workshop on Bridging the Gap Between AI Planning and Reinforcement Learning (PRL 2020), p. 61–69. 2020.
    Superseded by the ICAPS 2021 paper by the same authors.
    (Show abstract) (PDF)

  • Dominik Drexler, David Speck and Robert Mattmüller.
    Subset-Saturated Transition Cost Partitioning for Optimal Classical Planning.
    In Proceedings of the 12th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2020), p. 23–31. 2020.
    Superseded by the ICAPS 2021 paper "Subset-Saturated Transition Cost Partitioning".
    (Show abstract) (PDF)