A minima tracking variant of semi-infinite programming for the treatment of path constraints within direct solution of optimal control problems
A minima tracking variant of semi-infinite programming for the treatment of path constraints within direct solution of optimal control problems
复制标题
半无限规划的最小跟踪变体，用于处理最优控制问题的直接解决方案中的路径约束
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
J. Schlöder
中科院分区：
文献类型：
--
作者：
A. Potschka;H. Bock;J. Schlöder
我们提出了一个扩展的直接多重打靶法的解决方案的最优控制问题的路径约束。该扩展允许在相对粗糙的离散化控制的情况下完全自动和准确地处理路径约束，同时保持系统动态的规定分辨率。它基于半无限规划的经典理论中的一个简化原理。在此基础上设计了最小值跟踪算法。我们从理论上和数值上比较这种方法与采样技术。数值测试用例是一个著名的，困难的航天飞机再入基准问题。
We present an extension of the direct multiple shooting method for the solution of optimal control problems with path constraints. The extension allows for fully automatic and accurate treatment of path constraints in case of relatively coarse discretizations of the control while maintaining a prescribed resolution of the system dynamics. It is based on a reduction principle from classical theory of semi-infinite programming. On the basis of these theoretical foundations the minima tracking algorithm is designed. We theoretically and numerically compare this method with a sampling technique. The numerical test case is a well-known, difficult space shuttle reentry benchmark problem.