mlsanityData to 14 Oct 2026

Bayesian Ambiguity Contraction-based Adaptive Robust Markov Decision Processes for Adversarial Surveillance Missions

arXiv 2512.01660 ↗First posted 1 Dec 2025math.OC cs.LG cs.SYcited by 1

Not on the map. Why?

Abstract (arXiv)

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 challenges due to model uncertainty and the need for safe, real-time decision-making. Robust Markov Decision Processes (RMDPs) provide worst-case guarantees but are limited by static ambiguity sets that capture initial uncertainty without adapting to new observations. This paper presents an adaptive RMDP framework tailored to ISR missions with CCAs. We introduce a mission-specific formulation in which aircraft alternate between movement and sensing states. Adversarial tactics are modeled as a finite set of transition kernels, each capturing assumptions about how adversarial sensing or environmental conditions affect rewards. Our approach incrementally refines policies by eliminating inconsistent threat models, allowing agents to shift from conservative to aggressive behaviors while maintaining robustness. We provide theoretical guarantees showing that the adaptive planner converges as credible sets contract to the true threat and maintains safety under uncertainty. Experiments under Gaussian and non-Gaussian threat models across diverse network topologies show higher mission rewards and fewer exposure events compared to nominal and static robust planners.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 48 references that are in the map. First posted on arXiv 1 Dec 2025.

Builds on

9 of 48 references.

References · 9

  1. 2020Sim-to-Real Transfer in Deep Reinforcement Learning for Robotics: a Surveycited by 413
  2. 2022Policy Gradient Method For Robust Reinforcement Learningcited by 69
  3. 2020Distributionally Robust Bayesian Optimizationcited by 61
  4. 2023Double Pessimism is Provably Efficient for Distributionally Robust Offline Reinforcement Learning: Generic Algorithm and Robust Partial Coveragecited by 51
  5. 2018Reinforcement Learning for UAV Attitude Controlcited by 48
  6. 2024Robust Markov Decision Processes: A Place Where AI and Formal Methods Meetcited by 18
  7. 2025Towards Optimal Offline Reinforcement Learningcited by 2
  8. 2025Bi-Level Route Optimization and Path Planning with Hazard Explorationcited by 1
  9. 2025Autonomous Air-Ground Vehicle Operations Optimization in Hazardous Environments: A Multi-Armed Bandit Approachcited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.