首页> 外文期刊>IFAC PapersOnLine >High-order approximation of the finite horizon control problem via a tree structure algorithm
【24h】

High-order approximation of the finite horizon control problem via a tree structure algorithm

机译:通过树结构算法对有限层控制问题的高阶逼近

获取原文
           

摘要

Solving optimal control problems via Dynamic Programming is a difficult task that suffers for the ”curse of dimensionality”. This limitation has reduced its practical impact in real world applications since the construction of numerical methods for nonlinear PDEs in very high dimension is practically unfeasible. Recently, we proposed a new numerical method to compute the value function avoiding the construction of a space grid and the need for interpolation techniques. The method is based on a tree structure that mimics the continuous dynamics and allows to solve optimal control problems in high-dimension. This property is particularly useful to attack control problems with PDE constraints. We present a new high-order approximation scheme based on the tree structure and show some numerical results.
机译:通过动态编程解决最优控制问题是一项艰巨的任务,它受到“维数的诅咒”的困扰。这种限制降低了其在实际应用中的实际影响,因为构建非常高维的非线性PDE的数值方法实际上是不可行的。最近,我们提出了一种新的数值方法来计算值函数,从而避免了空间网格的构造和对插值技术的需求。该方法基于模仿连续动态并允许解决高维最优控制问题的树结构。此属性对于攻击具有PDE约束的控制问题特别有用。我们提出了一种基于树结构的新的高阶近似方案,并给出了一些数值结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号