Pith. sign in

REVIEW 3 cited by

Data-Driven Hamiltonian for Direct Construction of Safe Set from Trajectory Data

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.03233 v1 pith:MTCDDY6J submitted 2025-04-04 eess.SY cs.SY

Data-Driven Hamiltonian for Direct Construction of Safe Set from Trajectory Data

classification eess.SY cs.SY
keywords hamiltoniansafedatatrajectorydata-drivendynamicsreachableapproximation
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
Share X Bluesky LinkedIn Reddit HN
read the original abstract

In continuous-time optimal control, evaluating the Hamiltonian requires solving a constrained optimization problem using the system's dynamics model. Hamilton-Jacobi reachability analysis for safety verification has demonstrated practical utility only when efficient evaluation of the Hamiltonian over a large state-time grid is possible. In this study, we introduce the concept of a data-driven Hamiltonian (DDH), which circumvents the need for an explicit dynamics model by relying only on mild prior knowledge (e.g., Lipschitz constants), thus enabling the construction of reachable sets directly from trajectory data. Recognizing that the Hamiltonian is the optimal inner product between a given costate and realizable state velocities, the DDH estimates the Hamiltonian using the worst-case realization of the velocity field based on the observed state trajectory data. This formulation ensures a conservative approximation of the true Hamiltonian for uncertain dynamics. The reachable set computed based on the DDH is also ensured to be a conservative approximation of the true reachable set. Next, we propose a data-efficient safe experiment framework for gradual expansion of safe sets using the DDH. This is achieved by iteratively conducting experiments within the computed data-driven safe set and updating the set using newly collected trajectory data. To demonstrate the capabilities of our approach, we showcase its effectiveness in safe flight envelope expansion for a tiltrotor vehicle transitioning from near-hover to forward flight.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Robust Direct Data-Driven Hamiltonian for Safe Set Computation under Measurement Noise and Disturbances

    eess.SY 2026-06 unverdicted novelty 6.0

    Derives Robust Data-Driven Hamiltonian (R-DDH) from noisy data that provides a certified lower bound on the exact Hamiltonian, yielding an inner approximation of the safe set.

  2. Training with Hard Constraints: Learning Neural Certificates and Controllers for SDEs

    eess.SY 2026-02 conditional novelty 6.0

    Neural reach-avoid certificates for SDEs can be trained with hard guarantees via a bound-based loss, or with PAC guarantees via scenario optimization on the last layer.

  3. How Does the Lagrangian Guide Safe Reinforcement Learning through Diffusion Models?

    cs.LG 2026-02 unverdicted novelty 6.0

    ALGD augments the Lagrangian to locally convexify the energy landscape in diffusion models, stabilizing safe RL training and generation without changing optimal policies.