Pengxuan Liu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Research Interests
Pengxuan Liu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Shuang Li
Nanjing University of Aeronautics and Astronautics
2 shared publications - Bin Yang
College of Astronautics, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China
1 shared publication - Bin Yang
Nanjing University of Aeronautics and Astronautics, Nanjing, China
1 shared publication - Jinglang Feng
University of Strathclyde, Glasgow, UK
1 shared publication Xiaoxiang Liu
National Key Laboratory of Space Intelligent Control, Beijing, China
1 shared publication
Latest Publications
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 12182-12195
Pursuit Strategy Design for Orbital Pursuit–Evasion–Defense Games via Costate Guided Reinforcement Learning
The orbital pursuit-evasion-defense (PED) game is a highly challenging engineering problem, as the pursuer must intercept an evader while simultaneously avoiding active defense. To address this challenge, the PED game is decomposed into a bi-level structure, where the pursuit-evasion interaction is modeled as a Nash equilibrium game and the defense-pursuit interaction as a Stackelberg game led by the pursuer. Based on this formulation, a sufficient feasibility criterion for the pursuer is derived under the free-time optimal control framework. Proximal Policy Optimization (PPO) is then employed to learn a feedback control policy that drives the pursuer from arbitrary initial states toward configurations satisfying the criterion. To overcome the slow convergence caused by sparse rewards, a costate alignment mechanism is proposed. The mechanism exploits costate derived structural information to construct dense rewards that encourage consistency between the pursuer's optimal controls in both subgames. Moreover, an accelerated reward evaluation scheme combining fixed-time approximation and warm-start strategies is developed to improve training efficiency. Numerical simulations demonstrate that the proposed method enables the pursuer to successfully complete pursuit tasks under maneuvering capabilities comparable to the defender's, and exhibits superior performance compared to conventional fixed-weight differential game methods.
- 11 June 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems
- Vol. 62 (00189251) , 12182-12195
Pursuit Strategy Design for Orbital Pursuit–Evasion–Defense Games via Costate Guided Reinforcement Learning
The orbital pursuit-evasion-defense (PED) game is a highly challenging engineering problem, as the pursuer must intercept an evader while simultaneously avoiding active defense. To address this challenge, the PED game is decomposed into a bi-level structure, where the pursuit-evasion interaction is modeled as a Nash equilibrium game and the defense-pursuit interaction as a Stackelberg game led by the pursuer. Based on this formulation, a sufficient feasibility criterion for the pursuer is derived under the free-time optimal control framework. Proximal Policy Optimization (PPO) is then employed to learn a feedback control policy that drives the pursuer from arbitrary initial states toward configurations satisfying the criterion. To overcome the slow convergence caused by sparse rewards, a costate alignment mechanism is proposed. The mechanism exploits costate derived structural information to construct dense rewards that encourage consistency between the pursuer's optimal controls in both subgames. Moreover, an accelerated reward evaluation scheme combining fixed-time approximation and warm-start strategies is developed to improve training efficiency. Numerical simulations demonstrate that the proposed method enables the pursuer to successfully complete pursuit tasks under maneuvering capabilities comparable to the defender's, and exhibits superior performance compared to conventional fixed-weight differential game methods.
- Open Access
Two-Stage Pursuit Strategy for Incomplete-Information Impulsive Space Pursuit-Evasion Mission Using Reinforcement Learning
This paper presents a novel and robust two-stage pursuit strategy for the incomplete-information impulsive space pursuit-evasion missions considering the J2 perturbation. The strategy firstly models the impulsive pursuit-evasion game problem into a far-distance rendezvous stage and a close-distance game stage according to the perception range of the evader. For the far-distance rendezvous stage, it is transformed into a rendezvous trajectory optimization problem and a new objective function is proposed to obtain the pursuit trajectory with the optimal terminal pursuit capability. For the close-distance game stage, a closed-loop pursuit approach is proposed using one of the reinforcement learning algorithms, i.e., the deep deterministic policy gradient algorithm, to solve and update the pursuit trajectory for the incomplete-information impulsive pursuit-evasion missions. The feasibility of this novel strategy and its robustness to different initial states of the pursuer and evader and to the evasion strategies are demonstrated for the sun-synchronous orbit pursuit-evasion game scenarios. The results of the Monte Carlo tests show that the successful pursuit ratio of the proposed method is over 91% for all the given scenarios.
Open AccessTwo-Stage Pursuit Strategy for Incomplete-Information Impulsive Space Pursuit-Evasion Mission Using Reinforcement Learning
This paper presents a novel and robust two-stage pursuit strategy for the incomplete-information impulsive space pursuit-evasion missions considering the J2 perturbation. The strategy firstly models the impulsive pursuit-evasion game problem into a far-distance rendezvous stage and a close-distance game stage according to the perception range of the evader. For the far-distance rendezvous stage, it is transformed into a rendezvous trajectory optimization problem and a new objective function is proposed to obtain the pursuit trajectory with the optimal terminal pursuit capability. For the close-distance game stage, a closed-loop pursuit approach is proposed using one of the reinforcement learning algorithms, i.e., the deep deterministic policy gradient algorithm, to solve and update the pursuit trajectory for the incomplete-information impulsive pursuit-evasion missions. The feasibility of this novel strategy and its robustness to different initial states of the pursuer and evader and to the evasion strategies are demonstrated for the sun-synchronous orbit pursuit-evasion game scenarios. The results of the Monte Carlo tests show that the successful pursuit ratio of the proposed method is over 91% for all the given scenarios.