Patrik Haslum
Patrik Haslum
Unknown affiliation
Verified email at
Cited by
Cited by
Admissible heuristics for optimal planning
PHH Geffner, P Haslum
Proceedings of the 5th Internat. Conf. of AI Planning Systems (AIPS 2000 …, 2000
Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners
AE Gerevini, P Haslum, D Long, A Saetti, Y Dimopoulos
Artificial Intelligence 173 (5-6), 619-668, 2009
Flexible Abstraction Heuristics for Optimal Sequential Planning.
M Helmert, P Haslum, J Hoffmann
ICAPS, 176-183, 2007
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
Heuristic planning with time and resources
P Haslum, H Geffner
Sixth European Conference on Planning, 2014
New admissible heuristics for domain-independent planning
P Haslum, B Bonet, H Geffner
AAAI 5, 9-13, 2005
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
A distributed architecture for autonomous unmanned aerial vehicle experimentation
P Doherty, P Haslum, F Heintz, T Merz, P Nyblom, T Persson, B Wingman
In Proceedings of the 7th International Symposium on Distributed Autonomous …, 2004
Some results on the complexity of planning with incomplete information
P Haslum, P Jonsson
European Conference on Planning, 308-318, 1999
An introduction to the planning domain definition language
P Haslum, N Lipovetzky, D Magazzeni, C Muise
Synthesis Lectures on Artificial Intelligence and Machine Learning 13 (2), 1-187, 2019
Interval-based relaxation for general numeric planning
E Scala, P Haslum, S Thiébaux, M Ramirez
ECAI 2016, 655-663, 2016
Semi-relaxed plan heuristics
ER Keyder, J Hoffmann, P Haslum
Twenty-Second International Conference on Automated Planning and Scheduling, 2012
Incremental lower bounds for additive cost planning problems
P Haslum
Twenty-Second International Conference on Automated Planning and Scheduling, 2012
Planning with Reduced Operator Sets.
P Haslum, P Jonsson
AIPS, 150-158, 2000
Cost-optimal factored planning: Promises and pitfalls
E Fabre, L Jezequel, P Haslum, S Thiébaux
Twentieth International Conference on Automated Planning and Scheduling, 2010
hm (P)= h 1 (P m): Alternative Characterisations of the Generalisation From h max To hm
P Haslum
Nineteenth International Conference on Automated Planning and Scheduling, 2009
Extending TALplanner with concurrency and resources
J Kvarnström, P Doherty, P Haslum
ECAI, 501-505, 2000
Reducing Accidental Complexity in Planning Problems.
P Haslum
IJCAI, 1898-1903, 2007
Improving delete relaxation heuristics through explicitly represented conjunctions
E Keyder, J Hoffmann, P Haslum
Journal of Artificial Intelligence Research 50, 487-533, 2014
Directed unfolding of petri nets
B Bonet, P Haslum, S Hickmott, S Thiébaux
Transactions on Petri Nets and Other Models of Concurrency I, 172-198, 2008
The system can't perform the operation now. Try again later.
Articles 1–20