arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 0901.3977math.OCcs.NAmath.APmath.NA
收藏

多目标最优控制及积分约束下最优控制的高效方法

An efficient method for multiobjective optimal control and optimal control subject to integral constraints

Cornell University(康奈尔大学)

Ajeet Kumar, Alexander Vladimirsky

AI总结:

提出一种基于扩展状态空间和增广Hamilton-Jacobi-Bellman PDE的高效数值方法,利用新维度上的因果性(特征曲线单调性)通过半拉格朗日推进法逼近不连续粘性解,解决多准则最优控制和积分约束下的单准则最优控制问题。

摘要:

我们提出了一种新的高效数值方法,用于多准则最优控制和积分约束下的单准则最优控制。该方法通过扩展状态空间以包含每个约束剩余“预算”的信息,然后数值求解增广的Hamilton-Jacobi-Bellman偏微分方程。我们方法的效率依赖于该PDE中的因果性,即新增加维度上特征曲线的单调性。采用半拉格朗日“推进”方法有效逼近不连续粘性解。我们将此方法与最近提出的基于“加权和”的同类问题算法进行比较。通过飞行路径规划和存在友好与敌对观察者的机器人导航实例说明我们的方法。

英文摘要:

We introduce a new and efficient numerical method for multicriterion optimal control and single criterion optimal control under integral constraints. The approach is based on extending the state space to include information on a "budget" remaining to satisfy each constraint; the augmented Hamilton-Jacobi-Bellman PDE is then solved numerically. The efficiency of our approach hinges on the causality in that PDE, i.e., the monotonicity of characteristic curves in one of the newly added dimensions. A semi-Lagrangian "marching" method is used to approximate the discontinuous viscosity solution efficiently. We compare this to a recently introduced "weighted sum" based algorithm for the same problem. We illustrate our method using examples from flight path planning and robotic navigation in the presence of friendly and adversarial observers.

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

↑