Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
Collaborative Combat Aircraft (CCAs) are envisioned to enable autonomous Intelligence, Surveillance, and Reconnaissance (ISR) missions in contested environments, where adversaries may act strategically to deceive or evade detection. These missions pose significant challenges due to model uncertainty and the need for safe, real-time decision-making. While reinforcement learning (RL) offers adaptability, it lacks the safety guarantees required for critical operations. Robust Markov Decision Processes (RMDPs) offer worst-case guarantees but are traditionally limited by static ambiguity sets, which capture the uncertainty over the true environment model. This paper presents an adaptive RMDP framework tailored to wide-area ISR with CCAs. We introduce a mission-specific Markov Decision Process (MDP) formulation where aircraft alternate between movement and surveillance states. Adversarial tactics are modeled as a finite set of transition kernels, each capturing a different assumption about how the adversary’s sensing or environmental conditions affect the rewards. Our approach incrementally refines policies by passively eliminating inconsistent threat models over time, allowing each agent to shift from conservative to efficient behaviors while maintaining robustness. Across both Gaussian and non-Gaussian threat models and a range of network topologies, our adaptive robust planner consistently achieves higher performance and lower exposure risk than nominal and static robust baselines.