arXiv:2610.41639v1 Announce Type: new
Abstract: Autonomous inspection of a target spacecraft is typically the initial step in on-orbit servicing. Planning close-proximity observation viewpoints invol...
By Chlo\'e Carer (LGI), Adam Abdin (LGI)
arXiv:2609.07998v1 Announce Type: new
Abstract: We study the control of Markov decision processes in which the quality of a policy is evaluated by a dynamic, time-consistent Markov risk measure rathe...
By Aayush Patel, Andrzej Ruszczy\'nski
arXiv:2610.28818v1 Announce Type: cross
Abstract: As systems engineering (SE) shifts from monolithic systems to Systems of Systems, Mission Engineering (ME) has emerged as a new line of thinking in S...
By \.Ibrahim O\u{g}uz \c{C}etinkaya, Sajad Khodadadian, Taylan Topcu
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:2606. 27766v1 Announce Type: cross Abstract: Offline reinforcement learning enables policy learning from fixed datasets without additional environment interaction, making it appealing for safety-critical applications where online exploration is costly or unsafe.
By Shiqiang Gong
The paper introduces IQACO, an implicit Q‑learning‑bootstrapped ant colony optimization algorithm for scheduling maritime moving‑target observations with agile Earth‑observation satellites. IQACO embeds an offline implicit Q‑learning module into the ant colony framework to adaptively adjust pheromone, heuristic, and evaporation parameters based on a compact search‑state representation. Experiments on 14 scenarios show IQACO outperforms conventional ant colony optimization, improving mean observation benefit by 3.40%–9.40%, accelerating convergence, and maintaining stability across different objective‑weight settings.
By He Wang, Junyu Wu, Yeye Liu, Yifan Zhou, Jie Zhang, Hui Li, Yanjie Song, Liang Li
arXiv:2608. 09628v1 Announce Type: new Abstract: Collision avoidance systems are commonly used to avoid fragmentation events occurring in Low-Earth Orbit (LEO) and Geosynchronous Equatorial Orbit (GEO).
By Logan Luna (Georgia Institute of Technology), Juan Ortiz Couder (Embry-Riddle Aeronautical University), Raul Alejandro Vargas-Acosta (Embry-Riddle Aeronautical University)
arXiv:2602. 05459v2 Announce Type: replace Abstract: Offline goal-conditioned reinforcement learning (GCRL) is typically benchmarked by the best tuned success rate of each method.
By Jan Malte T\"opperwien, Aditya Mohan, Marius Lindauer
This paper presents a distribution-agnostic robust trajectory-optimization framework based on chance-constrained reinforcement learning. The uncertainty is represented here through initial conditions and process noise, with the only requirement being that it can be sampled.
The paper introduces a reinforcement‑learning‑guided evolutionary policy optimization framework for scheduling heterogeneous agile Earth observation satellites, addressing task selection, satellite assignment, and sequencing under diverse visibility windows, maneuvering constraints, energy use, and storage limits. It combines assignment‑based indirect encoding with decoder‑based cost evaluation to capture satellite‑dependent constraints while integrating task gain, energy savings, and load balance into a single utility metric. The resulting RLOSMEA algorithm uses reinforcement learning to select high‑level search operators, achieving higher weighted utility and more stable convergence than baseline metaheuristics across varied AEOS scenarios.
By He Wang, Junyu Wu, Hui Li, Yanjie Song, Witold Pedrycz, Liang Li
arXiv:2607. 28916v1 Announce Type: cross Abstract: Multistep credit assignment is critical for sample-efficient reinforcement learning, yet managing off-policy bias in Q-learning remains a fundamental challenge.
By Brett Daley
arXiv:2606. 10228v1 Announce Type: cross Abstract: Safe exploration is a prerequisite for deploying reinforcement learning (RL) agents in safety-critical domains.
By Kaustubh Mani, Yann Pequignot, Vincent Mai, Liam Paull