default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert Mattmüller
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c42]Julian von Tschammer, Robert Mattmüller, David Speck:
Loopless Top-K Planning. ICAPS 2022: 380-384- 2021
- [j3]Thorsten Engesser, Robert Mattmüller, Bernhard Nebel
, Michael Thielscher:
Game description language and dynamic epistemic logic compared. Artif. Intell. 292: 103433 (2021) - [c41]David Speck, David Borukhson, Robert Mattmüller, Bernhard Nebel:
On the Compilability and Expressive Power of State-Dependent Action Costs. ICAPS 2021: 358-366 - [c40]David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller, Marius Lindauer:
Learning Heuristic Selection with Dynamic Algorithm Configuration. ICAPS 2021: 597-605 - 2020
- [j2]Felix Lindner, Robert Mattmüller, Bernhard Nebel:
Evaluation of the moral permissibility of action plans. Artif. Intell. 287: 103350 (2020) - [c39]David Speck, Robert Mattmüller, Bernhard Nebel:
Symbolic Top-k Planning. AAAI 2020: 9967-9974 - [c38]David Speck, Florian Geißer, Robert Mattmüller:
When Perfect Is Not Good Enough: On the Search Behaviour of Symbolic Heuristic Search. ICAPS 2020: 263-271 - [c37]Thorsten Engesser, Robert Mattmüller, Bernhard Nebel, Felicitas Ritter:
Token-based Execution Semantics for Multi-Agent Epistemic Planning. KR 2020: 351-360 - [i1]David Speck, André Biedenkapp, Frank Hutter, Robert Mattmüller, Marius Lindauer:
Learning Heuristic Selection with Dynamic Algorithm Configuration. CoRR abs/2006.08246 (2020)
2010 – 2019
- 2019
- [j1]Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller:
Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity. J. Artif. Intell. Res. 64: 497-527 (2019) - [c36]Felix Lindner, Robert Mattmüller, Bernhard Nebel:
Moral Permissibility of Action Plans. AAAI 2019: 7635-7642 - [c35]David Speck, Florian Geißer, Robert Mattmüller, Álvaro Torralba:
Symbolic Planning with Axioms. ICAPS 2019: 464-472 - [c34]Bernhard Nebel, Thomas Bolander, Thorsten Engesser, Robert Mattmüller:
Implicitly Coordinated Multi-Agent Path Finding under Destination Uncertainty: Success Guarantees and Computational Complexity (Extended Abstract). IJCAI 2019: 6372-6376 - [c33]Thomas Bolander, Thorsten Engesser, Andreas Herzig, Robert Mattmüller, Bernhard Nebel:
The Dynamic Logic of Policies and Contingent Planning. JELIA 2019: 659-674 - [c32]Sumitra Corraya, Florian Geißer, David Speck, Robert Mattmüller:
An Empirical Study of the Usefulness of State-Dependent Action Costs in Planning. KI 2019: 123-130 - [c31]Daniel Reifsteck, Thorsten Engesser, Robert Mattmüller, Bernhard Nebel:
Epistemic Multi-agent Planning Using Monte-Carlo Tree Search. KI 2019: 277-289 - 2018
- [c30]Robert Mattmüller, Florian Geißer, Benedict Wright, Bernhard Nebel:
On the Relationship Between State-Dependent Action Costs and Conditional Effects in Planning. AAAI 2018: 6237-6245 - [c29]David Speck, Florian Geißer, Robert Mattmüller:
Symbolic Planning with Edge-Valued Multi-Valued Decision Diagrams. ICAPS 2018: 250-258 - [c28]Thorsten Engesser, Robert Mattmüller, Bernhard Nebel, Michael Thielscher:
Game Description Language and Dynamic Epistemic Logic Compared. IJCAI 2018: 1795-1802 - [c27]Thomas Bolander, Thorsten Engesser, Robert Mattmüller, Bernhard Nebel:
Better Eager Than Lazy? How Agent Types Impact the Successfulness of Implicit Coordination. KR 2018: 445-453 - [c26]Benedict Wright, Robert Mattmüller, Bernhard Nebel:
Compiling Away Soft Trajectory Constraints in Planning. KR 2018: 474-483 - 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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
