Constructive Approximate Nash Equilibrium for In-Orbit Target Enclosing with Collision Avoidance and Full-state Constraint via Nonzero-Sum Differential Games

The problem of in-orbit cooperative target enclosing involving N thrust-limited satellites under collision avoidance and maneuver amplitude constraints is studied. In order to find global optimal trajectories for target enclosing task with all constraints above, by integrating the collision threat and maneuver boundaries into a novel nonlinear cost functional, the studied target enclosing problem is described as a nonlinear nonzero-sum differential game. Further, to avoid iterative calculations caused by traditional nonlinear-game-solving methods, an approximate solution which can be constructed directly is designed. Then the approximate Nash equilibrium strategies can be educed by the constructive approximate solution for the proposed nonzero-sum game. Analysis shows that the proposed control strategies can asymptotically approach the exact one and can ensure a zero-error tracking of the enclosing configuration. Simulation results illustrate lower time costs and better enclosing accuracy while the collision avoidance and maneuver amplitude constraints are satisfied simultaneously.

Authors

Institutions

Publication Details

Journal
Guidance Navigation and Control
Published
2024-08-31
DOI
https://doi.org/10.1142/s2737480724410085
Citations
2
Primary Topic
Distributed Control Multi-Agent Systems
Type
article
Field-Weighted Citation Impact
0.70

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Constructive Approximate Nash Equilibrium for In-Orbit Target Enclosing with Collision Avoidance and Full-state Constraint via Nonzero-Sum Differential Games

Bosong Wei, Xiaokui Yue, Zongcheng Liu, Zhiwei Hao
2 citations
Guidance Navigation and Control
Distributed Control Multi-Agent Systems
0.70
article

Constructive Approximate Nash Equilibrium for In-Orbit Target Enclosing with Collision Avoidance and Full-state Constraint via Nonzero-Sum Differential Games

Bosong Wei, Xiaokui Yue, Zongcheng Liu, Zhiwei Hao
article en
2 citations

Abstract

The problem of in-orbit cooperative target enclosing involving N thrust-limited satellites under collision avoidance and maneuver amplitude constraints is studied. In order to find global optimal trajectories for target enclosing task with all constraints above, by integrating the collision threat and maneuver boundaries into a novel nonlinear cost functional, the studied target enclosing problem is described as a nonlinear nonzero-sum differential game. Further, to avoid iterative calculations caused by traditional nonlinear-game-solving methods, an approximate solution which can be constructed directly is designed. Then the approximate Nash equilibrium strategies can be educed by the constructive approximate solution for the proposed nonzero-sum game. Analysis shows that the proposed control strategies can asymptotically approach the exact one and can ensure a zero-error tracking of the enclosing configuration. Simulation results illustrate lower time costs and better enclosing accuracy while the collision avoidance and maneuver amplitude constraints are satisfied simultaneously.

Guidance Navigation and ControlVol. 04(03)
Northwestern Polytechnical University (CN), Air Force Engineering University (CN), PLA Air Force Aviation University (CN)
National Natural Science Foundation of China, Key Technologies Research and Development Program
Climate action
Openalex Percentile: Top 28%
Distributed Control Multi-Agent Systems
0.70
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.