Hugging Face Trending Papers

Offline Approximate Value Iteration: A Reinforcement Learning Approach for Satellite Constellation Deployment

Read the original on Hugging Face Trending Papers →

The paper presents a reinforcement learning-based approximate dynamic programming method for deploying Walker-type satellite constellations amid uncertainties such as launch failures and satellite malfunctions. It models the deployment as a Markov Decision Process that includes low‑injection orbit launches, continuous low‑thrust orbit raising, and variable satellite loads. Using offline approximate value iteration with linear function approximation and action pruning, the approach reduces computational and memory demands, and preliminary results show convergence to policies with lower expected costs and deployment times compared to a rolling‑horizon baseline.

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 Hugging Face Trending Papers.

arXiv AI
Aug 20

Hybrid Reinforcement Learning and Search for Flight Trajectory Planning

The paper investigates combining Reinforcement Learning (RL) with search-based path planners to accelerate flight trajectory optimization for airliners. An RL agent is trained to generate near‑optimal paths from location and atmospheric data, which then constrain a traditional solver to reduce its search space. Experiments using Airbus performance models show that fuel consumption deviates by less than 1% from an unconstrained solver while computation time improves by up to 50%.

By Alberto Luise, Michele Lombardi
arXiv Machine Learning
Oct 3

Towards Optimal Policy Improvement

The paper introduces a framework for optimal policy improvement in reinforcement learning, defining it as the best single update under given constraints. It shows that restricting improvement to a subset of states is equivalent to solving an induced Markov Decision Process, linking planning with explicit or implicit models to optimal policy improvement. The authors develop a novel operator for greedification under approximate evaluation, demonstrating empirical gains across several RL algorithms and settings.

By Yaniv Oren, Viliam Vadocz, Wiktor Zabka, Thomas Evers, Jan Robine, Wendelin B\"ohmer, Matthijs T. J. Spaan, Martha White, Hendrik Baier, Fenghui Yu
arXiv Machine Learning
Aug 20

Online Learning for Dynamic Constellation Topologies

The paper proposes an online learning framework for configuring dynamic constellation topologies in satellite networks, addressing the challenges posed by continuous orbital movement and node maneuvering. It does not rely on predefined orbital plane structures, making it robust to changes caused by satellite maneuvers. Experiments show that the method performs comparably to state‑of‑the‑art offline techniques and can be adapted to constrained online learning, balancing per‑iteration computational cost against convergence speed.

By Jo\~ao Norberto, Ricardo Ferreira, Cl\'audia Soares
arXiv Machine Learning
Jul 1

Deep Reinforcement Learning for Spacecraft Attitude Control During Atmospheric Re-Entry

arXiv:2606. 31291v1 Announce Type: new Abstract: Deep reinforcement learning has the potential to solve attitude control problems more adaptively, precisely, and robustly by handling nonlinear dynamics, uncertainties, and failure cases more effectively than traditional attitude control approaches.

By Alexander Fabisch, Melvin Laux, Mariela De Lucas \'Alvarez, Edoardo Caroselli, Julian Theis
arXiv AI
Aug 26

Reinforcement Learning-Guided Evolutionary Policy Optimization for Preference-Adjustable Heterogeneous Agile Earth Observation Satellite Scheduling

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