Robert Mattmüller

Orcid: 0000-0002-1705-5476

According to our database1, Robert Mattmüller authored at least 45 papers between 2006 and 2022.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Loopless Top-K Planning.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

2021
Game description language and dynamic epistemic logic compared.
Artif. Intell., 2021

On the Compilability and Expressive Power of State-Dependent Action Costs.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Learning Heuristic Selection with Dynamic Algorithm Configuration.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Evaluation of the moral permissibility of action plans.
Artif. Intell., 2020

Token-based Execution Semantics for Multi-Agent Epistemic Planning.
Proceedings of the 17th International Conference on Principles of Knowledge Representation and Reasoning, 2020

When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Symbolic Top-k Planning.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity.
J. Artif. Intell. Res., 2019

Epistemic Multi-agent Planning Using Monte-Carlo Tree Search.
Proceedings of the KI 2019: Advances in Artificial Intelligence, 2019

An Empirical Study of the Usefulness of State-Dependent Action Costs in Planning.
Proceedings of the KI 2019: Advances in Artificial Intelligence, 2019

The Dynamic Logic of Policies and Contingent Planning.
Proceedings of the Logics in Artificial Intelligence - 16th European Conference, 2019

Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract).
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Symbolic Planning with Axioms.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Moral Permissibility of Action Plans.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Compiling Away Soft Trajectory Constraints in Planning.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination.
Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Sixteenth International Conference, 2018

Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams.
Proceedings of the Twenty-Eighth International Conference on Automated Planning and Scheduling, 2018

On the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Cooperative Epistemic Multi-Agent Planning for Implicit Coordination.
Proceedings of the Ninth Workshop on Methods for Modalities, 2017

2016
State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

Abstractions for Planning with State-Dependent Action Costs.
Proceedings of the Twenty-Sixth International Conference on Automated Planning and Scheduling, 2016

2015
Delete Relaxations for Planning with State-Dependent Action Costs.
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Necessary Observations in Nondeterministic Planning.
Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015

Complexity of Interval Relaxed Numeric Planning.
Proceedings of the KI 2015: Advances in Artificial Intelligence, 2015

2014
Minimizing Necessary Observations for Nondeterministic Planning.
Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

An Experimental Comparison of Classical, FOND and Probabilistic Planning.
Proceedings of the KI 2014: Advances in Artificial Intelligence, 2014

Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

2013
Informed progression search for fully observable nondeterministic planning = Informierte Vorwärtssuche für nichtdeterministisches Planen unter vollständiger Beobachtbarkeit.
PhD thesis, 2013

Pattern-Database Heuristics for Partially Observable Nondeterministic Planning.
Proceedings of the KI 2013: Advances in Artificial Intelligence, 2013

The Relative Pruning Power of Strong Stubborn Sets and Expansion Core.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
Using the Context-Enhanced Additive Heuristic for Temporal and Numeric Planning.
Proceedings of the Towards Service Robots for Everyday Environments, 2012

A Stubborn Set Algorithm for Optimal Planning.
Proceedings of the ECAI 2012, 2012

2011
Synthia: Verification and Synthesis for Timed Automata.
Proceedings of the Computer Aided Verification - 23rd International Conference, 2011

2010
Combining Symbolic Representations for Solving Timed Games.
Proceedings of the Formal Modeling and Analysis of Timed Systems, 2010

Pattern Database Heuristics for Fully Observable Nondeterministic Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

G-Value Plateaus: A Challenge for Planning.
Proceedings of the 20th International Conference on Automated Planning and Scheduling, 2010

2009
Component-Based Abstraction Refinement for Timed Controller Synthesis.
Proceedings of the 30th IEEE Real-Time Systems Symposium, 2009

Solving Non-deterministic Planning Problems with Pattern Database Heuristics.
Proceedings of the KI 2009: Advances in Artificial Intelligence, 2009

Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning.
Proceedings of the 19th International Conference on Automated Planning and Scheduling, 2009

2008
A Planning Graph Heuristic for Forward-Chaining Adversarial Planning.
Proceedings of the ECAI 2008, 2008

Accuracy of Admissible Heuristic Functions in Selected Planning Domains.
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence, 2008

2007
Planning for Temporally Extended Goals as Propositional Satisfiability.
Proceedings of the IJCAI 2007, 2007

2006
Aproximation Properties of Planning Benchmarks.
Proceedings of the ECAI 2006, 17th European Conference on Artificial Intelligence, August 29, 2006

Selective Approaches for Solving Weak Games.
Proceedings of the Automated Technology for Verification and Analysis, 2006


  Loading...