Pursuit-evasion game switching strategies for spacecraft with incomplete-information

Tang, Xuhua; Ye, Dong; Huang, Lei; Sun, Zhiyong; Sun, Jianye

doi:10.1016/j.ast.2021.107112

Cited by 26 publications

(12 citation statements)

References 36 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Since Isaac [6], the differential game has been used to formulate the pursuit problem, which looks for saddle-point strategies and models the dynamics in games with differential equations [7,8,9,10,23]. However, most such works are about twoagent zero-sum games.…”

Section: Related Workmentioning

confidence: 99%

“…In warfare, agents may be any confrontational devices, such as fighters, bombers, and missiles [6]. In aerospace, one goal is to clean up space debris, inactive satellites, and military vehicles to ensure the safety of active space assets or aerial vehicles [7,8,9,10]. The searchers, pursuers, targets, or evaders in the pursuit may also represent players in a football game, lions and humans in a bounded arena [11], searchers and lost spelunkers in a cave [12], cops and robbers in a city [13,14,15], pollutants and cleaning robots in the environment [16], creatures in biological systems [1], etc.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Toward multi-target self-organizing pursuit in a partially observable Markov game

Sun¹,

Chang²,

Lyu³

et al. 2022

Preprint

View full text Add to dashboard Cite

The multiple-target self-organizing pursuit (SOP) problem has wide applications and has been considered a challenging selforganization game for distributed systems, in which intelligent agents cooperatively pursue multiple dynamic targets with partial observations. This work proposes a framework for decentralized multi-agent systems to improve intelligent agents' search and pursuit capabilities. We model a self-organizing system as a partially observable Markov game (POMG) with the features of decentralization, partial observation, and noncommunication. The proposed distributed algorithm-fuzzy self-organizing cooperative coevolution (FSC2) is then leveraged to resolve the three challenges in multi-target SOP: distributed self-organizing search (SOS), distributed task allocation, and distributed single-target pursuit. FSC2 includes a coordinated multi-agent deep reinforcement learning method that enables homogeneous agents to learn natural SOS patterns. Additionally, we propose a fuzzy-based distributed task allocation method, which locally decomposes multi-target SOP into several single-target pursuit problems. The cooperative coevolution principle is employed to coordinate distributed pursuers for each single-target pursuit problem. Therefore, the uncertainties of inherent partial observation and distributed decision-making in the POMG can be alleviated. The experimental results demonstrate that distributed noncommunicating multi-agent coordination with partial observations in all three subtasks are effective, and 2048 FSC2 agents can perform efficient multi-target SOP with an almost 100% capture rate.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Toward multi-target self-organizing pursuit in a partially observable Markov game

Sun¹,

Chang²,

Lyu³

et al. 2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Therefore, detecting or maintaining the satellites in these constellations has emerged as an essential research topic. The flyby multi-target problem [7,8], particularly the flyby non-coplanar multi-target problem [9,10], was investigated to some extent, but most solutions require numerous orbit maneuvers and are incredibly dependent on the ground station [11]. Minimizing the number of orbital maneuvers can effectively decrease the mission constraint, and thus, enhance the efficacy of each orbital maneuver; therefore, it is crucial to study the single-impulse flyby co-orbital multi-target problem.…”

Section: Introductionmentioning

confidence: 99%

Numerical Solution for the Single-Impulse Flyby Co-Orbital Spacecraft Problem

Su¹,

Dong²,

Liu³

et al. 2022

Aerospace

View full text Add to dashboard Cite

The traversal inspection of satellites in satellite constellations or geosynchronous orbits has been a focus of research. A large number of variable orbit requirements in the “single-to-single” mode severely affects the efficiency of inspections. To address this problem, this study investigated the problem of a single-impulse flyby co-orbiting two spacecraft and proposed a derivative-free numerical solution method that used the geometric relationship between the two intersections of the target and transfer orbits of the flyby problem in order to transform them into a nonlinear equation in a single variable for a given impulse time. The validity of the proposed method was verified using numerical examples. While the Lambert problem is one of the bases for solving the variable orbit problem, on-star intelligent control also raises the requirements for speed. To address this problem, this study also investigated the Lambert problem in a single-impulse flyby co-orbiting two spacecraft and determined the iterative initial value by constructing a quadratic interpolation equation between the inverse of the transfer time and the vertical component of the eccentric vector, the derivative-free quadratic interpolation cut-off method was proposed. Using 100,000 random tests showed that computational efficiency was improved by more than one order of magnitude compared with commonly used methods, with a calculation error of less than 10−6.

show abstract

“…Pursuit-evasion (PE) games have attracted a lot of interest in recent years, showing the wide applicability in modeling many adversarial problems, such as predator-prey problems in biology [1], [2], and aerial combat in military [3], [4]. In classical one-pursuer-one-evader games [5], the pursuer tries to capture the evader as soon as possible while the evader thinks the contrary.…”

Section: Introductionmentioning

confidence: 99%

Pursuit-evasion differential games of players with different speeds in spaces of different dimensions

Li¹,

Wang²,

Xie³

2022

Preprint

View full text Add to dashboard Cite

We study pursuit-evasion differential games between a faster pursuer moving in 3D space and an evader moving in a plane. We first extend the well-known Apollonius circle to 3D space, by which we construct the isochron for the considered two players. Then both cases with and without a static target are considered and the corresponding optimal strategies are derived using the concept of isochron. In order to guarantee the optimality of the proposed strategies, the value functions are given and are further proved to be the solution of Hamilton-Jacobi-Isaacs equation. Simulations with comparison between the proposed strategies and other classical strategies are carried out and the results show the optimality of the proposed strategies.

show abstract

Pursuit-evasion game switching strategies for spacecraft with incomplete-information

Cited by 26 publications

References 36 publications

Toward multi-target self-organizing pursuit in a partially observable Markov game

Toward multi-target self-organizing pursuit in a partially observable Markov game

Numerical Solution for the Single-Impulse Flyby Co-Orbital Spacecraft Problem

Pursuit-evasion differential games of players with different speeds in spaces of different dimensions

Contact Info

Product

Resources

About