Eliminating Cost of Finding Transition Paths: Generating Concurrent Policies
NextAction is O(e*m) where
- e is the number of transitions for a single variable y.
- m is the maximum depth in the causal graph.
Compute a feasible policy ?y (ei,ef) for variable y, where
- ei is a current assignment
- ef is a goal assignment
- ?y (ei,ef) returns the sorted conditions of the first transition along a path from ei to ef.