2018
DOI: 10.2322/tjsass.61.201
|View full text |Cite
|
Sign up to set email alerts
|

Ant Colony Optimization-based Design of Multiple-target Active Debris Removal Mission

Abstract: The paper considers the ant colony optimization (ACO) methodology for designing an active debris removal mission. The goal is to optimize a sequence of transfers using an orbital transfer vehicle to rendezvous with multiple pieces of debris for the purpose of removal. The methodology consists of two phases: the first phase obtains an optimal removal sequence, and the second phase is related to transfer trajectory optimization. During the sequence planning process, a refined approximation is proposed to estimat… 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

2021
2021
2024
2024

Publication Types

Select...
7

Relationship

0
7

Authors

Journals

citations
Cited by 9 publications
(4 citation statements)
references
References 16 publications
0
4
0
Order By: Relevance
“…Each element of the feasible solution and its probability constitute the discrete probability distribution of the ant sampling, so as to select the elements to be added to the current solution space C ij is the j-th element of the solution constructed by ant i, which is heuristic information and is generally chosen as the reciprocal of the objective function. The pheromone τ ij is updated as follows in Equation ( 24) [36]:…”
Section: Multiple Debris Selectionmentioning
confidence: 99%
“…Each element of the feasible solution and its probability constitute the discrete probability distribution of the ant sampling, so as to select the elements to be added to the current solution space C ij is the j-th element of the solution constructed by ant i, which is heuristic information and is generally chosen as the reciprocal of the objective function. The pheromone τ ij is updated as follows in Equation ( 24) [36]:…”
Section: Multiple Debris Selectionmentioning
confidence: 99%
“…When searching for the best path and rendezvous times of each target in a multi-target sequence, the global optimization process needs to frequently evaluate the velocity increments of the transfers between the different targets with different flight times, which is extremely time-consuming. Most existing studies have employed different forms of approximation to improve the efficiency [5][6][7][8]11]. However, such a problem still lacks a solution that is fast enough for global optimization.…”
Section: Problem Description Of Orbit Rendezvousmentioning
confidence: 99%
“…To obtain efficient methods that quickly calculate the optimal velocity increment, several studies have focused on analytical methods based on dynamic approximations. A simple strategy is to calculate the orbit differences between the initial and target orbits and add them to the velocity increment separately [5,6]. It is fast enough, but cannot deal with the coupling terms between the different components of the orbit elements.…”
Section: Introductionmentioning
confidence: 99%
“…Most of these studies focus on long-term or time-free ADR missions, typically aimed at deorbiting the target debris at a rate of three to ten per year [4,5]. A typical mission strategy consists in exploiting the J 2 orbital perturbation for the alignment of the orbital planes of consecutive targets before starting the rendezvous maneuver in order to reduce the total mission cost [6,7], at the expense of a longer flight time. Conversely, when time-constrained or time-fixed missions are considered, the removal sequence and rendezvous epochs of the ADR mission must be optimized simultaneously, making the problem more complex to solve.…”
Section: Introductionmentioning
confidence: 99%