Maximilian Fickert

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