MIT2_017JF09_p30

MIT2_017JF09_p30 - 30 DYNAMIC PROGRAMMING FOR PATH DESIGN...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
DYNAMIC PROGRAMMING FOR PATH DESIGN 109 30 Dynamic Programming for Path Design Given the transition costs in red, what are the maximum and minimum costs to get from node 1 to node 11? This situation is encountered when planning paths for autonomous agents moving through a complex environment, e.g., a wheeled robot in a building. 2 9 11 2 5 4 3 4 3 4 8 8 3 5 4 1 4 7 5 8 4 6 5 4 5 7 3 4 10 4 5 4 7 Solution: The minimum cost is 16 (path [1,6,9,11] or [1,2,8,9,11]) and the maximum value is 28 (path [1,4,5,6,7,9,11]!). The attached code uses value iteration to find these in two and five iterations, respectively. %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% % Value iteration solution of deterministic dynamic programming. % The program looks complicated only because I cover both % minimization and maximization in the same program! clear all; ch = input(’Find minimum (0) or maximum (1): ’); if ~ch, init = 1e6 ; % look for minimum; % big initial guesses for costs to go
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 11/29/2011 for the course CIVIL 1.00 taught by Professor Georgekocur during the Spring '05 term at MIT.

Page1 / 4

MIT2_017JF09_p30 - 30 DYNAMIC PROGRAMMING FOR PATH DESIGN...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online