Pith. sign in

REVIEW 3 cited by

Dynamic Safety in Complex Environments: Synthesizing Safety Filters with Poisson's Equation

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 2505.06794 v1 pith:GKB77HWE submitted 2025-05-11 cs.RO cs.SYeess.SY

Dynamic Safety in Complex Environments: Synthesizing Safety Filters with Poisson's Equation

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

Synthesizing safe sets for robotic systems operating in complex and dynamically changing environments is a challenging problem. Solving this problem can enable the construction of safety filters that guarantee safe control actions -- most notably by employing Control Barrier Functions (CBFs). This paper presents an algorithm for generating safe sets from perception data by leveraging elliptic partial differential equations, specifically Poisson's equation. Given a local occupancy map, we solve Poisson's equation subject to Dirichlet boundary conditions, with a novel forcing function. Specifically, we design a smooth guidance vector field, which encodes gradient information required for safety. The result is a variational problem for which the unique minimizer -- a safety function -- characterizes the safe set. After establishing our theoretical result, we illustrate how safety functions can be used in CBF-based safety filtering. The real-time utility of our synthesis method is highlighted through hardware demonstrations on quadruped and humanoid robots navigating dynamically changing obstacle-filled environments.

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. Grasp Execution Without a Planner: Configuration-Space Grasp Distance Fields with Certified Safety & Guaranteed Quality

    cs.RO 2026-08 reject novelty 6.0

    A softmin distance field over grasp candidates, followed by a CBF-CLF filtered feedback law, executes reach-grasp-lift without a planner and retains most of the synthesized grasp quality.

  2. Grasp Execution Without a Planner: Configuration-Space Grasp Distance Fields with Certified Safety & Guaranteed Quality

    cs.RO 2026-08 reject novelty 6.0

    Grasp execution via a softmin field over grasp configurations with CBF-QP safety filtering, eliminating trajectory replanning, with a force-closure margin guarantee that fails in one reported trial.

  3. Towards General Language-Conditioned Latent Safety Filters

    cs.RO 2026-07 conditional novelty 6.0

    A single Hamilton-Jacobi safety filter conditioned on language constraints reduces violations in simulated pick-and-place, wiping, and stacking, with partial transfer to unseen constraint instances.