论文信息 - Dynamic Programming, System Identification, and Suboptimization

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.

R. Bellman

[1] R. Bellman. On the approximation of curves by line segments using dynamic programming , 1961, CACM.

[2] R BELLMAN,et al. ON THE IDENTIFICATION OF SYSTEMS AND THE UNSCRAMBLING OF DATA: SOME PROBLEMS SUGGESTED BY NEUROPHYSIOLOGY. , 1964, Proceedings of the National Academy of Sciences of the United States of America.