[David Silver] 3. Planning by Dynamic Programming

이 글은 필자가 David Silver의 Reinforcement Learning 강좌를 듣고 정리한 글입니다. (2023.09.12) 추가적으로 필자가 임재환 교수님의 AI611 대학원 수업을 듣고 이해가 부족한 부분을 채웠습니다. -보라색 처리 This lecture is about a solution of known MDP which is Dynamic Programming. We will talk about what is dynamic programming, and prove MDP is solvable. 🥭 Dynamic Programming Dynamic programming is a method for solving complex problems. By breaking them down in..