Dynamic programming in applied tasks which are allowing to reduce the options selection

The article discusses the dynamic programming algorithm developed by R. Bellman, based on the search for the optimal trajectory connecting the nodes of a predefined regular grid of states. Possibilities are analyzed for a sharp increase in the effectiveness of using dynamic programming in solving ap...

Full description

Saved in:
Bibliographic Details
Main Authors: D. A. Karpov, V. I. Struchenkov
Format: Article
Language:Russian
Published: MIREA - Russian Technological University 2020-08-01
Series:Российский технологический журнал
Subjects:
Online Access:https://www.rtj-mirea.ru/jour/article/view/236
Tags: Add Tag
No Tags, Be the first to tag this record!