Partial Delete Relaxation, Unchained: On Intractable Red-Black Planning and Its Applications


Partial delete relaxation methods, like red-black planning, are extremely powerful, allowing in principle to force relaxed plans to behave like real plans in the limit. Alas, that power has so far been chained down by the computational overhead of the use as heuristic functions, necessitating to compute a relaxed plan on every search state. For red-black… (More)


9 Figures and Tables