最小割引報酬ハミルトン・ヤコビ定式化による可到達集合計算
A Minimum Discounted Reward Hamilton-Jacobi Formulation for Computing Reachable Sets
最小割引報酬最適制御問題として可到達集合を近似する新定式化を提案し、ハミルトン・ヤコビ方程式の連続解と収縮写像の固定点として数値解を得る手法を示した。強化学習との関連や二重積分器・追跡逃避ゲームでの有効性も示す。
著者: Anayo K. Akametalu, Shromona Ghosh, Jaime F. Fisac, Claire J. Tomlin
分類: math.OC, cs.RO
原文アブストラクト
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.
