default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Fiser
Person information
- affiliation: Saarland University, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Ayal Taitler
, Ron Alford, Joan Espasa, Gregor Behnke, Daniel Fiser, Michael Gimelfarb, Florian Pommerening, Scott Sanner, Enrico Scala, Dominik Schreiber, Javier Segovia-Aguas, Jendrik Seipp:
The 2023 International Planning Competition. AI Mag. 45(2): 280-296 (2024)- [c29]Rebecca Eifler, Daniel Fiser, Aleena Siji, Jörg Hoffmann:
Iterative Oversubscription Planning with Goal-Conflict Explanations: Scaling Up Through Policy-Guidance Approximation. ECAI 2024: 4092-4099 - [c28]Jan Eisenhut, Xandra Schuler, Daniel Fiser, Daniel Höller, Maria Christakis, Jörg Hoffmann:
New Fuzzing Biases for Action Policy Testing. ICAPS 2024: 162-167 - [c27]Daniel Fiser, Marcel Steinmetz:
Towards Feasible Higher-Dimensional Potential Heuristics. ICAPS 2024: 210-220 - 2023
- [c26]Daniel Fiser:
Operator Pruning Using Lifted Mutex Groups via Compilation on Lifted Level. ICAPS 2023: 118-127 - [c25]Rostislav Horcík, Daniel Fiser:
Gaifman Graphs in Lifted Planning. ECAI 2023: 1052-1059 - [c24]Julia Wichlacz, Daniel Höller, Daniel Fiser, Jörg Hoffmann:
A Landmark-Cut Heuristic for Lifted Optimal Planning. ECAI 2023: 2623-2630 - 2022
- [c23]Daniel Fiser, Álvaro Torralba, Jörg Hoffmann:
Operator-Potential Heuristics for Symbolic Search. AAAI 2022: 9750-9757 - [c22]Rostislav Horcík, Daniel Fiser, Álvaro Torralba:
Homomorphisms of Lifted Planning Tasks: The Case for Delete-Free Relaxation Heuristics. AAAI 2022: 9767-9775 - [c21]Daniel Fiser, Álvaro Torralba, Jörg Hoffmann:
Operator-Potentials in Symbolic Search: From Forward to Bi-directional Search. ICAPS 2022: 80-89 - [c20]Daniel Gnad, Álvaro Torralba, Daniel Fiser:
Beyond Stars - Generalized Topologies for Decoupled Search. ICAPS 2022: 110-118 - [c19]Marcel Steinmetz, Daniel Fiser, Hasan Ferit Eniser, Patrick Ferber, Timo P. Gros, Philippe Heim, Daniel Höller, Xandra Schuler, Valentin Wüstholz, Maria Christakis, Jörg Hoffmann:
Debugging a Policy: Automatic Action-Policy Testing in AI Planning. ICAPS 2022: 353-361 - 2021
- [c18]Rostislav Horcík, Daniel Fiser:
Endomorphisms of Classical Planning Tasks. AAAI 2021: 11835-11843 - [c17]Rostislav Horcík, Daniel Fiser:
Endomorphisms of Lifted Planning Problems. ICAPS 2021: 174-183 - [c16]Daniel Fiser, Daniel Gnad, Michael Katz, Jörg Hoffmann:
Custom-Design of FDR Encodings: The Case of Red-Black Planning. IJCAI 2021: 4054-4061 - [c15]Pascal Lauer, Álvaro Torralba, Daniel Fiser, Daniel Höller, Julia Wichlacz, Jörg Hoffmann:
Polynomial-Time in PDDL Input Size: Making the Delete Relaxation Feasible for Lifted Planning. IJCAI 2021: 4119-4126 - 2020
- [c14]Daniel Fiser:
Lifted Fact-Alternating Mutex Groups and Pruned Grounding of Classical Planning Problems. AAAI 2020: 9835-9842 - [c13]Daniel Fiser, Rostislav Horcík, Antonín Komenda:
Strengthening Potential Heuristics with Mutexes and Disambiguations. ICAPS 2020: 124-133 - [c12]Lukás Chrpa, Wolfgang Faber, Daniel Fiser, Michael Morak:
Determining Action Reversibility in STRIPS Using Answer Set Programming. ICLP Workshops 2020 - [c11]Michael Morak, Lukás Chrpa, Wolfgang Faber, Daniel Fiser:
On the Reversibility of Actions in Planning. KR 2020: 652-661
2010 – 2019
- 2019
- [c10]Daniel Fiser, Álvaro Torralba, Alexander Shleyfman:
Operator Mutexes and Symmetries for Simplifying Planning Tasks. AAAI 2019: 7586-7593 - [c9]Michal Stolba, Daniel Fiser, Antonín Komenda:
Privacy Leakage of Search-Based Multi-Agent Planning Algorithms. ICAPS 2019: 482-490 - [c8]Michal Stolba, Michaela Urbanovská, Daniel Fiser, Antonín Komenda:
Cost Partitioning for Multi-agent Planning. ICAART (2) 2019: 40-49 - [c7]Michal Stolba, Michaela Urbanovská, Daniel Fiser, Antonín Komenda:
A General Approach to Distributed and Privacy-Preserving Heuristic Computation. ICAART (Revised Selected Papers) 2019: 55-71 - 2018
- [j2]Daniel Fiser, Antonín Komenda:
Fact-Alternating Mutex Groups for Classical Planning. J. Artif. Intell. Res. 61: 475-521 (2018) - [c6]Daniel Fiser, Antonín Komenda:
Concise Finite-Domain Representations for Factored MA-PDDL Planning Tasks. ICAART (2) 2018: 306-313 - [c5]Daniel Fiser, Antonín Komenda:
Fact-Alternating Mutex Groups for Classical Planning (Extended Abstract). IJCAI 2018: 5603-5607 - 2016
- [c4]Michal Stolba, Daniel Fiser, Antonín Komenda:
Potential Heuristics for Multi-Agent Planning. ICAPS 2016: 308-316 - 2015
- [c3]Michal Stolba, Daniel Fiser, Antonín Komenda:
Admissible Landmark Heuristic for Multi-Agent Planning. ICAPS 2015: 211-219 - 2014
- [c2]Vojtech Vonásek, Daniel Fiser, Karel Kosnar, Libor Preucil:
A Light-Weight Robot Simulator for Modular Robotics. MESAS 2014: 206-216 - 2013
- [j1]Daniel Fiser, Jan Faigl, Miroslav Kulich:
Growing neural gas efficiently. Neurocomputing 104: 72-82 (2013) - 2011
- [c1]Tomás Krajník, Vojtech Vonásek, Daniel Fiser, Jan Faigl:
AR-Drone as a Platform for Robotic Research and Education. Eurobot Conference 2011: 172-186
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-28 21:14 CET 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:
