arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.03183math.OC
收藏

基于Hamilton的松弛最优控制算法

Hamiltonian-based Algorithm for Relaxed Optimal Control

Yorai Wardi, Magnus Egerstedt, Muhammad Umer Qureshi

摘要:

本文研究了一类定义在切换模式混杂系统上的最优控制问题的一阶算法技术。该算法的突出特点是,它避免了计算成本泛函的Fréchet或Gâteaux导数,这可能是耗时的,而是在投影梯度方向上移动,这是很容易计算的(对于一类问题),不需要任何显式导数。该算法适用于一类问题的一个点态极小的哈密顿量是可计算的一个简单的公式,这包括许多问题,出现在理论和应用。该算法的自然设置是连续时间松弛控制的空间,其特殊的结构使得分析比普通控制的设置更简单。虽然放松控制的空间具有理论优势,但其元素是抽象实体,可能不适合计算。因此,该算法的一个关键特征是,它计算适当的近似放松控制,而不会失去其理论收敛性能。仿真结果,包括CPU时间,支持理论的发展。

英文摘要:

This paper concerns a first-order algorithmic technique for a class of optimal control problems defined on switched-mode hybrid systems. The salient feature of the algorithm is that it avoids the computation of Fréchet or Gâteaux derivatives of the cost functional, which can be time consuming, but rather moves in a projected-gradient direction that is easily computable (for a class of problems) and does not require any explicit derivatives. The algorithm is applicable to a class of problems where a pointwise minimizer of the Hamiltonian is computable by a simple formula, and this includes many problems that arise in theory and applications. The natural setting for the algorithm is the space of continuous-time relaxed controls, whose special structure renders the analysis simpler than the setting of ordinary controls. While the space of relaxed controls has theoretical advantages, its elements are abstract entities that may not be amenable to computation. Therefore, a key feature of the algorithm is that it computes adequate approximations to relaxed controls without loosing its theoretical convergence properties. Simulation results, including cpu times, support the theoretical developments.

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

↑