arXiv AI By Minh Bui, Simon Monckton, Mo Chen

Reach-Avoid Differential game with Reachability Analysis for UAVs: A decomposition approach

Read the original on arXiv AI →

The paper presents a novel dimensionality‑reduction framework for reach‑avoid games involving unmanned aerial vehicles. By decomposing the three‑dimensional problem into horizontal and vertical sub‑games, each solved with Hamilton‑Jacobi reachability analysis, the authors reconstruct the full solution using a tracking control algorithm that guarantees attacker capture and subsequent tracking. Numerical simulations and Gazebo simulations confirm that the decomposition preserves optimality and achieves successful quadrotor capture in three‑dimensional space.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Oct 31

Where Planning Changes the Outcome of Orbital Games

The paper introduces OrbitalGym, a JAX‑based simulation environment for studying how planning algorithms and system design influence the outcomes of adversarial orbital encounters. It supports multiple agents, diverse state representations, communication modes, and sensor models, and compiles games to batched GPU code for large‑scale parallel simulation. Using OrbitalGym, the authors evaluate several control policies (PD, LQR, MPC, MCTS) across two close‑range games—pursuit‑evasion and lady‑bandit‑guard—showing that propellant availability often dominates in pursuit‑evasion, while policy choice significantly improves defense in the lady‑bandit‑guard scenario.

By Duncan Eddy, Mahdi Al-Husseini, Mykel J. Kochenderfer
arXiv AI
Sep 15

Conflict-Predictive Variable Horizons in Multi-Drone Distributed Model Predictive Control

The paper introduces a conflict‑predictive variable horizon for distributed model predictive control in multi‑drone collision avoidance. Each drone locally estimates future conflicts using observed positions and confidence funnels, then selects the minimal horizon that covers the farthest predicted conflict, shrinking in clear air and expanding only when necessary. The authors prove that this adaptive horizon preserves recursive feasibility and asymptotic stability for linear models, and demonstrate in simulation that it reduces per‑step solver cost and total computation while maintaining separation on dense benchmarks.

By Linda M\"{u}mken, Michael Schwung, Stefan Lier, Andreas Schwung
arXiv AI
Aug 25

Robust Multi-Agent Reinforcement Learning for Small UAS Separation Assurance under GPS Degradation and Spoofing

The paper presents a robust multi‑agent reinforcement learning framework for small unmanned aircraft systems (sUAS) to maintain separation assurance when GPS data is degraded or spoofed. By modeling state observation corruption as a zero‑sum game, the authors derive a closed‑form adversarial perturbation that eliminates iterative inner optimization and can be evaluated in linear time. Integrating this perturbation into a policy‑gradient MARL algorithm yields a counter‑policy that achieves near‑zero collision rates in high‑density simulations even with up to 35% observation corruption, outperforming non‑adversarial baselines.

By Alex Zongo, Filippos Fotiadis, Ufuk Topcu, Peng Wei