The scenario the researchers studied is a three-body engagement involving the target, the pursuer, and the defender. Once the defender is deployed, two coupled pursuit–evasion relationships emerge simultaneously: the pursuer chases the target, while the defender chases the pursuer in an attempt to spoil the interception. Because the defender bends the pursuer’s trajectory away from the target, the two friendly vehicles must act in a coordinated fashion rather than as independent agents. The difficulty is compounded by the fact that the pursuer may employ any of several established interception laws, including optimal control guidance, proportional navigation, or differential game guidance. A defense scheme tuned to a single assumed attack strategy can be defeated the moment the adversary switches tactics. At the same time, neither the target nor the defender has access to complete state information; both must rely on noisy local measurements of range and line-of-sight angles, which makes the problem one of partial observability as well as multi-strategy adversarial behavior.

Existing guidance approaches fall short in this setting for distinct reasons. Unilateral optimal control methods assume a known, fixed adversary model and cannot adapt when the pursuer changes strategy mid-engagement. Differential game formulations deliver elegant theoretical solutions but typically presume perfect information on both sides, an assumption that collapses in the presence of sensor noise and hidden intentions. Conventional reinforcement learning, meanwhile, has shown promise in adversarial settings, but standard algorithms struggle to converge when observations are incomplete and the opponent’s policy varies across encounters. The Sun Yat-sen team identified this triple challenge—unknown pursuit strategies, information deficiency, and high-maneuverability confrontation—as the key technological bottleneck standing in the way of practical, cooperative active defense for spacecraft.

To overcome it, the researchers reframed the three-body engagement as a multi-agent partially observable Markov decision process, or Multi-POMDP. In this formalism, each agent receives only a noisy local observation rather than the true global state, and the opponent’s policy is treated as uncertain and potentially drawn from a set of diverse strategies. The solution architecture is a reinforcement learning guidance framework built on an adaptive dueling double deep Q-network, abbreviated AD3QN. The central idea is that a single neural network learns, from experience, how to issue coordinated maneuver commands to both the target and the defender, so that the pair adapts on the fly to whatever interception strategy the pursuer happens to be executing. The framework separates perception from decision-making: first the raw, incomplete observation history is transformed into a compact situational representation, and then that representation drives the selection of acceleration commands.

The perception pipeline is a fusion of two well-established neural components. Current and historical incomplete observations are stacked along the time dimension into a two-dimensional tensor, which a convolutional neural network processes to extract spatial features—the critical geometric signatures of an unfolding engagement, such as the configuration of lines of sight among the three vehicles. A gated recurrent unit then models the temporal structure of those features, using its internal update and reset gates to produce a history tensor that encapsulates the trajectory characteristics of the encounter. This history encoding is what allows the policy to infer which pursuit strategy the adversary appears to be following, something no single-frame observation can reveal. To make training on partial information effective, the team restructured the experience replay buffer so that it stores the stacked observation tensor, the action taken, the history tensor, and the resulting reward, enabling the network to exploit temporal correlations during learning rather than treating each decision as an isolated snapshot.

The decision-making core of AD3QN builds on the dueling double deep Q-network formulation, in which the state value function and the action advantage function are estimated separately. This decomposition reduces the variance of value estimates, a property that proves crucial in multi-strategy environments where the consequences of a maneuver differ sharply depending on the adversary’s current policy. Equally important is the reward design. Rather than rewarding success only at the final moment of the engagement, the researchers constructed a continuous reward function based on potential-field differences computed from the zero-effort miss distance—the miss distance that would result if both vehicles stopped maneuvering. Before the defender–pursuer encounter, the reward landscape encourages the defender to shrink its zero-effort miss distance relative to the pursuer, driving it toward interception. After that encounter, the shaping switches, guiding the target to enlarge its zero-effort miss distance from the pursuer and thereby accomplish evasion. The authors provide a theoretical proof that this reward formulation does not alter the optimal policy, which means the shaping improves training stability without sacrificing optimality.

The numerical validation compared AD3QN against a demanding field of baselines, including Deep Deterministic Policy Gradient, Twin Delayed Deep Deterministic Policy Gradient, Proximal Policy Optimization, and Deep Recurrent Q-Learning. Under the combined stresses of multi-strategy adversaries and incomplete information, these mainstream algorithms all struggled to achieve stable policy optimization, whereas AD3QN converged reliably thanks to its fusion architecture and its explicit handling of observation history. Computational efficiency is a decisive factor for flight implementation, and here the method posted a striking result: a decision frequency of 85 Hz in a simulated single-chip microprocessor environment, roughly 30 percent faster than the DRQN comparison and comfortably within the real-time requirements of spacecraft actuation systems. In representative sample engagements, the defender successfully deflected the pursuer’s trajectory by approximately 20 meters relative to the target—a deviation large enough to convert a lethal interception into a clean miss.

Statistical robustness was assessed through Monte Carlo analysis. Across 1,000 randomized simulations, the proposed method achieved an evasion success rate of 99.7 percent, dramatically outperforming the optimal switching cooperative guidance law at 51.8 percent and various reinforcement learning baselines, which fell below 0.2 percent. The robustness tests are perhaps the most compelling evidence of practical value: even when observation noise was inflated to 40 times the typical level—with range noise of 400 meters and line-of-sight angle noise of 40 milliradians—the method still maintained an evasion success rate of 73.5 percent. Parameter sensitivity studies added further engineering insight. When the pursuer’s maneuvering capability increased, the target’s achievable miss distance fell by roughly 30 percent, but boosting the defender’s agility effectively compensated, improving evasion performance. This trade-off quantifies a design principle for future defensive architectures: investment in the defender’s maneuverability can offset a faster adversary.

The broader significance of the study lies in demonstrating that cooperative, adaptive active defense is achievable under realistic sensing conditions rather than idealized perfect information. By combining a Multi-POMDP problem formulation, a CNN–GRU fusion network for perception under partial observability, dueling double Q-learning for stable value estimation in adversarial settings, and a theoretically sound potential-field reward, the Sun Yat-sen team has assembled a guidance framework that is simultaneously adaptive, robust, and computationally light enough for onboard implementation. For operators of high-value satellites in congested orbital regions, the work suggests a path toward survivability that does not depend on predicting the attacker’s playbook in advance. As orbital confrontation scenarios grow more complex, methods of this kind—able to learn coordinated counter-interception from noisy observations and to withstand sensor degradation far beyond nominal levels—are likely to become a cornerstone of spacecraft autonomy and space security engineering.

Subject of Research: Active defense guidance for spacecraft in three-body pursuit–evasion engagements with incomplete information and multi-strategy adversaries

Article Title: Active defense guidance for spacecraft in multi-strategy engagement with incomplete information

Article References: Active defense guidance for spacecraft in multi-strategy engagement with incomplete information. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: spacecraft guidance, active defense, pursuit-evasion, reinforcement learning, deep Q-network, partial observability, Multi-POMDP, space security, zero-effort miss distance, convolutional neural network, gated recurrent unit, spacecraft survivability

The challenge is formidable. Multiple pursuit spacecraft must cooperatively capture an evasive target while operating under impulsive maneuver constraints and strict fuel budgets, producing an optimal control problem marked by strong nonlinearity and complicated constraints. The researchers note that the tools traditionally brought to bear on such problems each fall short in some way. Classical differential game methods suffer from high computational complexity and poor real-time performance, making them difficult to deploy on hardware with limited processing power. Numerical optimization approaches, meanwhile, are notoriously sensitive to initial guesses and struggle to handle constraints that persist over long durations. Deep reinforcement learning has shown genuine promise in some orbital scenarios, but existing algorithms lack the ability to proactively predict the actions of an opponent confronting them with an unknown evasion strategy, which limits how well the pursuit can be planned. The key question, therefore, became how to predict the evading spacecraft’s actions in multi-to-one scenarios and then optimize the cooperative strategies of the pursuers accordingly.

The team’s answer is a pursuit strategy construction method that fuses an evader action prediction network with the Deep Deterministic Policy Gradient algorithm, a well-established deep reinforcement learning technique for continuous control. The mathematical foundation of the work rests on the Clohessy-Wiltshire equations, the standard linearized description of relative spacecraft motion, which the researchers use to build a model of the multi-to-one impulsive orbital pursuit-evasion game in the Local Vertical-Local Horizontal reference frame. In this modeled world, both sides execute impulsive velocity-increment maneuvers at fixed time intervals, and each side faces constraints on both the size of each individual maneuver and the cumulative total velocity increment it may expend. Multiple pursuers cooperatively close in on the evader through finite sequences of these impulses, and the mission is declared a success the moment the distance between any pursuer and the evader falls below a preset capture threshold. Communication among the pursuers is itself constrained: information can be shared only within a certain proximity, adding a further layer of realism to the problem.

To train the pursuit policy, the researchers adopted a centralized training with decentralized execution framework, an architecture that has become popular in multi-agent reinforcement learning. During training, a single policy network is updated using global state information, but at execution time each pursuer relies only on its own local observations to generate impulsive maneuver commands. Crucially, all pursuers share the same network parameters, meaning that a fleet of chasing spacecraft can behave in a coordinated manner without needing a central commander in the loop during the actual engagement. The observation available to each pursuer is rich: it comprises the relative state with respect to the evader, the states of the two nearest fellow pursuers within communication range, and the predicted future state of the evader at the next time step, produced by the prediction network, for a total of 29 dimensions. The policy network maps this observation to a three-dimensional continuous impulsive velocity-increment command.

The reward structure that shapes the learning process is deliberately simple but effective. It combines a continuous reward for approaching the evader, a large constant reward for a successful capture, and an additional penalty for fuel consumption, so that the pursuing agents learn to be aggressive yet economical. Alongside the policy network, the team trained a separate evader action prediction network through supervised learning. Its input consists of the relative states of the three pursuers closest to the evader, and its output is a prediction of the evader’s velocity increment, effectively giving each pursuer a glimpse of the opponent’s likely next move. Importantly, this prediction network is trained using the global state information and the evader’s true action data collected during the pursuit policy training itself, so no additional data acquisition is required. All of the networks involved, including the policy network, the Q-value network, and the prediction network, are four-layer fully connected architectures in which the first three layers use the ReLU activation function and the output layer employs tanh.

The simulation campaign that validated the approach produced striking results. Over 200,000 training episodes, the reward trends of the pursuer and evader policies ran in generally opposite directions and stabilized after roughly 125,000 episodes, a signature that both sides had reached an approximate game equilibrium. When the researchers compared training curves for the pursuit policy with and without evader action prediction, the incorporation of prediction significantly improved both the convergence speed and the reward values achieved, while the loss curve of the prediction network itself converged after about 1,000 epochs. In test engagements, trajectories produced under three different prediction approaches, the learned prediction network, conventional Kalman filtering, and simply assuming the evader repeats its previous action, all achieved successful capture, but their accuracy differed markedly.

The prediction network proved decisively superior in tracking the evader’s future position. Its prediction error remained essentially below 0.3 kilometers throughout the pursuit-evasion process, with an average of just 0.137 kilometers, and it gradually decreased in the later stage of the engagement as the pursuers closed in. By contrast, the errors of the comparative methods approached 0.6 kilometers in the later stages, more than four times worse. The statistical picture was equally compelling. With three pursuers deployed, the capture success rate of the prediction-augmented method reached 0.95, an improvement of approximately 0.3 over the conventional DDPG approach. The researchers highlight that this advantage effectively compensates for the disadvantage of insufficient pursuer numbers, a point of real practical significance in a domain where every additional spacecraft carries substantial cost.

The study is also candid about the limits of the method. When the evader adopted a non-maneuvering strategy, the capture success rate climbed to 0.99, but performance degraded when the pursuers confronted unseen random or periodic evasion strategies, exposing a generalization bottleneck that is common to learning-based policies. The geometry of the opening position mattered as well: the initial distribution of the pursuers significantly affected the success rate, with an optimal initial distance of approximately 38 kilometers and an optimal enclosure area of approximately 2,300 square kilometers. The authors acknowledge that the approach currently relies on prior action data of the evader, and they outline future work on prediction methods that do not require such data, as well as extension to the even harder multi-to-many pursuit-evasion game problem.

For the wider space community, the significance of this work lies in its demonstration that foresight and learning can be combined to produce autonomous, fuel-aware, and cooperative pursuit behavior under realistic constraints. As activities in orbit multiply, from Mega-constellations to debris removal and on-orbit servicing, the ability of spacecraft to make fast, intelligent decisions in adversarial or uncertain encounters is poised to become a core capability. By showing that a supervised prediction of an opponent’s maneuver can be woven directly into a reinforcement learning pursuit policy, and by quantifying exactly how much that foresight is worth in terms of convergence speed and capture success, the Harbin Institute of Technology team has provided both a working method and a meaningful engineering reference for the autonomous decision-making systems that future space missions will demand.

The reliance on the Clohessy-Wiltshire equations places this work within a long tradition of orbital relative-motion analysis. These linearized equations assume a circular reference orbit and short engagement distances, which keeps the dynamics tractable enough for learning-based methods while remaining a reasonable approximation for proximity operations. The choice of impulsive maneuvers, rather than continuous thrust, mirrors the pulsed thruster firings common on real spacecraft, where each burn is short compared with the orbital period and fuel is measured in velocity increment.

The decentralized execution aspect of the training framework carries practical weight for on-orbit deployment. Because each pursuer generates its maneuver commands from local observations alone, the approach tolerates the intermittent communication links and latency that plague multi-spacecraft operations, where a central coordinator could become a single point of failure. The communication-range constraint built into the model reflects this operational reality.

The comparison against Kalman filtering is also instructive. Kalman filters estimate a target’s state from noisy measurements but do not anticipate deliberate maneuvering, so their predictions degrade precisely when an evader fires its thrusters. A learned predictor trained on maneuver data can instead capture behavioral patterns that a purely dynamical filter cannot represent. The reported average prediction error of 0.137 kilometers, against roughly 0.6 kilometers for the alternatives late in the engagement, quantifies this advantage in terms familiar to guidance engineers.

The acknowledged dependence on prior evader action data remains the principal caveat, since real adversaries may behave in ways no training set anticipated.

Subject of Research: A predictive learning-based pursuit strategy for multiple-to-one orbital pursuit-evasion games among spacecraft.

Article Title: A predictive learning-based pursuit strategy for the multiple-to-one orbital pursuit-evasion game

Article References: A predictive learning-based pursuit strategy for the multiple-to-one orbital pursuit-evasion game. (n.d.). Original publication

Image Credits: AI Generated

DOI: Not provided

Keywords: orbital pursuit-evasion, spacecraft, deep reinforcement learning, DDPG, action prediction, Clohessy-Wiltshire equations, impulsive maneuvers, CTDE, autonomous decision-making, space security, Harbin Institute of Technology, Space Science and Technology

The innovative verification concept leverages the unique environment of Earth’s inner Van Allen radiation belts, where high-energy cosmic protons interact with objects in low Earth orbit (LEO). These GeV-scale protons induce neutron spallation—a process in which high-energy protons collide with atomic nuclei, ejecting neutrons. These neutrons can be detected and analyzed to infer the presence of nuclear materials onboard satellites, offering a direct detection method for thermonuclear weapons in space.

Calculations presented in this feasibility study show that a compact detection system, equivalent in size to a 9U CubeSat, could identify a thermonuclear warhead from a distance of approximately four kilometers. The system would require roughly one week of observation time to accumulate statistically significant neutron signatures that distinguish nuclear weapons from benign satellite materials. This approach provides a promising avenue for non-intrusive, remote verification of treaty compliance in the challenging environment of space.

Current concerns over the potential militarization of space, especially concerning nuclear arms, are driving the urgency to develop reliable verification tools. The lack of transparency and the possibility of covert nuclear deployment threaten the delicate balance of space governance. Given that over 3,000 operational satellites, including critical communication, navigation, and Earth observation assets, occupy LEO, the detonation of a nuclear device there could have catastrophic consequences, destroying vital infrastructure and generating long-lasting debris.

Typically, arms control treaties rely on on-site inspections and satellite imagery for verification, but the OST lacks such provisions, and space-based verification faces technical and political obstacles. The new method circumvents these hurdles by using naturally occurring cosmic ray interactions to effectively “interrogate” satellites. This technique is passive, non-invasive, and can be implemented using relatively small and affordable spacecraft platforms.

While still at the conceptual stage, this research paves the way for future experimental validation and the eventual deployment of dedicated verification constellations. Such a technological leap would enhance trust among spacefaring nations, deter violations, and contribute to preserving the peaceful use of outer space.

The implications of this study extend beyond treaty verification, offering insights into novel space-based neutron detection technologies and advancing our understanding of particle interactions in the magnetosphere. As space becomes an increasingly contested domain, innovations that promote transparency and security will play a crucial role in maintaining international stability.

This study marks a significant step forward in the quest to safeguard space from nuclear proliferation and militarization, demonstrating how cutting-edge physics and space technology can combine to address one of the most pressing challenges of the 21st century.

Subject of Research: Verification methods for the Outer Space Treaty compliance using cosmic proton-induced neutron detection.

Article Title: Verification of the Outer Space Treaty with cosmic protons.

Article References:
Danagoulian, A. Verification of the Outer Space Treaty with cosmic protons. Nature (2026). https://doi.org/10.1038/s41586-026-10783-2

Image Credits: AI Generated

DOI: https://doi.org/10.1038/s41586-026-10783-2