Maximilian Fickert
Maximilian Fickert
Saarland University, Saarland Informatics Campus
Verified email at cs.uni-saarland.de - Homepage
Title
Cited by
Cited by
Year
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
132016
Complete local search: Boosting hill-climbing through online relaxation refinement
M Fickert, J Hoffmann
Twenty-Seventh International Conference on Automated Planning and Scheduling, 2017
122017
Explicit Conjunctions without Compilation: Computing h FF (Pi C) in Polynomial Time
J Hoffmann, M Fickert
Twenty-Fifth International Conference on Automated Planning and Scheduling, 2015
102015
Saarplan: Combining saarland’s greatest planning techniques
M Fickert, D Gnad, P Speicher, J Hoffmann
IPC2018–Classical Tracks, 10-15, 2018
92018
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
82016
Making hill-climbing great again through online relaxation refinement and novelty pruning
M Fickert
Eleventh Annual Symposium on Combinatorial Search, 2018
72018
Online refinement of Cartesian abstraction heuristics
R Eifler, M Fickert
Eleventh Annual Symposium on Combinatorial Search, 2018
52018
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
42020
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
42020
OLCFF: Online-Learning hCFF
M Fickert, J Hoffmann
Ninth International Planning Competition (IPC-9): planner abstracts, 17-19, 2018
42018
Ranking conjunctions for partial delete relaxation heuristics in planning
M Fickert, J Hoffmann
Tenth Annual Symposium on Combinatorial Search, 2017
42017
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
12020
Real-time Planning as Data-driven Decision-making
M Fickert, T Gu, L Staut, S Lekyang, W Ruml, J Hoffmann, M Petrik
12020
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
12019
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
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
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
2021
Bounded-Cost Search Using Estimates of Uncertainty
M Fickert, T Gu, W Ruml
Proceedings of IJCAI-21, 2021
2021
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
The system can't perform the operation now. Try again later.
Articles 1–20