Florian Pommerening

Orcid: 0000-0003-1311-283X

According to our database1, Florian Pommerening authored at least 35 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
The 2023 International Planning Competition.
AI Mag., 2024

Transition Landmarks from Abstraction Cuts.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

Versatile Cost Partitioning with Exact Sensitivity Analysis.
Proceedings of the Thirty-Fourth International Conference on Automated Planning and Scheduling, 2024

2023
PARIS: Planning Algorithms for Reconfiguring Independent Sets.
Proceedings of the ECAI 2023 - 26th European Conference on Artificial Intelligence, September 30 - October 4, 2023, Kraków, Poland, 2023

Grounding Planning Tasks Using Tree Decompositions and Iterated Solving.
Proceedings of the Thirty-Third International Conference on Automated Planning and Scheduling, 2023

2022
Cost Partitioning Heuristics for Stochastic Shortest Path Problems.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

Detecting Unsolvability Based on Separating Functions.
Proceedings of the Thirty-Second International Conference on Automated Planning and Scheduling, 2022

The FF Heuristic for Lifted Classical Planning.
Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021
Dantzig-Wolfe Decomposition for Cost Partitioning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

Delete-Relaxation Heuristics for Lifted Classical Planning.
Proceedings of the Thirty-First International Conference on Automated Planning and Scheduling, 2021

2020
Cost-Partitioned Merge-and-Shrink Heuristics for Optimal Classical Planning.
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Lagrangian Decomposition for Classical Planning (Extended Abstract).
Proceedings of the Twenty-Ninth International Joint Conference on Artificial Intelligence, 2020

Lifted Successor Generation Using Query Optimization Techniques.
Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Planen.
Proceedings of the Handbuch der Künstlichen Intelligenz, 6. Auflage, 2020

2019
Generalized Potential Heuristics for Classical Planning.
Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence, 2019

Lagrangian Decomposition for Optimal Cost Partitioning.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

An Empirical Study of Perfect Potential Heuristics.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

Oversubscription Planning as Classical Planning with Multiple Cost Functions.
Proceedings of the Twenty-Ninth International Conference on Automated Planning and Scheduling, 2019

2017
Neue Perspektiven auf die Kostenpartitionierung für optimale klassische Handlungsplanung.
Proceedings of the Ausgezeichnete Informatikdissertationen 2017, 2017

Abstraction Heuristics, Cost Partitioning and Network Flows.
Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

Higher-Dimensional Potential Heuristics for Optimal Classical Planning.
Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, 2017

2016
Correlation Complexity of Classical Planning Domains.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

State-Dependent Cost Partitionings for Cartesian Abstractions in Classical Planning.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016

2015
Improved Pattern Selection for PDB Heuristics in Classical Planning (Extended Abstract).
Proceedings of the Eighth Annual Symposium on Combinatorial Search, 2015

Heuristics for Cost-Optimal Classical Planning Based on Linear Programming.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

New Optimization Functions for Potential Heuristics.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

A Normal Form for Classical Planning Tasks.
Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015

From Non-Negative to General Operator Cost Partitioning.
Proceedings of the Twenty-Ninth AAAI Conference on Artificial Intelligence, 2015

2014
Optimal Planning in the Presence of Conditional Effects: Extending LM-Cut with Context Splitting.
Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

LP-Based Heuristics for Cost-Optimal Planning.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

Under-Approximation Refinement for Classical Planning.
Proceedings of the Twenty-Fourth International Conference on Automated Planning and Scheduling, 2014

2013
Getting the Most Out of Pattern Databases for Classical Planning.
Proceedings of the IJCAI 2013, 2013

Incremental LM-Cut.
Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, 2013

2012
Optimal Planning for Delete-Free Tasks with Incremental LM-Cut.
Proceedings of the Twenty-Second International Conference on Automated Planning and Scheduling, 2012

2009
Right-of-Way Rules as Use Case for Integrating GOLOG and Qualitative Reasoning.
Proceedings of the KI 2009: Advances in Artificial Intelligence, 2009


  Loading...