• Publications
  • Influence
Constrained Symbolic Search: On Mutexes, BDD Minimization and More
tl;dr
Symbolic search allows saving large amounts of memory compared to regular explicit-state search algorithms. Expand
  • 21
  • 2
Abstraction Heuristics for Symbolic Bidirectional Search
tl;dr
We present a new planner, SymBA∗, that combines symbolic bidirectional search with perimeter abstraction heuristics, exploiting their synergy to benefit from the advantages of BHS. Expand
  • 25
  • 2
  • Open Access
Symbolic Merge-and-Shrink for Cost-Optimal Planning
tl;dr
We present a combination of these techniques, Symbolic Merge-and-Shrink (SM&S), which uses M&S abstractions as a relaxation criterion for a symbolic backward search. Expand
  • 14
  • 2
  • Open Access
SymPA : Symbolic Perimeter Abstractions for Proving Unsolvability
This paper describes the SymPA planner that participated in the 2016 unsolvability International Planning Competition (IPC). SymPA is built on top of SymBA∗, the winner of the optimal-track of theExpand
  • 11
  • 2
  • Open Access
TIMIPLAN : An Application to Solve Multimodal Transportation Problems
Intermodal transportation is a very challenging task for AI planning. It is a logistics problem in which a set of goods have to be transported to different places, with the combination of at leastExpand
  • 8
  • 2
  • Open Access
"Distance"? Who Cares? Tailoring Merge-and-Shrink Heuristics to Detect Unsolvability
Research on heuristic functions is all about estimating the length (or cost) of solution paths. But what if there is no such path? Many known heuristics have the ability to detect (some) unsolvableExpand
  • 51
  • 1
  • Open Access
A Reminder about the Importance of Computing and Exploiting Invariants in Planning
tl;dr
In this work we focus on the ability of invariants to simplify the planning task in a preprocessing step. Expand
  • 53
  • 1
  • Open Access
Combining linear programming and automated planning to solve intermodal transportation problems
tl;dr
In this paper, a new hybrid approach is described which addresses complex intermodal transport problems. Expand
  • 41
  • 1
  • Open Access
On Creating Complementary Pattern Databases
tl;dr
A pattern database (PDB) for a planning task is a heuristic function in the form of a lookup table that contains optimal solution costs of a simplified version of the task. Expand
  • 15
  • 1
  • Open Access
Transition Trees for Cost-Optimal Symbolic Planning
tl;dr
We propose two general techniques based on transition relation trees to advance BDD search by refining the image operator to compute the set of successors. Expand
  • 13
  • 1