Maximilian Fickert
Maximilian Fickert
Saarland University, Saarland Informatics Campus
Verified email at cs.uni-saarland.de - Homepage
Title
Cited by
Cited by
Year
Complete Local Search: Boosting Hill-Climbing through Online Relaxation Refinement.
M Fickert, J Hoffmann
ICAPS, 107-115, 2017
122017
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
112016
Explicit conjunctions w/o compilation: Computing hFF (ΠC) in polynomial time
J Hoffmann, M Fickert
Proc. ICAPS 15, 253-302, 2015
102015
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
72016
Saarplan: Combining saarland’s greatest planning techniques
M Fickert, D Gnad, P Speicher, J Hoffmann
IPC2018–Classical Tracks, 10-15, 2018
62018
Online Refinement of Cartesian Abstraction Heuristics.
R Eifler, M Fickert
SOCS, 46-54, 2018
52018
Ranking Conjunctions for Partial Delete Relaxation Heuristics in Planning.
M Fickert, J Hoffmann
SOCS, 38-46, 2017
42017
Making Hill-Climbing Great Again through Online Relaxation Refinement and Novelty Pruning.
M Fickert
SOCS, 158-162, 2018
32018
Olcff: Onlinelearning hcff
M Fickert, J Hoffmann
IPC 2018 planner abstracts, 2018
32018
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
22020
Refining Abstraction Heuristics during Real-Time Planning
R Eifler, M Fickert, J Hoffmann, W Ruml
Proceedings of the AAAI Conference on Artificial Intelligence 33, 7578-7585, 2019
12019
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
12018
Explicit conjunctions w/o compilation: Computing hFF (πc) in polynomial time (technical report)
J Hoffmann, M Fickert
Technical report, Saarland University. Available at http://fai. cs. uni …, 2015
12015
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
2020
Novel Is Not Always Better: On the Relation between Novelty and Dominance Pruning.
J Groß, A Torralba, M Fickert
AAAI, 9875-9882, 2020
2020
Simultaneous Re-Planning and Plan Execution for Online Job Arrival
I Gavran, M Fickert, I Fedotov, J Hoffmann, R Majumdar
HSDIP 2019, 55, 2019
2019
Real-time Planning as Data-driven Decision-making
M Fickert, T Gu, L Staut, S Lekyang, W Ruml, J Hoffmann, M Petrik
Beating LM-cut with LM-cut: Quick Cutting and Practical Tie Breaking for the Precondition Choice Function
P Lauer, M Fickert
HSDIP 2020, 9, 0
Unchaining the Power of Partial Delete Relaxation, Part II: Finding Plans with Red-Black State Space Search (Technical Report)
M Fickert, D Gnad, J Hoffmann
The system can't perform the operation now. Try again later.
Articles 1–19