Malte Helmert
Malte Helmert
Professor of Computer Science, University of Basel
Bestätigte E-Mail-Adresse bei
TitelZitiert vonJahr
The Fast Downward planning system
M Helmert
Journal of Artificial Intelligence Research 26, 191-246, 2006
Landmarks, critical paths and abstractions: what's the difference anyway?
M Helmert, C Domshlak
Nineteenth International Conference on Automated Planning and Scheduling, 2009
Flexible Abstraction Heuristics for Optimal Sequential Planning.
M Helmert, P Haslum, J Hoffmann
ICAPS, 176-183, 2007
A Planning Heuristic Based on Causal Graph Analysis
M Helmert
ICAPS 4, 161-170, 2004
Landmarks Revisited
S Richter, M Helmert, M Westphal
AAAI 8, 975-982, 2008
Concise finite-domain representations for PDDL planning tasks
M Helmert
Artificial Intelligence 173 (5-6), 503-535, 2009
Domain-independent construction of pattern database heuristics for cost-optimal planning
P Haslum, A Botea, M Helmert, B Bonet, S Koenig
AAAI 7, 1007-1012, 2007
Complexity results for standard benchmark domains in planning
M Helmert
Artificial Intelligence 143 (2), 219-262, 2003
MIPS: The model-checking integrated planning system
S Edelkamp, M Helmert
AI magazine 22 (3), 67-67, 2001
Unifying the Causal Graph and Additive Heuristics.
M Helmert, H Geffner
ICAPS, 140-147, 2008
How Good is Almost Perfect?.
M Helmert, G Röger
AAAI 8, 944-949, 2008
Merge-and-shrink abstraction: A method for generating lower bounds in factored state spaces
M Helmert, P Haslum, J Hoffmann, R Nissim
Journal of the ACM (JACM) 61 (3), 1-63, 2014
Exhibiting knowledge in planning problems to minimize state encoding length
S Edelkamp, M Helmert
European Conference on Planning, 135-147, 1999
Preferred operators and deferred evaluation in satisficing planning
S Richter, M Helmert
Nineteenth International Conference on Automated Planning and Scheduling, 2009
KI 2016: Advances in Artificial Intelligence: 39th Annual German Conference on AI, Klagenfurt, Austria, September 26-30, 2016, Proceedings
G Friedrich, M Helmert, F Wotawa
Springer, 2016
Decidability and Undecidability Results for Planning with Numerical State Variables.
M Helmert
AIPS, 44-53, 2002
LAMA 2008 and 2011
S Richter, M Westphal, M Helmert
International Planning Competition, 117-124, 2011
Trial-based heuristic tree search for finite horizon MDPs
T Keller, M Helmert
Twenty-Third International Conference on Automated Planning and Scheduling, 2013
Sound and Complete Landmarks for And/Or Graphs.
E Keyder, S Richter, M Helmert
ECAI 215, 335-340, 2010
Strengthening Landmark Heuristics via Hitting Sets.
B Bonet, M Helmert
ECAI 215, 329-334, 2010
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20