Maximilian Fickert

Publication Activity (10 Years)

Years Active: 2015-2022
Publications (10 Years): 16

Top Topics

Steepest Ascent

State Space Search

Heuristic Search

Top Venues

J. Artif. Intell. Res.

Publications

Maximilian Fickert, Tianyi Gu, Wheeler Ruml
New Results in Bounded-Suboptimal Search. AAAI (2022)
Maximilian Fickert, Jörg Hoffmann
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning. J. Artif. Intell. Res. 73 (2022)
Maximilian Fickert, Tianyi Gu, Wheeler Ruml
Bounded-cost Search Using Estimates of Uncertainty. IJCAI (2021)
Maximilian Fickert, Ivan Gavran, Ivan Fedotov, Jörg Hoffmann, Rupak Majumdar, Wheeler Ruml
Choosing the Initial State for Online Replanning. AAAI (2021)
Maximilian Fickert
A Novel Lookahead Strategy for Delete Relaxation Heuristics in Greedy Best-First Search. ICAPS (2020)
Maximilian Fickert, Tianyi Gu, Leonhard Staut, Wheeler Ruml, Jörg Hoffmann, Marek Petrik
Beliefs We Can Believe in: Replacing Assumptions with Data in Real-Time Search. AAAI (2020)
Joschka Gross, Álvaro Torralba, Maximilian Fickert
Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning. AAAI (2020)
Rebecca Eifler, Maximilian Fickert, Jörg Hoffmann, Wheeler Ruml
Refining Abstraction Heuristics during Real-Time Planning. AAAI (2019)
Rebecca Eifler, Maximilian Fickert
Online Refinement of Cartesian Abstraction Heuristics. SOCS (2018)
Maximilian Fickert
Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning. SOCS (2018)
Maximilian Fickert, Daniel Gnad, Jörg Hoffmann
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search. IJCAI (2018)
Maximilian Fickert, Jörg Hoffmann
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning. SOCS (2017)
Maximilian Fickert, Jörg Hoffmann
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement. ICAPS (2017)
Maximilian Fickert, Jörg Hoffmann, Marcel Steinmetz
Combining the Delete Relaxation with Critical-Path Heuristics: A Direct Characterization. J. Artif. Intell. Res. 56 (2016)
Ruben Becker, Maximilian Fickert, Andreas Karrenbauer
A Novel Dual Ascent Algorithm for Solving the Min-Cost Flow Problem. ALENEX (2016)
Jörg Hoffmann, Maximilian Fickert
) in Polynomial Time. ICAPS (2015)