Follow
Maximilian Fickert
Maximilian Fickert
Saarland University, Saarland Informatics Campus
Verified email at cs.uni-saarland.de - Homepage
Title
Cited by
Cited by
Year
Saarplan: Combining saarland’s greatest planning techniques
M Fickert, D Gnad, P Speicher, J Hoffmann
IPC2018–Classical Tracks, 10-15, 2018
192018
Combining the delete relaxation with critical-path heuristics: A direct characterization
M Fickert, J Hoffmann, M Steinmetz
Journal of Artificial Intelligence Research 56, 269-327, 2016
162016
Complete local search: Boosting hill-climbing through online relaxation refinement
M Fickert, J Hoffmann
Proceedings of the International Conference on Automated Planning andá…, 2017
152017
Explicit Conjunctions without Compilation: Computing hFF (PiC) in Polynomial Time
J Hoffmann, M Fickert
Proceedings of the International Conference on Automated Planning andá…, 2015
132015
A novel dual ascent algorithm for solving the min-cost flow problem
R Becker, M Fickert, A Karrenbauer
2016 Proceedings of the Eighteenth Workshop on Algorithm Engineering andá…, 2016
112016
OLCFF: Online-learning hCFF
M Fickert, J Hoffmann
Ninth International Planning Competition (IPC-9): planner abstracts, 17-19, 2018
102018
Making hill-climbing great again through online relaxation refinement and novelty pruning
M Fickert
Proceedings of the International Symposium on Combinatorial Search 9 (1á…, 2018
92018
A novel lookahead strategy for delete relaxation heuristics in greedy best-first search
M Fickert
Proceedings of the International Conference on Automated Planning andá…, 2020
82020
Beliefs we can believe in: Replacing assumptions with data in real-time search
M Fickert, T Gu, L Staut, W Ruml, J Hoffmann, M Petrik
Proceedings of the AAAI Conference on Artificial Intelligence 34 (06), 9827-9834, 2020
72020
Online refinement of Cartesian abstraction heuristics
R Eifler, M Fickert
Proceedings of the International Symposium on Combinatorial Search 9 (1), 46-54, 2018
62018
Ranking conjunctions for partial delete relaxation heuristics in planning
M Fickert, J Hoffmann
Proceedings of the International Symposium on Combinatorial Search 8 (1), 38-46, 2017
62017
New Results in Bounded-Suboptimal Search
M Fickert, T Gu, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 36 (9), 10166á…, 2022
42022
Choosing the Initial State for Online Replanning
M Fickert, I Gavran, I Fedotov, J Hoffmann, R Majumdar, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 35 (14), 12311á…, 2021
32021
Bounded-cost search using estimates of uncertainty
M Fickert, T Gu, W Ruml
Proceedings of IJCAI-21, 2021
32021
Refining abstraction heuristics during real-time planning
R Eifler, M Fickert, J Hoffmann, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 33 (01), 7578-7585, 2019
32019
Online Relaxation Refinement for Satisficing Planning: On Partial Delete Relaxation, Complete Hill-Climbing, and Novelty Pruning
M Fickert, J Hoffmann
Journal of Artificial Intelligence Research 73, 67–115, 2022
22022
Novel is not always better: On the relation between novelty and dominance pruning
J Gro▀, A Torralba, M Fickert
Proceedings of the AAAI Conference on Artificial Intelligence 34 (06), 9875-9882, 2020
22020
Real-time Planning as Data-driven Decision-making
M Fickert, T Gu, L Staut, S Lekyang, W Ruml, J Hoffmann, M Petrik
the ICAPS-20 Workshop on Bridging the Gap Between AI Planning andá…, 2020
22020
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search.
M Fickert, D Gnad, J Hoffmann
IJCAI, 4750-4756, 2018
22018
Simultaneous Re-Planning and Plan Execution for Online Job Arrival
I Gavran, M Fickert, I Fedotov, J Hoffmann, R Majumdar
HSDIP 2019, 55, 2019
12019
The system can't perform the operation now. Try again later.
Articles 1–20