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

计算可达集的最小折扣报酬Hamilton-Jacobi公式

A Minimum Discounted Reward Hamilton-Jacobi Formulation for Computing Reachable Sets

University of California, Berkeley(加州大学伯克利分校)

Anayo K. Akametalu, Shromona Ghosh, Jaime F. Fisac, Claire J. Tomlin

摘要:

我们提出了一种新的配方近似可达集通过最小折扣奖励最优控制问题。该公式产生了一个连续的解决方案,可以通过求解汉密尔顿-雅可比方程。此外,这个解的数值逼近可以作为压缩映射的唯一不动点来获得。这允许更有效解的方法,不能应用于传统的公式求解可达集。此外,该公式为具有未知动态的系统提供了强化学习和学习可达集之间的联系,允许将前者的算法应用于后者。我们使用两个基准的例子,双积分器,和追逃对策,以显示制定的正确性,以及与以前的工作相比,它的优势。

英文摘要:

We propose a novel formulation for approximating reachable sets through a minimum discounted reward optimal control problem. The formulation yields a continuous solution that can be obtained by solving a Hamilton-Jacobi equation. Furthermore, the numerical approximation to this solution can be obtained as the unique fixed-point to a contraction mapping. This allows for more efficient solution methods that could not be applied under traditional formulations for solving reachable sets. In addition, this formulation provides a link between reinforcement learning and learning reachable sets for systems with unknown dynamics, allowing algorithms from the former to be applied to the latter. We use two benchmark examples, double integrator, and pursuit-evasion games, to show the correctness of the formulation as well as its strengths in comparison to previous work.

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

↑