CORTEXA
← Browse
arxiveess.SY2026-07-03

Interception-Driven Inverse Reachability for Engagement Zone Construction

Grant Stagg, Cameron K. Peterson, Alexander Von Moll, Isaac Weintraub

In contested environments, autonomous vehicles may need to plan around adversarial pursuers whose launch locations are unknown. This paper presents an interception-driven inverse-reachability framework for inferring a feasible pursuer launch region directly from observed interception events for a single pursuer. Each interception induces a geometric constraint on the unknown launch location, and intersecting these constraints yields a bounded set guaranteed to contain the true origin under maximum-capability assumptions. Mapping this inferred set through the pursuer reachable region produces deterministic engagement zones with an explicit worst-case safety interpretation. A probabilistic extension models uncertainty in the pursuer launch location and yields graded engagement-risk fields for risk-aware planning. To accelerate localization, we introduce an information-driven planner for sacrificial agents that selects trajectories to maximize expected contraction of the feasible launch region. Monte Carlo simulations show that the proposed framework rapidly reduces launch-location uncertainty and enables substantially shorter safe trajectories after only a small number of sacrificial deployments.

View free PDFSource page

Related papers

arxivcs.AIeess.SY2026-06-29

Sample-Efficient Learning of Probabilistic Causes for Reachability in Markov Decision Processes with Probabilistic Guarantees

Ryohei Oura, Georgios Fainekos, Hideki Okamoto, Bardh Hoxha

Probabilistic model checking for Markov decision processes (MDPs) provides quantitative guarantees, but often offers limited insight into why undesired outcomes occur. Probability-raising (PR) causality addresses this by identifying states whose visitation increases the probabili…

View free PDFSource page
arxiveess.SY2026-07-01

Reachability Analysis With Probabilistic Zonotopes: Learning Realized Disturbances and Refining Aleatory Uncertainty

Amir Modares, Zhen Zhang, Themistoklis Charalambous, Amr Alanwar, Hamidreza Modares

This paper develops a data-driven reachability framework for linear systems whose disturbances are modeled by probabilistic zonotopes (PZs), combining bounded deterministic and Gaussian stochastic components. In contrast to methods that require a precisely known disturbance model…

View free PDFSource page
arxiveess.SY2026-07-08

Reachability-Preserving Bellman Operator for the Discounted Reach-Cost Value Function: Uniting Hamilton-Jacobi Reachability and Reinforcement Learning

Isabelle El-Hajj, Prashant Solanki, Jasper van Beers, Coen de Visser, Erik-Jan van Kampen

Hamilton-Jacobi (HJ) reachability provides rigorous safety and reachability guarantees for continuous-time dynamical systems, but its numerical solution suffers from the curse of dimensionality. Deep reinforcement learning (DRL), by contrast, offers scalable sample-based methods.…

View free PDFSource page
arxiveess.SY2026-07-06

Reachability Analysis for Power Systems with Heterogeneous Resources via Jordan Transformation

Damola Ajeyemi, Antonin Colot, Sairaj Dhople, Emiliano Dall'Anese, Saber Jafarpour

This paper develops a computationally efficient framework for reachability analysis of transmission-level power system dynamics with synchronous generators, grid-forming and grid-following inverters, and uncertain power injections/withdrawals. Starting from reduced-order device m…

View free PDFSource page
arxiveess.SY2026-06-30

Dynamic Scheduling for Flexible Manufacturing Systems Based on Multi-Agent Deep Reinforcement Learning and Petri Nets

Zhou He, Ning Li, Ruotian Liu, Liang Li, Carla Seatzu

This paper investigates dynamic scheduling for flexible manufacturing systems (FMSs) subject to dynamic events, such as new order arrivals, temporary order cancellations, and machine failures. Traditional methods often face significant challenges in achieving real-time responsive…

View free PDFSource page