Bottom-up Greedy Distance computation
Each condition (state-variable & value combo) has a distance
- Initialized to 0 for all conditions in the initial state
- + ? for everything else
Repeat until reaching fix-point (no distances change)
- Select an action A to be applied. Let P1 …Pm be its preconditions and A1 ……An be the conditions it adds.
- Reset the distance values of Ai as follows