HJ-SafeDMP: Hamilton-Jacobi Reachability-Guided Dynamic Movement Primitives for Provably Safe Robot Motion

• URL: http://arxiv.org/abs/2606.28995v1
• Date: Sat, 27 Jun 2026 16:15:07 GMT
• Title: HJ-SafeDMP: Hamilton-Jacobi Reachability-Guided Dynamic Movement Primitives for Provably Safe Robot Motion
• Abstract summary: This paper introduces HJ-SafeDMP, a framework that integrates Dynamic Movement Primitives with learned Reachability-based safety value functions.<n>We show that HJ-SafeDMP achieves formal safety guarantees with orders-of-magnitude faster execution than optimization-based baselines.
• Score: 0.8594140167290097
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: Robots deployed in safety-critical environments must execute motions that are simultaneously robust to disturbances and provably safe from collisions. Dynamic Movement Primitives (DMPs) offer inherent stability, temporal flexibility, and efficient trajectory generalization from single demonstrations, but they lack formal safety certificates. Conversely, Hamilton-Jacobi (HJ) Reachability analysis provides a principled framework for computing worst-case safety margins and forward-invariant safe sets, but classical grid-based methods suffer from the curse of dimensionality and are impractical for real-time control. This paper introduces HJ-SafeDMP, a framework that integrates DMPs with learned HJ Reachability-based safety value functions to achieve provably safe, robust, and computationally efficient robot motion. We learn a Control Barrier Value Function (CBVF) from offline demonstration data using a model-free, finite-difference HJ recursion and deploy it as a real-time safety filter via a closed-form control law that modulates the DMP output. Unlike optimization-based CBF-QP approaches, our method achieves safety filtering without online quadratic program solves, preserving the computational efficiency of DMPs. We further incorporate an expectile-based offline learning objective that avoids querying out-of-distribution actions, and a conformal prediction calibration step that provides finite-sample probabilistic safety coverage. Experimental evaluation on a 7-DOF robot manipulator demonstrates that HJ-SafeDMP achieves formal safety guarantees with orders-of-magnitude faster execution than optimization-based baselines, while maintaining the robustness and adaptability of DMPs for human-robot interaction.

Related papers

• Distributed Motion Planning with Safety Guarantees for Self-Reconfiguring Robotic Boats [76.98547580312116]
  This paper proposes a hybrid framework that combines distributed Model Predictive Control (MPC) with Control Barrier Functions (CBFs)<n>To ensure safety in real time, distributed CBF-based filters are applied to enforce inter-agent avoidance.
  arXiv  Detail & Related papers  (2026-07-22T16:37:05Z)
• D-SafeMPC: Diffusion-Driven Safe Model Predictive Control with Discrete-Time Control Barrier Functions [35.33769360235326]
  Key limitation on the use of diffusion models in robotic planning is their inability to inherently enforce safety or dynamical constraints.<n>We propose D-SafeMPC, which enhances the interaction between diffusion and control.<n>In simulations on a Franka manipulator, D-SafeMPC improves safety, task success rates, and planning efficiency over state-of-the-art baselines.
  arXiv  Detail & Related papers  (2026-07-12T17:10:05Z)
• Selective Safety Steering via Value-Filtered Decoding [54.87935112120107]
  Large language models (LLMs) are trained to align with human values, but their generations may still violate safety constraints.<n>Existing decoding-time steering methods often intervene unnecessarily, modifying generations that would have been safe under the base model.<n>We propose a new test-time steering method designed to reduce such unnecessary interventions while improving the safety of unsafe responses.
  arXiv  Detail & Related papers  (2026-05-14T12:13:08Z)
• SafeDMPs: Integrating Formal Safety with DMPs for Adaptive HRI [0.764671395172401]
  This paper introduces SafeDMPs, a framework for robust, non-optimization-based motion control.<n>We show that SafeDMPs is orders of magnitude faster and more accurate than optimization-based baselines.<n>It is an ideal solution for real-time, safe, and collaborative robotics.
  arXiv  Detail & Related papers  (2026-03-31T13:09:43Z)
• Layered Safety: Enhancing Autonomous Collision Avoidance via Multistage CBF Safety Filters [18.386652442201665]
  This paper presents a general end-to-end framework for constructing robust and reliable layered safety filters.<n>Given a robot-centric point cloud, we begin by constructing an occupancy map which is used to synthesize a Poisson safety function (PSF)<n>The PSF is employed as a control barrier function (CBF) within two distinct safety filtering stages.
  arXiv  Detail & Related papers  (2026-02-27T22:19:45Z)
• Refining Almost-Safe Value Functions on the Fly [0.2770822269241973]
  Control Barrier Functions (CBFs) are a powerful tool for ensuring robotic safety.<n>But designing or learning valid CBFs for complex systems is a significant challenge.<n>This paper bridges the gap between offline and online adaptation.
  arXiv  Detail & Related papers  (2026-02-26T20:10:56Z)
• BarrierSteer: LLM Safety via Learning Barrier Steering [83.12893815611052]
  BarrierSteer is a novel framework that formalizes safety by embedding learned non-linear safety constraints directly into the model's latent representation space.<n>We show that BarrierSteer substantially reduces adversarial success rates, decreases unsafe generations, and outperforms existing methods.
  arXiv  Detail & Related papers  (2026-02-23T18:19:46Z)
• SQ-CBF: Signed Distance Functions for Numerically Stable Superquadric-Based Safety Filtering [9.291918812545699]
  Control barrier functions provide an effective framework for real-time safety filtering.<n>Their performance depends on the underlying geometric representation, which is often simplified.<n>Superquadrics offer an expressive way to model complex shapes using a few primitives.
  arXiv  Detail & Related papers  (2026-02-11T17:19:43Z)
• UpSafe$^\circ$C: Upcycling for Controllable Safety in Large Language Models [67.91151588917396]
  Large Language Models (LLMs) have achieved remarkable progress across a wide range of tasks, but remain vulnerable to safety risks such as harmful content generation and jailbreak attacks.<n>We propose UpSafe$circ$C, a unified framework for enhancing LLM safety through safety-aware upcycling.<n>Our results highlight a new direction for LLM safety: moving from static alignment toward dynamic, modular, and inference-aware control.
  arXiv  Detail & Related papers  (2025-10-02T16:43:33Z)
• Meta-Learning Priors for Safe Bayesian Optimization [72.8349503901712]
  We build on a meta-learning algorithm, F-PACOH, capable of providing reliable uncertainty quantification in settings of data scarcity. As core contribution, we develop a novel framework for choosing safety-compliant priors in a data-riven manner. On benchmark functions and a high-precision motion system, we demonstrate that our meta-learned priors accelerate the convergence of safe BO approaches.
  arXiv  Detail & Related papers  (2022-10-03T08:38:38Z)
• Recursively Feasible Probabilistic Safe Online Learning with Control Barrier Functions [60.26921219698514]
  We introduce a model-uncertainty-aware reformulation of CBF-based safety-critical controllers. We then present the pointwise feasibility conditions of the resulting safety controller. We use these conditions to devise an event-triggered online data collection strategy.
  arXiv  Detail & Related papers  (2022-08-23T05:02:09Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.