Hugging Face Trending Papers

Forward Trajectory Steering for Hamilton-Jacobi Reachability Analysis

Read the original on Hugging Face Trending Papers →

Hamilton-Jacobi (HJ) reachability provides a mathematically rigorous framework for safe control of dynamical systems, but its practical application is bottlenecked by the computational complexity of solving Hamilton-Jacobi-Isaacs variational inequality PDEs in high dimensions. Physics-informed neural networks (PINNs) have recently emerged as a promising alternative to classical mesh-based solvers, yet their performance is highly sensitive to the choice of collocation sampling.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at Hugging Face Trending Papers.

arXiv AI
Aug 19

Solving nonconvex Hamilton--Jacobi--Isaacs equations with PINN-based policy iteration

The paper introduces a mesh‑free policy iteration framework that blends classical dynamic programming with physics‑informed neural networks (PINNs) to solve high‑dimensional, nonconvex Hamilton–Jacobi–Isaacs (HJI) equations. The method alternates between solving linear second‑order PDEs under fixed feedback policies and updating controls via pointwise minimax optimization using automatic differentiation. The authors prove local uniform convergence of the value function iterates to the unique viscosity solution under standard Lipschitz and uniform ellipticity assumptions, and demonstrate the approach’s accuracy and scalability in two‑, five‑, and ten‑dimensional stochastic games, outperforming direct PINN solvers.

By Hee Jun Yang, Minjung Gim, Yeoneung Kim
arXiv Machine Learning
Sep 14

VertexCBF: Improving Neural Control Barrier Functions via Vertex-Restricted Control Search

VertexCBF is a framework that learns neural control barrier functions (CBFs) by approximating the stationary Hamilton–Jacobi value function with a neural network trained through physics‑informed and sparsely supervised learning. It exploits control‑affine dynamics and a convex polytope control set to generate supervision points via GPU‑parallel vertex‑restricted tree search, ensuring the learned CBF never exceeds the specified constraint function. The method was evaluated on 15 systems, outperforming baselines by recovering larger safe sets, and demonstrated on a mobile robot that safely avoids pedestrians using a neural CBF trained with this approach.

By Bojan Deraji\'c, Sebastian Bernhard, Wolfgang H\"onig