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

基于广义霍普夫公式的时间最优协同引导

Time-Optimal Collaborative Guidance Using the Generalized Hopf Formula

Naval Air Warfare Center Weapons Division(海军航空作战中心武器分部);Brown University(布朗大学);University of California, Los Angeles(加州大学洛杉矶分校)

Matthew R. Kirchner, Robert Mar, Gary Hewer, Jérôme Darbon, Stanley Osher, Y. T. Chow

AI总结:

本文提出了一种计算多车追捕-躲避系统时间最优引导控制的新方法,通过构建联合微分博弈并求解哈密顿-雅可比-伊萨克斯方程,利用广义霍普夫公式高效计算高维价值函数,迭代求解最优到达时间并推导最优控制。

摘要:

本文提出了一种计算多车追捕-躲避系统时间最优引导控制的新方法,通过构建联合微分博弈并求解哈密顿-雅可比-伊萨克斯方程,利用广义霍普夫公式高效计算高维价值函数,迭代求解最优到达时间并推导最优控制。

英文摘要:

Presented is a new method for calculating the time-optimal guidance control for a multiple vehicle pursuit-evasion system. A joint differential game of k pursuing vehicles relative to the evader is constructed, and a Hamilton-Jacobi-Isaacs (HJI) equation that describes the evolution of the value function is formulated. The value function is built such that the terminal cost is the squared distance from the boundary of the terminal surface. Additionally, all vehicles are assumed to have bounded controls. Typically, a joint state space constructed in this way would have too large a dimension to be solved with existing grid-based approaches. The value function is computed efficiently in high-dimensional space, without a discrete grid, using the generalized Hopf formula. The optimal time-to-reach is iteratively solved, and the optimal control is inferred from the gradient of the value function.

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

↑