Patrik Haslum

Now a researcher in the Computer Science Lab at the Australian National University, Canberra.

Previously with NICTA, also in Canberra.

And before that a PhD student at Linköpings Universitet.

...and still working on planning.

Publications

  • Patrik Haslum, "hm(P) = h1(Pm): Alternative Characterisations of the Generalisation From hmax To hm". In Proc. 19th International Conference on Automated Planning and Scheduling, 2009 (PDF).
  • Alfonso Gerevini, Patrik Haslum, Derek Long, Alessandro Saetti, and Yannis Dimopoulos, "Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners". In Artificial Intelligence, vol. 173 (5-6), pp. 619-668, 2008. DOI: 10.1016/j.artint.2008.10.012 (PDF).
  • Blai Bonet, Patrik Haslum, Sarah Hickmott, and Sylvie Thiébaux, "Directed Unfolding of Petri Nets". In Transactions on Petri Nets and Other Models of Concurrency I, LNCS vol. 5100, 2008. DOI: 10.1007/978-3-540-89287-8_11 (PDF).
  • Patrik Haslum, "A New Approach To Tractable Planning". In Proc. 18th International Conference on Automated Planning and Scheduling, 2008 (PDF).
    Note: There's an error in the paper. The first two cases for sequence rules in Table 1 should have N.max = min(N1.max, N2.max - N1.out, N3.max - (N1.out + N2.out)) (or at least something similar; the issue is that if N.out = 1, one of the N2.max and N3.max moves may already have been "consumed" (depending on where the move out originated) and N.max needs be adjusted accordingly).
  • Patrik Haslum, "Quality of Solutions to IPC5 Benchmark Problems: Preliminary Results". In ICAPS'07 workshop on the International Planning Competition: Past, Present and Future, 2007. Available from the workshop page (slides). See also the IPC5 (deterministic track) website and my additional IPC5 resources page.
  • Malte Helmert, Patrik Haslum and Joerg Hoffmann, "Flexible Abstraction Heuristics for Optimal Sequential Planning". In Proc. 17th International Conference on Automated Planning and Scheduling, 2007. Available from Malte's publications page.
  • Patrik Haslum, Malte Helmert, Blai Bonet, Adi Botea and Sven Koenig, "Domain-Independent Construction of Pattern Database Heuristics for Cost-Optimal Planning". In Proc. AAAI'07 (PDF).
  • Blai Bonet, Patrik Haslum, Sarah Hickmott, and Sylvie Thiebaux, "Directed Unfolding of Petri Nets". In Proc. of the Workshop on Unfolding and partial order techniques (UFO'07), 2007. A revised version of this paper now appears in the LNCS Transactions on Petri Nets and Other Models of Concurrency (see above).
  • Patrik Haslum, "Reducing Accidental Complexity in Planning Problems". In Proc. 20th International Joint Conference on Artificial Intelligence, 2007 (PDF, slides).

For earlier publications, please refer to http://www.ida.liu.se/~pahas/.

Not Quite Publications, but Publication-Like Stuff

  • Tutorial on "Abstraction Heuristics in Planning: PDBs and Beyond", by me and Malte Helmert. Presented at ICAPS 2008. (slides in 4-on-1 format, PDF)

Teaching

A quote for the day...

/P@trik Haslum, December 2006