Approximation Algorithm for finding UIO Sequences (cont.)
0/1 1/0
1/0
0/1
1/0 0/0
Step 1. Set length to 1 and find UIO :
State 1:
State 2:
State 3: 0/0
Step 2. Remove convergent edges and Find Shortest
Paths
1/0 1/0
0/1 1/0
1/0 0/0
Shortest path for state 1 to 3 is [0/1 0/1],
and for state 2 to 3 is [0/1].
Finally, UIO is
State 1: 0/1 0/1 0/0
State 2: 0/1 0/0
State 3: 0/0
前一張投影片
下一張投影片
回到第一張投影片
檢視圖形版本