首页> 外文会议>International Symposium on Computer Applications in Metals Processing Aug 26-29, 2001 Toronto, Ontario, Canada >Iterative Dynamic Programming - From Curiosity to a Practical Optimization Procedure
【24h】

Iterative Dynamic Programming - From Curiosity to a Practical Optimization Procedure

机译:迭代动态规划-从好奇心到实用的优化程序

获取原文
获取原文并翻译 | 示例

摘要

Dynamic programming, developed by Richard Bellman in 1957, is a very attractive optimization procedure conceptually, but attempts to use it for other than very simple optimal control problems have not been successful. The difficulties arise from the need for interpolation, the "curse of dimensionality", and the requirement of a large number of grid points to get a reasonably accurate solution. Several systematic developments had to be made to make dynamic programming suitable for optimal control problems. These developments, as outlined here, led to iterative dynamic programming which can now easily handle optimal control problems of some systems consisting of more than 300 differential equations and more than 300 control variables. Computations with IDP for realistic engineering problems can be done sufficiently fast, so that we may use IDP to solve the optimal control problem within a sampling period and provide in essence a feed-back control policy.
机译:理查德·贝尔曼(Richard Bellman)在1957年开发的动态编程从概念上讲是一种非常吸引人的优化程序,但是尝试将其用于除非常简单的最优控制问题之外的其他方法均未成功。困难源于插值的需求,“维数的诅咒”,以及需要大量网格点才能获得合理准确的解决方案。为了使动态编程适合于最佳控制问题,必须进行一些系统的开发。如此处概述的这些发展导致了迭代动态编程,该程序现在可以轻松处理某些系统的最优控制问题,这些系统包含300多个微分方程和300多个控制变量。使用IDP进行实际工程问题的计算可以足够快地完成,因此我们可以使用IDP解决采样周期内的最佳控制问题,并从本质上提供反馈控制策略。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号