Maximilian Fickert

According to our database, Maximilian Fickert authored at least 17 papers between 2015 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Adaptive search techniques in AI planning and heuristic search.

Maximilian Fickert

PhD thesis, 2022

Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning.

Maximilian Fickert, Jörg Hoffmann

J. Artif. Intell. Res., 2022

New Results in Bounded-Suboptimal Search.

Maximilian Fickert, Tianyi Gu, Wheeler Ruml

Proceedings of the Thirty-Sixth AAAI Conference on Artificial Intelligence, 2022

2021

Bounded-cost Search Using Estimates of Uncertainty.

Maximilian Fickert, Tianyi Gu, Wheeler Ruml

Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021

Choosing the Initial State for Online Replanning.

Maximilian Fickert, Ivan Gavran, Ivan Fedotov, Jörg Hoffmann, Rupak Majumdar, Wheeler Ruml

Proceedings of the Thirty-Fifth AAAI Conference on Artificial Intelligence, 2021

2020

A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search.

Maximilian Fickert

Proceedings of the Thirtieth International Conference on Automated Planning and Scheduling, 2020

Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning.

Joschka Gross, Álvaro Torralba, Maximilian Fickert

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search.

Maximilian Fickert, Tianyi Gu, Leonhard Staut, Wheeler Ruml, Jörg Hoffmann, Marek Petrik

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Refining Abstraction Heuristics during Real-Time Planning.

Rebecca Eifler, Maximilian Fickert, Jörg Hoffmann, Wheeler Ruml

Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018

Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning.

Maximilian Fickert

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Online Refinement of Cartesian Abstraction Heuristics.

Rebecca Eifler, Maximilian Fickert

Proceedings of the Eleventh International Symposium on Combinatorial Search, 2018

Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search.

Maximilian Fickert, Daniel Gnad, Jörg Hoffmann

Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence, 2018

2017

Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.

Maximilian Fickert, Jörg Hoffmann

Proceedings of the Tenth International Symposium on Combinatorial Search, 2017

Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement.

Maximilian Fickert, Jörg Hoffmann

Proceedings of the Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017

2016

Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization.

Maximilian Fickert, Jörg Hoffmann, Marcel Steinmetz

J. Artif. Intell. Res., 2016

A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem.

Ruben Becker, Maximilian Fickert, Andreas Karrenbauer

Proceedings of the Eighteenth Workshop on Algorithm Engineering and Experiments, 2016

2015

Explicit Conjunctions without Compilation: Computing h^FF(Pi^C) in Polynomial Time.

Jörg Hoffmann, Maximilian Fickert

Proceedings of the Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015