How does MR search efficiently over the set of feasible target states?
How do we enumerate the set of least cost states without generating all possible plans?
Can the reachable target states be efficiently enumerated by increasing cost?
Solution falls out of the development of the reactive planner