| Using the context-enhanced additive heuristic for temporal and numeric planning P Eyerich, R Mattmüller, G Röger Towards Service Robots for Everyday Environments, 49-64, 2012 | 168 | 2012 |
| Cooperative epistemic multi-agent planning for implicit coordination T Engesser, T Bolander, R Mattmüller, B Nebel arXiv preprint arXiv:1703.02196, 2017 | 40 | 2017 |
| Accuracy of Admissible Heuristic Functions in Selected Planning Domains. M Helmert, R Mattmüller AAAI, 938-943, 2008 | 37 | 2008 |
| A Stubborn Set Algorithm for Optimal Planning. Y Alkhazraji, M Wehrle, R Mattmüller, M Helmert ECAI 242, 891-892, 2012 | 34 | 2012 |
| The relative pruning power of strong stubborn sets and expansion core M Wehrle, M Helmert, Y Alkhazraji, R Mattmüller AAAI Press, 2013 | 33 | 2013 |
| G-Value Plateaus: A Challenge for Planning. J Benton, K Talamadupula, P Eyerich, R Mattmüller, S Kambhampati ICAPS, 259-262, 2010 | 29 | 2010 |
| Pattern database heuristics for fully observable nondeterministic planning R Mattmüller, M Ortlieb, M Helmert, P Bercher ICAPS, 2010 | 29 | 2010 |
| Synthia: Verification and synthesis for timed automata HJ Peter, R Ehlers, R Mattmüller International Conference on Computer Aided Verification, 649-655, 2011 | 26 | 2011 |
| Planning for temporally extended goals as propositional satisfiability R Mattmüller, J Rintanen IJCAI, 2007 | 20 | 2007 |
| Abstractions for planning with state-dependent action costs F Geißer, T Keller, R Mattmüller Proc. ICAPS 2016, 2016 | 18 | 2016 |
| Delete relaxations for planning with state-dependent action costs F Geißer, T Keller, R Mattmüller Proceedings of the 24th International Conference on Artificial Intelligence …, 2015 | 17 | 2015 |
| A Planning Graph Heuristic for Forward-Chaining Adversarial Planning. P Bercher, R Mattmüller ECAI 8, 921-922, 2008 | 17 | 2008 |
| Approximation properties of planning benchmarks M Helmert, R Mattmüller, G Röger ECAI, 2006 | 17 | 2006 |
| Better eager than lazy? How agent types impact the successfulness of implicit coordination T Bolander, T Engesser, R Mattmüller, B Nebel Sixteenth International Conference on Principles of Knowledge Representation …, 2018 | 16 | 2018 |
| Combining symbolic representations for solving timed games R Ehlers, R Mattmüller, HJ Peter International Conference on Formal Modeling and Analysis of Timed Systems …, 2010 | 16 | 2010 |
| Complexity of interval relaxed numeric planning J Aldinger, R Mattmüller, M Göbelbecker Joint German/Austrian Conference on Artificial Intelligence (Künstliche …, 2015 | 15 | 2015 |
| Component-based abstraction refinement for timed controller synthesis HJ Peter, R Mattmüller 2009 30th IEEE Real-Time Systems Symposium, 364-374, 2009 | 14 | 2009 |
| State-dependent cost partitionings for cartesian abstractions in classical planning T Keller, F Pommerening, J Seipp, F Geißer, R Mattmüller KI 2016: Advances in Artificial Intelligence: 39th Annual German Conference …, 2016 | 10 | 2016 |
| Past, Present, and Future: An Optimal Online Algorithm for Single-Player GDL-II Games. F Geißer, T Keller, R Mattmüller ECAI 14, 357-362, 2014 | 10 | 2014 |
| Game Description Language and Dynamic Epistemic Logic Compared. T Engesser, R Mattmüller, B Nebel, M Thielscher IJCAI 18, 1795-1802, 2018 | 9 | 2018 |
Bernhard NebelProfessor für Informatik, Universität FreiburgVerified email at uni-freiburg.de
