arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2403.07707math.OCcs.SYeess.SY
收藏

多项式紧界及其在动态优化问题中的应用

Tight Bounds on Polynomials and Its Application to Dynamic Optimization Problems

Imperial College London(帝国理工学院)

Eduardo M. G. Vila, Eric C. Kerrigan, Paul Bruce

AI总结:

本文提出一种伪谱方法,通过灵活子区间实现动态优化问题的紧多项式界,有效处理不等约束并降低计算成本,通过实例展示其在最优控制中的可行性。

摘要:

本文提出了一种伪谱方法,通过灵活子区间实现动态优化问题的紧多项式界,有效处理不等约束并降低计算成本,通过实例展示其在最优控制中的可行性。

英文摘要:

This paper presents a pseudo-spectral method for Dynamic Optimization Problems (DOPs) that allows for tight polynomial bounds to be achieved via flexible sub-intervals. The proposed method not only rigorously enforces inequality constraints, but also allows for a lower cost in comparison with non-flexible discretizations. Two examples are provided to demonstrate the feasibility of the proposed method to solve optimal control problems. Solutions to the example problems exhibited up to a tenfold reduction in relative cost.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑