DYNAMIC PROGRAMMING AND PONTRYAGIN'S MAXIMUM PRINCIPLE
CHANG,S.S.L.
Abstract
CHANG,S.S.L.
Abstract
Bellman's dynamic programming and Pontryagin's maximum principle are generally regarded as two alternative ways of solving the problem of op imum control of a nonlinear system. A multistage decision process is described and applied to an optimal trajectory. The maximum principle is derived when one tries to overcome certain practical difficulties in dynamic programming. (Author)
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Bellman's dynamic programming and Pontryagin's maximum principle are generally regarded as two alternative ways of solving the problem of op imum control of a nonlinear system. A multistage decision process is described and applied to an optimal trajectory. The maximum principle is derived when one tries to overcome certain practical difficulties in dynamic programming. (Author)
Key concepts: Pontryagin's minimum principle, Dynamic programming, Maximum principle, Optimal control, Mathematical optimization, Mathematics, Process (computing), Trajectory