Skip navigation
Skip navigation
A change is coming. Click to see a sneak peek of the new Open Research Repository.

Browsing by Author Haslum, Patrik

0-9 A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
Or enter first few letters:  
Showing results 7 to 26 of 43

Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners

Author(s)Gerevini, Alfonso; Haslum, Patrik; Long, Derek, et al
TypeJournal article
Date Published2009
Date Created-

Directed Unfolding of Petri Nets

Author(s)Bonet, Blai; Haslum, Patrik; Hickmott, Sarah, et al
TypeBook chapter
Date Published2008
Date Created-
05_Bonet_Directed_unfolding_of_petri_2007.pdf.jpg

Directed unfolding of petri nets

Author(s)Bonet, Blai; Haslum, Patrik; Hickmott, Sarah, et al
TypeConference paper
Date Published2007
Date CreatedJune 26 2007

Domain-independent construction of pattern database heuristics for cost-optimal planning

Author(s)Haslum, Patrik; Botea, Adi; Helmert, Malte, et al
TypeConference paper
Date Published2007
Date CreatedJuly 22-26 2007

Exhaustive Diagnosis of Discrete Event Systems through Exploration of the Hypothesis Space

Author(s)Grastien, Alban; Haslum, Patrik; Thiebaux, Sylvie
TypeConference paper
Date Published2011
Date CreatedOctober 4-7 2011
01_Helmert_Flexible_abstraction_2007.pdf.jpg

Flexible abstraction heuristics for optimal sequential planning

Author(s)Helmert, Malte; Haslum, Patrik; Hoffmann, Joerg
TypeConference paper
Date Published2007
Date CreatedSeptember 22-26 2007

h^m(P)= h^1(P^m): Alternative characterisations of the generalisation from h^max to h^mn

Author(s)Haslum, Patrik
TypeConference paper
Date Published2009
Date CreatedSeptember 19-23 2009

Heuristic planning with time and resources

Author(s)Haslum, Patrik; Geffner, Hector
TypeConference paper
Date Published2014
Date Created15-18 September 2014

Heuristics for Bounded-Cost Search

Author(s)Haslum, Patrik
TypeConference paper
Date Published2013
Date CreatedJune 10-14 2013

Improving delete relaxation heuristics through explicitly represented conjunctions

Author(s)Keyder, Emil; Hoffmann, Jorg; Haslum, Patrik
TypeJournal article
Date Published2014
Date Created-

Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP in the 2004 Planning Competition

Author(s)Haslum, Patrik
TypeJournal article
Date Published2006
Date Created-

Improving Heuristics through Search

Author(s)Haslum, Patrik
TypeConference paper
Date Published2004
Date CreatedAugust 22-27 2004
01_Haslum_Incremental_Lower_Bounds_for_2012.pdf.jpg

Incremental Lower Bounds for Additive Cost Planning Problems

Author(s)Haslum, Patrik
TypeConference paper
Date Published2012
Date CreatedJune 25-29 2012
01_Haslum_Incremental_Lower_Bounds_for_2011.pdf.jpg

Incremental Lower Bounds for Additive Cost Planning Problems

Author(s)Haslum, Patrik; Slaney, John K; Thiebaux, Sylvie
TypeConference paper
Date Published2011
Date CreatedJune 11-16 2011
01_Bauer_LTL_Goal_Specifications_2010.pdf.jpg

LTL Goal Specifications Revisited

Author(s)Bauer, Andreas; Haslum, Patrik
TypeConference paper
Date Published2010
Date CreatedAugust 16-20 2010

Merge-and-Shrink Abstraction: A Method for Generating Lower Bounds in Factored State Spaces

Author(s)Helmert, Malte; Haslum, Patrik; Hoffmann, Jorg, et al
TypeJournal article
Date Published2014
Date Created-

Minimal Landmarks for Optimal Delete-Free Planning

Author(s)Haslum, Patrik; Slaney, John K; Thiebaux, Sylvie
TypeConference paper
Date Published2012
Date CreatedJune 25-29 2012

Narrative Planning: Compilations to Classical Planning

Author(s)Haslum, Patrik
TypeJournal article
Date Published2012
Date Created-

New Admissible Heuristics for Domain-Independent Planning

Author(s)Haslum, Patrik; Bonet, Blai; Geffner, Hector
TypeConference paper
Date Published2005
Date CreatedJuly 9-13 2005

Optimal Delete-Relaxed (and Semi-Relaxed) Planning with Conditional Effects

Author(s)Haslum, Patrik
TypeConference paper
Date Published2013
Date CreatedAugust 3-9 2013

Updated:  12 April 2016/ Responsible Officer:  University Librarian/ Page Contact:  Library Systems & Web Coordinator