2000 character limit reached
Value and Policy Iteration in Optimal Control and Adaptive Dynamic Programming
Published 3 Jul 2015 in cs.SY, cs.DS, math.NA, and math.OC | (1507.01026v2)
Abstract: In this paper, we consider discrete-time infinite horizon problems of optimal control to a terminal set of states. These are the problems that are often taken as the starting point for adaptive dynamic programming. Under very general assumptions, we establish the uniqueness of solution of Bellman's equation, and we provide convergence results for value and policy iteration.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.