Table of Contents
Dynamic Programming
Dynamic Programming
Dynamic Programming
Dynamic Programming
Theory
Bellman’s principle of optimality
Proof
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What's the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
Forward DP example: What’s the best path?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
What’s the Impact of Planning Horizon?
Forward DP example: What’s the best path?
Forward DP vs. Myopic
N-Best DP: What are the four best solutions?
PPT Slide
No! Recall from the forward DP example:
N-Best DP
No! The the myopic solution is 5th best
Computational Feasibility: The Curse of Dimensionality
Computational Feasibility: The Curse of Dimensionality
PPT Slide
Exercise
Exercise cont.
PPT Slide
We welcome your questions with Enthusiasm!
|