DYNAMIC PROGRAMMING, SYSTEM IDENTIFICATION, AND SUBOPTIMIZATION

Abstract

In this memorandum the author employs the mathematical technique of dynamic programming to obtain a best-fit approximation to a function that is defined over some given interval. He then describes how this method offers an approach to the handling of a certain type of pattern-recognition problem and to the approximation of optimal control policies.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jun 01, 1965
Accession Number
AD0616780

Entities

People

  • Richard E. Bellman

Organizations

  • RAND Corporation

Tags

Communities of Interest

  • Materials and Manufacturing Processes

DTIC Thesaurus Topics

  • Air Force
  • Algorithms
  • Computations
  • Computer Programming
  • Curve Fitting
  • Differential Equations
  • Dynamic Programming
  • Engineering
  • Equations
  • Identification
  • Intervals
  • Numerical Integration
  • Pattern Recognition
  • Polynomials
  • Recognition

Readers

  • Calculus or Mathematical Analysis
  • Logistics and Supply Chain Management.
  • Regression Analysis.

Technology Areas

  • AI & ML
  • AI & ML - Bayesian Inference
  • AI & ML - Machine Learning Algorithms