A minimum discounted reward Hamilton-Jacobi formulation for computing reachable sets

DOI10.1109/TAC.2023.3327159MaRDI QIDQ6575788zbMATH OpenFDO

Authors Anayo K. Akametalu, Shromona Ghosh, Jaime F. Fisac, Vicenc Rubies-Royo, Claire Tomlin

Publication date 21 July 2024

Published in IEEE Transactions on Automatic Control (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TAC.2023.3327159

Mathematics Subject Classification ID

Optimality conditions for minimax problems (49K35) Hamilton-Jacobi equations in optimal control and differential games (49L12) Pursuit and evasion games (49N75) Attainable sets, reachability (93B03)

Cited in

(1)

• Scalable synthesis of formally verified neural value function for Hamilton-Jacobi reachability analysis

This page was built for publication: A minimum discounted reward Hamilton-Jacobi formulation for computing reachable sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575788)