Dynamic Programming and Optimal Trajectories for Quadratic Variational Processes.

Robert E. Kalaba

ResearchPublished 1968

Dynamic programming provides a standard tool for determining optimal feedback control policies for linear systems with quadratic measures of cost. The situation has been less satisfactory, however, with regard to optimal trajectories. A one-sweep initial-value method is presented in this study for determining both optimal policies and optimal trajectories. It is shown also that the solution of the Cauchy problem satisfies the Euler equation and the boundary conditions. 18 pp. Ref

Document Details

  • Copyright: RAND Corporation
  • Availability: Web Only
  • Year: 1968
  • Pages: 18
  • Document Number: RM-5755-PR

Citation

Chicago Manual of Style

Kalaba, Robert E., Dynamic Programming and Optimal Trajectories for Quadratic Variational Processes. Santa Monica, CA: RAND Corporation, 1968. https://www.rand.org/pubs/research_memoranda/RM5755.html.
BibTeX RIS

This publication is part of the RAND research memorandum series. The research memorandum series, a product of RAND from 1948 to 1973, included working papers meant to report current results of RAND research to appropriate audiences.

This document and trademark(s) contained herein are protected by law. This representation of RAND intellectual property is provided for noncommercial use only. Unauthorized posting of this publication online is prohibited; linking directly to this product page is encouraged. Permission is required from RAND to reproduce, or reuse in another form, any of its research documents for commercial purposes. For information on reprint and reuse permissions, please visit www.rand.org/pubs/permissions.

RAND is a nonprofit institution that helps improve policy and decisionmaking through research and analysis. RAND's publications do not necessarily reflect the opinions of its research clients and sponsors.