Mathäus Jany

We don’t have enough information about this author to calculate their statistics. If you think this is an error let us know.
Learn More
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)
  • 1