Admissible heuristics for optimal planning PHH Geffner, P Haslum Proceedings of the 5th Internat. Conf. of AI Planning Systems (AIPS 2000 …, 2000 | 540 | 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 | 440 | 2009 |
Flexible Abstraction Heuristics for Optimal Sequential Planning. M Helmert, P Haslum, J Hoffmann ICAPS, 176-183, 2007 | 352 | 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 | 303 | 2007 |
An introduction to the planning domain definition language P Haslum, N Lipovetzky, D Magazzeni, C Muise, R Brachman, F Rossi, ... Morgan & Claypool, 2019 | 256 | 2019 |
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 | 234 | 2014 |
Heuristic planning with time and resources P Haslum, H Geffner Sixth European Conference on Planning, 2014 | 233 | 2014 |
New admissible heuristics for domain-independent planning P Haslum, B Bonet, H Geffner AAAI 5, 9-13, 2005 | 199 | 2005 |
Interval-based relaxation for general numeric planning E Scala, P Haslum, S Thiébaux, M Ramirez ECAI 2016, 655-663, 2016 | 153 | 2016 |
A distributed architecture for autonomous unmanned aerial vehicle experimentation P Doherty, P Haslum, F Heintz, T Merz, P Nyblom, T Persson, B Wingman Distributed Autonomous Robotic Systems 6, 233-242, 2007 | 127 | 2007 |
Some results on the complexity of planning with incomplete information P Haslum, P Jonsson Recent Advances in AI Planning: 5th European Conference on Planning, ECP’99 …, 2000 | 103 | 2000 |
Semi-relaxed plan heuristics E Keyder, J Hoffmann, P Haslum Proceedings of the International Conference on Automated Planning and …, 2012 | 69 | 2012 |
Incremental lower bounds for additive cost planning problems P Haslum Proceedings of the International Conference on Automated Planning and …, 2012 | 66 | 2012 |
Reducing Accidental Complexity in Planning Problems. P Haslum IJCAI, 1898-1903, 2007 | 65 | 2007 |
Cost-optimal factored planning: Promises and pitfalls E Fabre, L Jezequel, P Haslum, S Thiébaux Proceedings of the International Conference on Automated Planning and …, 2010 | 61 | 2010 |
hm (P)= h1 (Pm): Alternative characterisations of the generalisation from hmax to hm P Haslum Proceedings of the International Conference on Automated Planning and …, 2009 | 61 | 2009 |
Planning with Reduced Operator Sets. P Haslum, P Jonsson AIPS, 150-158, 2000 | 60 | 2000 |
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 | 59 | 2008 |
Extending TALplanner with concurrency and resources J Kvarnström, P Doherty, P Haslum ECAI, 501-505, 2000 | 56 | 2000 |
Improving delete relaxation heuristics through explicitly represented conjunctions E Keyder, J Hoffmann, P Haslum Journal of Artificial Intelligence Research 50, 487-533, 2014 | 54 | 2014 |