Dynamic ProgrammingManhattan Tourist ProblemLecture 17.ppt

Dynamic Programming:Manhattan Tourist ProblemLecture 17 ManhattanTouristProblem(MTP) Manhattan Tourist Problem (MTP) Manhattan Tourist Problem (MTP) Manhattan Tourist Problem: Formulation MTP: An Example MTP: Greedy Algorithm Is Not Optimal MTP: Simple Recursive Program MTP: Simple Recursive Program MTP: Recurrence Manhattan Is Not A Perfect Grid Manhattan Is Not A Perfect Grid (cont’d) Traveling in the Grid DAG: Directed Acyclic Graph Topological Ordering Topological ordering Longest Path in DAG Problem Longest Path in DAG: Dynamic Programming Traversing the Manhattan Grid * Imagine seeking a path (from source to sink) to travel (only eastward and southward) with the most number of attractions (*) in the Manhattan grid Sink * * * * * * * * * * * Source * Imagine seeking a path (from source to sink) to travel (only eastward and southward) with the most number of attractions (*) in the Manhattan grid Sink * * * * * * * * * * * Source * Goal: Find the longest path in a weighted grid. Input: A weighted grid G with two distinct vertices, one labeled “source” and the other labeled “sink” Output: A longest path in G from “source” to “sink” 3 2 4 0 7 3 3 3 0 1 3 2 4 4 5 6 4 6 5 5 8 2 2 5 0 1 2 3 0 1 2 3 j coordinate i coordinate 13 source sink 4 3 2 4 0 1 0 2 4 3 3 1 1 2 2 2 4 19 9 5 15 23 0 20 3 4 1 2 5 2 1 5 2 3 4 0 0 0 5 3 0 3 5 0 10 3 5 5 1 2 promising start, but leads to bad choices! source sink 18 22 MT(n,m) if n=0 or m=0 return MT(n,m) x ? MT(n-1,m)+ length of the edge from (n- 1,m) to (n,m) y ? MT(n,m-1)+ length of the edge from (n,m-1) to (n,m) return max{x,y} MT(n,m) x ? MT(n-1,m)+ length of the edge from (n- 1,m) to (n,m) y ? MT(n,m-1)+ length of the edge from (n,m-1) to (n,m) return min{x,y} What’s wrong with this approach? 1 5 0 1 0 1 i source 1 5 S1,0 = 5 S0,1 = 1 Calculate optimal path score for each vertex in the graph Each vertex’s score i