30 citations · 41 across the 5 of their papers we have counts for
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2017★ 2 cited
Numerical Integration and Dynamic Discretization in Heuristic Search Planning over Hybrid Domains
Miquel Ramirez, Enrico Scala, Patrik Haslum +1
In this paper we look into the problem of planning over hybrid domains, where change can be both discrete and instantaneous, or continuous over time. In addition, it is required th…
cs.AI2014★ 30 cited
Narrative Planning: Compilations to Classical Planning
Patrik Haslum
A model of story generation recently proposed by Riedl and Young casts it as planning, with the additional condition that story characters behave intentionally. This means that cha…
cs.AI2011★ 9 cited
Improving Heuristics Through Relaxed Search - An Analysis of TP4 and HSP*a in the 2004 Planning Competition
P. Haslum
The hm admissible heuristics for (sequential and temporal) regression planning are defined by a parameterized relaxation of the optimal cost function in the regression search space…