Partial Expansion

• Grow the graph to level k (k < level-off level)
  • Level(S) if k+1 instead of ¥, if S is not present in the graph without mutex

• Can limit the space and time resources expended on computing the planning graph by trading heuristic quality

Previous slide

Next slide

Back to first slide

View graphic version