Uni-Logo

Robert Mattmüller – Publikationen

(Alle Abstracts einblenden) (Alle Abstracts ausblenden)

2020

  • David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller und 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), S. 61–69. 2020.
    (Abstract einblenden) (PDF)

  • Dominik Drexler, David Speck und 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), S. 23–31. 2020.
    (Abstract einblenden) (PDF)

  • Thorsten Engesser, Robert Mattmüller, Bernhard Nebel und Felicitas Ritter.
    Token-based Execution Semantics for Multi-Agent Epistemic Planning.
    In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR-2020), S. 351-360. 2020.

  • Thorsten Engesser, Robert Mattmüller, Bernhard Nebel und Felicitas Ritter.
    Token-based Execution Semantics for Multi-Agent Epistemic Planning.
    In Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning (KR-2020), S. 351-360. 2020.
    (Abstract einblenden) (Online; PDF)

  • David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller und Marius Lindauer.
    Learning Heuristic Selection with Dynamic Algorithm Configuration.
    Technischer Bericht arXiv:2006.08246, arxiv cs.AI, 2020.
    Superseded by the PRL 2020 paper by the same authors.
    (Abstract einblenden) (PDF; Online)

  • Felix Lindner, Robert Mattmüller und Bernhard Nebel.
    Evaluation of the Moral Permissibility of Action Plans.
    Artificial Intelligence 287. 2020.
    (Abstract einblenden) (PDF)

  • David Speck, Florian Geißer und Robert Mattmüller.
    When Perfect is not Good Enough: On the Search Behaviour of Symbolic Heuristic Search.
    In Proceedings of the 30th International Conference on Automated Planning and Scheduling (ICAPS 2020), S. 263-271. 2020.
    (Abstract einblenden) (PDF)

  • David Speck, Robert Mattmüller und Bernhard Nebel.
    Symbolic Top-k Planning.
    In Proceedings of the 34th AAAI Conference on Artificial Intelligence (AAAI 2020), S. 9967-9974. 2020.
    (Abstract einblenden) (PDF)

2019

  • Daniel Reifsteck, Thorsten Engesser, Robert Mattmüller und Bernhard Nebel.
    Epistemic Multi-agent Planning Using Monte-Carlo Tree Search.
    In KI 2019: Advances in Artificial Intelligence - 42nd German Conference on AI, S. 277-289. 2019.

  • Sumitra Corraya, Florian Geißer, David Speck und Robert Mattmüller.
    An Empirical Study of the Usefulness of State-Dependent Action Costs in Planning.
    In Proceedings of the 42th German Conference on Artificial Intelligence (KI 2019), S. 123-130. 2019.
    (Abstract einblenden) (PDF; Online)

  • Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller und .
    Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract).
    In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2019), S. 6372-6374. 2019.

  • David Speck, Florian Geißer, Robert Mattmüller und Álvaro Torralba.
    Symbolic Planning with Axioms.
    In Proceedings of the 29th International Conference on Automated Planning and Scheduling (ICAPS 2019), S. 464-572. 2019.
    (Abstract einblenden) (PDF)

  • Thomas Bolander, Thorsten Engesser, Andreas Herzig, Robert Mattmüller und Bernhard Nebel.
    The Dynamic Logic of Policies and Contingent Planning.
    In Logics in Artificial Intelligence - 16th European Conference (JELIA-2019), S. 659-674. 2019.
    (Abstract einblenden)

  • Bernhard Nebel, Thomas Bolander, Thorsten Engesser und Robert Mattmüller.
    Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity.
    Journal of Artificial Intelligence Research 64, S. 497-527. 2019.
    (Abstract einblenden) (PDF)

  • Felix Lindner, Robert Mattmüller und Bernhard Nebel.
    Moral Permissibility of Action Plans.
    In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI-19). 2019.
    (PDF)

2018

  • Thomas Bolander, Thorsten Engesser, Robert Mattmüller und Bernhard Nebel.
    Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination.
    In Proceedings of the Sixteenth Conference on Principles of Knowledge Representation and Reasoning (KR18), S. 445-453. 2018.
    (Abstract einblenden) (PDF)

  • Benedict Wright, Robert Mattmüller und Bernhard Nebel.
    Compiling Away Soft Trajectory Constraints in Planning.
    In Proceedings of the Sixteenth COnference on Principles of Knowledge Representation and Reasoning (KR18), S. 474-482. 2018.
    (Abstract einblenden) (PDF)

  • Thorsten Engesser, Robert Mattmüller, Bernhard Nebel und Michael Thielscher.
    Game Description Language and Dynamic Epistemic Logic Compared.
    In Proceedings of International Joint Conference on Artificial Intelligence (IJCAI 2018), S. 1795-1802. 2018.
    (Abstract einblenden) (PDF)

  • Bernhard Nebel, Thomas Bolander, Thorsten Engesser und Robert Mattmüller.
    Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty.
    Technischer Bericht 287, Institut für Informatik, Albert-Ludwigs-Universität, 2018.
    (Abstract einblenden) (PDF)

  • David Speck, Florian Geißer und Robert Mattmüller.
    Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams.
    In Proceedings of the 28th International Conference on Automated Planning and Scheduling (ICAPS 2018). 2018.
    (Abstract einblenden) (PDF) (technical report with proofs; PDF)

  • Benedict Wright, Robert Mattmüller und Bernhard Nebel.
    Compiling Away Soft Trajectory Constraints in Planning.
    In Proceedings of the Workshop on Knowledge Engineering for Planning and Scheduling (KEPS18), S. 38-45. 2018.
    (Abstract einblenden) (PDF)

  • Felix Lindner, Robert Mattmüller und Bernhard Nebel.
    Moral Permissibility of Action Plans.
    In Proceedings of the ICAPS Workshop on EXplainable AI Planning (XAIP). 2018.
    (Abstract einblenden) (PDF)

  • David Speck, Florian Geißer und Robert Mattmüller.
    SYMPLE: Symbolic Planning based on EVMDDs.
    In The 9th International Planning Competition (IPC 2018), S. 82-85. 2018.
    (Abstract einblenden) (PDF)

  • Robert Mattmüller, Florian Geißer, Benedict Wright und Bernhard Nebel.
    On the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning.
    In Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence (AAAI 2018). 2018.
    (Abstract einblenden) (PDF)

2017

  • Robert Mattmüller, Florian Geißer, Benedict Wright und Bernhard Nebel.
    On the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning.
    In Proceedings of the 9th Workshop on Heuristics and Search for Domain-Independent Planning (HSDIP 2017). 2017.
    Superseded by the AAAI 2018 paper by the same name.
    (Abstract einblenden) (PDF)

  • Thorsten Engesser, Thomas Bolander, Robert Mattmüller und Bernhard Nebel.
    Cooperative Epistemic Multi-Agent Planning for Implicit Coordination.
    In Proceedings of the Ninth Workshop on Methods for Modalities (M4M 2017). 2017.
    (Abstract einblenden) (PDF) (BIB)

2016

  • Benedict Wright und Robert Mattmüller.
    Automated Data Management Workflow Generation with Ontologies and Planning.
    In Proceedings of the 30th Workshop on Planen/Scheduling und Konfigurieren/Entwerfen (PUK 2016). 2016.
    (PDF)

  • Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer und Robert Mattmüller.
    State-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning (Extended Abstract).
    In Proceedings of the 39th German Conference on Artificial Intelligence (KI 2016). 2016.
    (Abstract einblenden) (PDF)

  • Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer und Robert Mattmüller.
    State-dependent Cost Partitionings for Cartesian Abstractions in Classical Planning:Full Proofs.
    Technischer Bericht CS-2016-002, University of Basel, 2016.
    (Abstract einblenden) (PDF)

  • Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer und 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). 2016.
    (Abstract einblenden) (PDF)

  • Florian Geißer, Thomas Keller und 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). 2016.
    (Abstract einblenden) (PDF)

  • Thomas Bolander, Thorsten Engesser, Robert Mattmüller und Bernhard Nebel.
    Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination.
    In Proceedings of the ICAPS-2016 Workshop on Distributed and Multi-Agent Planning (DMAP 2016). 2016.
    Superseded by the KR18 paper by the same authors.
    (Abstract einblenden) (PDF) (BIB)

2015

  • Johannes Aldinger, Robert Mattmüller und Moritz Göbelbecker.
    Complexity Issues of Interval Relaxed Numeric Planning.
    In KI 2015: Advances in Artificial Intelligence (KI 2015). 2015.
    (Abstract einblenden) (PDF) (BIB)

  • David Speck, Manuela Ortlieb und Robert Mattmüller.
    Necessary Observations in Nondeterministic Planning.
    In Proceedings of the 38th German Conference on Artificial Intelligence (KI 2015). 2015.
    (Abstract einblenden) (PDF) (BIB)

  • Florian Geißer, Thomas Keller und Robert Mattmüller.
    Delete Relaxations for Planning with State-Dependent Action Costs.
    In Proceedings of the 24th International Joint Conference on Artificial Intelligence (IJCAI 2015). 2015.
    (Abstract einblenden) (PDF) (BIB)

  • Florian Geißer, Thomas Keller und Robert Mattmüller.
    Delete Relaxations for Planning with State-Dependent Action Costs.
    In Proceedings of the 8th Annual Symposium on Combinatorial Search (SoCS 2015). 2015.
    Extended abstract of the IJCAI 2015 paper by the same name.
    (Abstract einblenden) (PDF) (BIB)

  • Johannes Aldinger, Robert Mattmüller und Moritz Göbelbecker.
    Complexity Issues of Interval Relaxed Numeric Planning.
    In Proceedings of the ICAPS-2015 Workshop on Heuristic and Search for Domain-Independent Planning (HSDIP 2015). 2015.
    Superseded by the KI 2015 paper of the same name..
    (Abstract einblenden) (PDF) (BIB)

  • Thorsten Engesser, Thomas Bolander, Robert Mattmüller und Bernhard Nebel.
    Cooperative Epistemic Multi-Agent Planning With Implicit Coordination.
    In Proceedings of the ICAPS-2015 Workshop on Distributed and Multi-Agent Planning (DMAP 2015). 2015.
    Superseded by the M4M 2017 paper by the same authors.
    (Abstract einblenden) (PDF) (BIB)

  • Jonas Thiem, Robert Mattmüller und Manuela Ortlieb.
    Counterexample-Guided Abstraction Refinement for POND Planning.
    In Proceedings of the ICAPS-2015 Workshop on Model Checking and Automated Planning (MOCHAP 2015). 2015.
    (Abstract einblenden) (PDF) (BIB)

  • Dominik Winterer, Robert Mattmüller und Martin Wehrle.
    Stubborn Sets for Fully Observable Nondeterministic Planning.
    In Proceedings of the ICAPS-2015 Workshop on Model Checking and Automated Planning (MOCHAP 2015). 2015.
    (Abstract einblenden) (PDF) (BIB)

2014

  • Robert Mattmüller, Manuela Ortlieb und Erik Wacker.
    Minimizing Necessary Observations for Nondeterministic Planning.
    In Proceedings of the 37th German Conference on Artificial Intelligence (KI 2014). 2014.
    (Abstract einblenden) (PDF)

  • Dr. Andreas Hertle, Christian Dornhege, Thomas Keller, Robert Mattmüller, Manuela Ortlieb und Bernhard Nebel.
    An Experimental Comparison of Classical, FOND and Probabilistic Planning.
    In Proceedings of the 37th German Conference on Artificial Intelligence (KI 2014), S. 297-308. Springer 2014.
    (Abstract einblenden) (PDF) (BIB)

  • Florian Geißer, Thomas Keller und Robert Mattmüller.
    Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games.
    In Proceedings of the 21st European Conference on Artificial Intelligence (ECAI 2014), S. 357-362. 2014.
    (Abstract einblenden) (PDF) (BIB)

  • Dr. Yusra Alkhazraji, Michael Katz, Robert Mattmüller, Florian Pommerening, Alexander Shleyfman und Martin Wehrle.
    Metis: Arming Fast Downward with Pruning and Incremental Computation (planner abstract).
    In the 8th International Planning Competition (IPC 2014) (deterministic track). 2014.
    (Abstract einblenden) (PDF)

2013

  • Manuela Ortlieb und Robert Mattmüller.
    Pattern-Database Heuristics for Partially Observable Nondeterministic Planning.
    In Proceedings of the 36th German Conference on Artificial Intelligence (KI 2013). 2013.
    (Abstract einblenden) (PDF) (slides; PDF)

  • Martin Wehrle, Malte Helmert, Dr. Yusra Alkhazraji und 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 (ICAPS13). 2013.
    (Abstract einblenden) (PDF)

2012

2011

  • Hans-Jörg Peter, Rüdiger Ehlers und Robert Mattmüller.
    Synthia: Verification and Synthesis for Timed Automata.
    In Proceedings of the 23rd International Conference on Computer Aided Verification (CAV 2011), S. 649-655. Springer-Verlag 2011.
    (Abstract einblenden) (PDF)

2010

  • Rüdiger Ehlers, Robert Mattmüller und Hans-Jörg Peter.
    Combining Symbolic Representations for Solving Timed Games.
    In Proceedings of the 8th International Conference on Formal Modelling and Analysis of Timed Systems (FORMATS 2010), S. 107-121. Springer-Verlag 2010.
    (Abstract einblenden) (PDF)

  • J. Benton, Kartik Talamadupula, Patrick Eyerich, Robert Mattmüller und Subbarao Kambhampati.
    G-value Plateaus: A Challenge for Planning.
    In Ronen Brafman, Héctor Geffner, Jörg Hoffmann und Henry Kautz (Hrsg.), Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), S. 259-262. AAAI Press 2010.
    (Abstract einblenden) (PDF) (BIB)

  • Robert Mattmüller, Manuela Ortlieb, Malte Helmert und Pascal Bercher.
    Pattern Database Heuristics for Fully Observable Nondeterministic Planning.
    In Ronen Brafman, Héctor Geffner, Jörg Hoffmann und Henry Kautz (Hrsg.), Proceedings of the 20th International Conference on Automated Planning and Scheduling (ICAPS 2010), S. 105-112. AAAI Press 2010.
    (Abstract einblenden) (PDF) (slides; PDF) (BIB)

2009

  • Hans-Jörg Peter und Robert Mattmüller.
    Component-based Abstraction Refinement for Timed Controller Synthesis.
    In Theodore P. Baker (Hrsg.), Proceedings of the 30th IEEE Real-Time Systems Symposium (RTSS 2009), S. 364-374. IEEE Computer Society 2009.
    (Abstract einblenden) (PDF) (BIB)

  • Patrick Eyerich, Robert Mattmüller und Gabriele Röger.
    Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning.
    In Proceedings of the 19th International Conference on Automated Planning and Scheduling (ICAPS 2009), S. 130-137. AAAI Press 2009.
    (Abstract einblenden) (PDF) (slides; PDF) (BIB)

  • Pascal Bercher und Robert Mattmüller.
    Solving Non-deterministic Planning Problems with Pattern Database Heuristics.
    In B. Mertsching, M. Hund und Z. Aziz (Hrsg.), Proceedings of the 32nd Annual Conference on Artificial Intelligence (KI 2009), S. 57-64. Springer-Verlag 2009.
    (Abstract einblenden) (PDF) (slides; PDF) (BIB)

2008

  • Pascal Bercher und Robert Mattmüller.
    A Planning Graph Heuristic for Forward-Chaining Adversarial Planning.
    In Proceedings of the 18th European Conference on Artificial Intelligence (ECAI 2008), S. 921-922. IOS Press 2008.
    (Abstract einblenden) (PDF) (slides; PDF) (poster; PDF) (BIB)

  • Malte Helmert und Robert Mattmüller.
    Accuracy of Admissible Heuristic Functions in Selected Planning Domains.
    In Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI 2008), S. 938-943. AAAI Press 2008.
    (Abstract einblenden) (PDF) (slides; PDF) (BIB)

2007

  • Malte Helmert und 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.
    (Abstract einblenden) (PDF)

  • Robert Mattmüller und Jussi Rintanen.
    Planning for Temporally Extended Goals as Propositional Satisfiability.
    In Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI 2007), S. 1966-1971. 2007.
    (Abstract einblenden) (PDF) (PS.GZ) (poster; PDF) (BIB)

2006

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

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

  • Robert Mattmüller.
    Erfüllbarkeitsbasierte Handlungsplanung mit temporal erweiterten Zielen.
    Diplomarbeit, Albert-Ludwigs-Universität, Freiburg, Germany 2006.
    In German.
    (PDF)