登入選單

返回Google圖書搜尋

Feasible Control Computations Using Dynamic Programming

Stephen J. Kahne

出版	Air Force Cambridge Research Laboratories, Office of Aerospace Research, United States Air Force, 1965
URL	http://books.google.com.hk/books?id=kvLatyaqxaMC&hl=&source=gbs_api
EBook	FULL_PUBLIC_DOMAIN

註釋

The application of Bellman's dynamic programming technique to realistic control problems has generally been precluded by excessive storage requirements inherent in the method. In this paper, the notion of state mobility is described and shown to be valuable in reducing certain classes of dynamic programming calculations to manageable size. The scheme requires one simple calculation at each stage of the process. IN many cases even this calculation may be omitted. It results in the reduction of the range of allowable state variables to be scanned. The amount of reduction varies from problem to problem. A simple example exhibits a fifty percent reduction. This corresponds to a fifty percent reduction in storage requirements for the problem. Reductions of one or two orders of magnitude appear possible for certain classes of problems.