ROSYSYMay 19

Hamilton--Jacobi Reachability for Spacecraft Collision Avoidance

arXiv:2605.2013817.2
AI Analysis

It addresses the need for mathematically rigorous collision avoidance in satellite operations, but the method is an application of existing HJ reachability to a specific domain with simplified dynamics.

This paper applies Hamilton-Jacobi reachability to a two-satellite collision avoidance problem, computing backward reachable sets that characterize unsafe relative states under worst-case disturbances, and integrates them with supervisory control to provide provable safety guarantees.

This article presents a Hamilton--Jacobi (HJ) reachability framework for a two--satellite collision avoidance problem operating in the same circular orbit, where relative motion is modeled in the radial--tangential--normal (RTN) frame using planar Hill--Clohessy--Wiltshire (HCW) dynamics. We define the target state space as unsafe relative configurations in the orbit plane corresponding to minimum separation requirements consistent with Federal Communications Commission (FCC) orbital standards. The interaction between spacecraft is formulated as a zero--sum differential game, where Player 1 is the controlled satellite and Player 2 is modeled as a bounded adversarial disturbance with unknown intent. We present the HJ formulation and compute backward reachable sets that characterize relative states from which collision cannot be avoided under worst-case disturbances, while states outside this set admit provably collision-free trajectories. These reachable sets are integrated with supervisory hybrid control logic to determine when evasive maneuvers must be initiated, enabling mathematically grounded safety guarantees for scalability.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes