Robert Mattmüller
Refine list

refinements active!
zoomed in on ?? of ?? records
view refined list in
showing all ?? records
2010 – today
- 2017
- [c25]Thorsten Engesser, Thomas Bolander, Robert Mattmüller, Bernhard Nebel:
Cooperative Epistemic Multi-Agent Planning for Implicit Coordination. M4M@ICLA 2017: 75-90 - 2016
- [c24]Florian Geißer, Thomas Keller, Robert Mattmüller:
Abstractions for Planning with State-Dependent Action Costs. ICAPS 2016: 140-148 - [c23]Thomas Keller, Florian Pommerening, Jendrik Seipp, Florian Geißer, Robert Mattmüller:
State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning. IJCAI 2016: 3161-3169 - 2015
- [c22]Florian Geißer, Thomas Keller, Robert Mattmüller:
Delete Relaxations for Planning with State-Dependent Action Costs. IJCAI 2015: 1573-1579 - [c21]Johannes Aldinger, Robert Mattmüller, Moritz Göbelbecker:
Complexity of Interval Relaxed Numeric Planning. KI 2015: 19-31 - [c20]David Speck, Manuela Ortlieb, Robert Mattmüller:
Necessary Observations in Nondeterministic Planning. KI 2015: 181-193 - [c19]Florian Geißer, Thomas Keller, Robert Mattmüller:
Delete Relaxations for Planning with State-Dependent Action Costs. SOCS 2015: 228-229 - 2014
- [c18]Florian Geißer, Thomas Keller, Robert Mattmüller:
Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games. ECAI 2014: 357-362 - [c17]Andreas Hertle, Christian Dornhege, Thomas Keller, Robert Mattmüller, Manuela Ortlieb, Bernhard Nebel:
An Experimental Comparison of Classical, FOND and Probabilistic Planning. KI 2014: 297-308 - [c16]Robert Mattmüller, Manuela Ortlieb, Erik Wacker:
Minimizing Necessary Observations for Nondeterministic Planning. KI 2014: 309-320 - 2013
- [b1]Robert Mattmüller:
Informed progression search for fully observable nondeterministic planning = Informierte Vorwärtssuche für nichtdeterministisches Planen unter vollständiger Beobachtbarkeit. University of Freiburg, Germany 2013 - [c15]Martin Wehrle, Malte Helmert, Yusra Alkhazraji, Robert Mattmüller:
The Relative Pruning Power of Strong Stubborn Sets and Expansion Core. ICAPS 2013 - [c14]Manuela Ortlieb, Robert Mattmüller:
Pattern-Database Heuristics for Partially Observable Nondeterministic Planning. KI 2013: 140-151 - 2012
- [c13]Yusra Alkhazraji, Martin Wehrle, Robert Mattmüller, Malte Helmert:
A Stubborn Set Algorithm for Optimal Planning. ECAI 2012: 891-892 - [p1]Patrick Eyerich, Robert Mattmüller, Gabriele Röger:
Using the Context-Enhanced Additive Heuristic for Temporal and Numeric Planning. Towards Service Robots for Everyday Environments 2012: 49-64 - 2011
- [c12]Hans-Jörg Peter, Rüdiger Ehlers, Robert Mattmüller:
Synthia: Verification and Synthesis for Timed Automata. CAV 2011: 649-655 - 2010
- [c11]Robert Mattmüller, Manuela Ortlieb, Malte Helmert, Pascal Bercher:
Pattern Database Heuristics for Fully Observable Nondeterministic Planning. ICAPS 2010: 105-112 - [c10]J. Benton, Kartik Talamadupula, Patrick Eyerich, Robert Mattmüller, Subbarao Kambhampati:
G-Value Plateaus: A Challenge for Planning. ICAPS 2010: 259-262 - [c9]Rüdiger Ehlers, Robert Mattmüller, Hans-Jörg Peter:
Combining Symbolic Representations for Solving Timed Games. FORMATS 2010: 107-121
2000 – 2009
- 2009
- [c8]Patrick Eyerich, Robert Mattmüller, Gabriele Röger:
Using the Context-enhanced Additive Heuristic for Temporal and Numeric Planning. ICAPS 2009 - [c7]Pascal Bercher, Robert Mattmüller:
Solving Non-deterministic Planning Problems with Pattern Database Heuristics. KI 2009: 57-64 - [c6]Hans-Jörg Peter, Robert Mattmüller:
Component-Based Abstraction Refinement for Timed Controller Synthesis. RTSS 2009: 364-374 - 2008
- [c5]Malte Helmert, Robert Mattmüller:
Accuracy of Admissible Heuristic Functions in Selected Planning Domains. AAAI 2008: 938-943 - [c4]Pascal Bercher, Robert Mattmüller:
A Planning Graph Heuristic for Forward-Chaining Adversarial Planning. ECAI 2008: 921-922 - 2007
- [c3]Robert Mattmüller, Jussi Rintanen:
Planning for Temporally Extended Goals as Propositional Satisfiability. IJCAI 2007: 1966- - 2006
- [c2]Malte Helmert, Robert Mattmüller, Sven Schewe:
Selective Approaches for Solving Weak Games. ATVA 2006: 200-214 - [c1]Malte Helmert, Robert Mattmüller, Gabriele Röger:
Aproximation Properties of Planning Benchmarks. ECAI 2006: 585-589
Coauthor Index
data released under the ODC-BY 1.0 license; see also our legal information page
last updated on 2017-12-10 23:27 CET by the dblp team