2023
DOI: 10.3390/math11061419
|View full text |Cite
|
Sign up to set email alerts
|

Active Debris Removal Mission Planning Method Based on Machine Learning

Abstract: To prevent the proliferation of space debris and stabilize the space environment, active debris removal (ADR) has increasingly gained public concern. Considering the complexity of space operations and the viability of ADR missions, it would be necessary to schedule the ADR process in order to remove as much debris as possible. This paper presents an active debris removal mission planning problem, devoted to generate an optimal debris removal plan to guide the mission process. According to the problem character… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2023
2023
2025
2025

Publication Types

Select...
3
1
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(4 citation statements)
references
References 52 publications
0
4
0
Order By: Relevance
“…However, it is important to acknowledge the study's limitations, including potential challenges in accurately representing complex orbital debris distributions with neural networks. Another study (Xu et al, 2023) conducted an analysis of active debris removal (ADR) mission planning, aiming to generate optimal debris removal plans. They established a two-layer time-dependent traveling salesman problem (TSP) mathematical model to address debris removal sequence and transfer trajectory planning.…”
Section: Related Workmentioning
confidence: 99%
“…However, it is important to acknowledge the study's limitations, including potential challenges in accurately representing complex orbital debris distributions with neural networks. Another study (Xu et al, 2023) conducted an analysis of active debris removal (ADR) mission planning, aiming to generate optimal debris removal plans. They established a two-layer time-dependent traveling salesman problem (TSP) mathematical model to address debris removal sequence and transfer trajectory planning.…”
Section: Related Workmentioning
confidence: 99%
“…The energy function to take the shortest path and satisfy all constraints [45,46] is shown in Equation (25). Where V xi denotes that the xth city is visited on the ith order and d xy is the distance between cities x and y.…”
Section: The Effect Of Blue Noise On the Optimization Power Of Neural...mentioning
confidence: 99%
“…In this paper, we use 10 cities after classical normalization, with the following coordinates: (0. shortest loop required to visit each city once and return to the starting city, given the distance between two cities. The energy function to take the shortest path and satisfy all constraints [45,46] is shown in Equation (25). Where Vxi denotes that the xth city is visited on the ith order and dxy is the distance between cities x and y.…”
Section: The Effect Of Blue Noise On the Optimization Power Of Neural...mentioning
confidence: 99%
See 1 more Smart Citation