default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Pommerening
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]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)- [c32]Paul Höft, David Speck, Florian Pommerening, Jendrik Seipp:
Versatile Cost Partitioning with Exact Sensitivity Analysis. ICAPS 2024: 276-280 - [c31]Florian Pommerening, Clemens Büchner, Thomas Keller:
Transition Landmarks from Abstraction Cuts. ICAPS 2024: 445-454 - 2023
- [c30]Augusto B. Corrêa, Markus Hecher, Malte Helmert, Davide Mario Longo, Florian Pommerening, Stefan Woltran:
Grounding Planning Tasks Using Tree Decompositions and Iterated Solving. ICAPS 2023: 100-108 - [c29]Remo Christen, Salomé Eriksson, Michael Katz, Christian Muise, Alice Petrov, Florian Pommerening, Jendrik Seipp, Silvan Sievers, David Speck:
PARIS: Planning Algorithms for Reconfiguring Independent Sets. ECAI 2023: 453-460 - 2022
- [c28]Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès:
The FF Heuristic for Lifted Classical Planning. AAAI 2022: 9716-9723 - [c27]Remo Christen, Salomé Eriksson, Florian Pommerening, Malte Helmert:
Detecting Unsolvability Based on Separating Functions. ICAPS 2022: 44-52 - [c26]Thorsten Klößner, Florian Pommerening, Thomas Keller, Gabriele Röger:
Cost Partitioning Heuristics for Stochastic Shortest Path Problems. ICAPS 2022: 193-202 - 2021
- [c25]Augusto B. Corrêa, Guillem Francès, Florian Pommerening, Malte Helmert:
Delete-Relaxation Heuristics for Lifted Classical Planning. ICAPS 2021: 94-102 - [c24]Florian Pommerening, Thomas Keller, Valentina Halasi, Jendrik Seipp, Silvan Sievers, Malte Helmert:
Dantzig-Wolfe Decomposition for Cost Partitioning. ICAPS 2021: 271-280 - 2020
- [c23]Augusto B. Corrêa, Florian Pommerening, Malte Helmert, Guillem Francès:
Lifted Successor Generation Using Query Optimization Techniques. ICAPS 2020: 80-89 - [c22]Silvan Sievers, Florian Pommerening, Thomas Keller, Malte Helmert:
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning. IJCAI 2020: 4152-4160 - [c21]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Classical Planning (Extended Abstract). IJCAI 2020: 4770-4774 - [p2]Jörg Hoffmann, Malte Helmert, Daniel Gnad, Florian Pommerening:
Planen. Handbuch der Künstlichen Intelligenz 2020: 395-428
2010 – 2019
- 2019
- [c20]Augusto B. Corrêa, Florian Pommerening:
An Empirical Study of Perfect Potential Heuristics. ICAPS 2019: 114-118 - [c19]Michael Katz, Emil Keyder, Dominik Winterer, Florian Pommerening:
Oversubscription Planning as Classical Planning with Multiple Cost Functions. ICAPS 2019: 237-245 - [c18]Florian Pommerening, Gabriele Röger, Malte Helmert, Hadrien Cambazard, Louis-Martin Rousseau, Domenico Salvagnin:
Lagrangian Decomposition for Optimal Cost Partitioning. ICAPS 2019: 338-347 - [c17]Guillem Francès, Augusto B. Corrêa, Cedric Geissmann, Florian Pommerening:
Generalized Potential Heuristics for Classical Planning. IJCAI 2019: 5554-5561 - [i1]Florian Pommerening, Malte Helmert, Blai Bonet:
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. CoRR abs/1909.12142 (2019) - 2017
- [c16]Florian Pommerening, Malte Helmert, Blai Bonet:
Higher-Dimensional Potential Heuristics for Optimal Classical Planning. AAAI 2017: 3636-3643 - [c15]Florian Pommerening, Malte Helmert, Blai Bonet:
Abstraction Heuristics, Cost Partitioning and Network Flows. ICAPS 2017: 228-232 - [p1]Florian Pommerening:
Neue Perspektiven auf die Kostenpartitionierung für optimale klassische Handlungsplanung. Ausgezeichnete Informatikdissertationen 2017: 211-220 - 2016
- [c14]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 - [c13]Jendrik Seipp, Florian Pommerening, Gabriele Röger, Malte Helmert:
Correlation Complexity of Classical Planning Domains. IJCAI 2016: 3242-3250 - 2015
- [c12]Florian Pommerening, Malte Helmert, Gabriele Röger, Jendrik Seipp:
From Non-Negative to General Operator Cost Partitioning. AAAI 2015: 3335-3341 - [c11]Florian Pommerening, Malte Helmert:
A Normal Form for Classical Planning Tasks. ICAPS 2015: 188-192 - [c10]Jendrik Seipp, Florian Pommerening, Malte Helmert:
New Optimization Functions for Potential Heuristics. ICAPS 2015: 193-201 - [c9]Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet:
Heuristics for Cost-Optimal Classical Planning Based on Linear Programming. IJCAI 2015: 4303-4309 - [c8]Sascha Scherrer, Florian Pommerening, Martin Wehrle:
Improved Pattern Selection for PDB Heuristics in Classical Planning (Extended Abstract). SOCS 2015: 216-217 - 2014
- [c7]Manuel Heusner, Martin Wehrle, Florian Pommerening, Malte Helmert:
Under-Approximation Refinement for Classical Planning. ICAPS 2014 - [c6]Florian Pommerening, Gabriele Röger, Malte Helmert, Blai Bonet:
LP-Based Heuristics for Cost-Optimal Planning. ICAPS 2014 - [c5]Gabriele Röger, Florian Pommerening, Malte Helmert:
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting. ECAI 2014: 765-770 - 2013
- [c4]Florian Pommerening, Malte Helmert:
Incremental LM-Cut. ICAPS 2013 - [c3]Florian Pommerening, Gabriele Röger, Malte Helmert:
Getting the Most Out of Pattern Databases for Classical Planning. IJCAI 2013: 2357-2364 - 2012
- [c2]Florian Pommerening, Malte Helmert:
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut. ICAPS 2012
2000 – 2009
- 2009
- [c1]Florian Pommerening, Stefan Wölfl, Matthias Westphal:
Right-of-Way Rules as Use Case for Integrating GOLOG and Qualitative Reasoning. KI 2009: 468-475
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:20 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:
