首页 | 本学科首页   官方微博 | 高级检索  
     


An explicit linear solution for the quadratic dynamic programming problem
Authors:W. R. S. Sutherland  H. Wolkowicz  V. Zeidan
Affiliation:(1) Department of Mathematics, Statistics and Computing Sciences, Dalhousie University, Halifax, Nova Scotia, Canada;(2) Department of Combinatorics and Optimization, University of Waterloo, Waterloo, Ontario, Canada;(3) Department of Applied Mathematics, University of Waterloo, Waterloo, Ontario, Canada
Abstract:For a given vectorx0, the sequence {xt} which optimizes the sum of discounted rewardsr(xt, xt+1), wherer is a quadratic function, is shown to be generated by a linear decision rulext+1=Sxt+R. Moreover, the coefficientsR,S are given by explicit formulas in terms of the coefficients of the reward functionr. A unique steady-state is shown to exist (except for a degenerate case), and its stability is discussed.
Keywords:Dynamic programming  discrete-time control theory  linear decision rules
本文献已被 SpringerLink 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号