Indirect Optimization of Finite-Thrust Cooperative Rendezvous

Zavoli, Alessandro; Colasurdo, Guido

doi:10.2514/1.g000531

Cited by 9 publications

(7 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This section presents an analytical, suboptimal, four-impulse transfer strategy that gives, in a short computational time, a conservative estimate of the optimal ΔV for a planar, time-fixed, impulsive rendezvous between circular orbits. When the allowed travel time is sufficiently large, this strategy fairly approximates the performance of the optimal solution [44]. Furthermore, with respect to other heuristics adopted in similar studies [45], the proposed approach represents a real, feasible, mission scheme.…”

Section: Two-level Optimization Approachmentioning

confidence: 88%

Evolutionary Optimization of Multirendezvous Impulsive Trajectories

Federici

Zavoli

Colasurdo

2021

International Journal of Aerospace Engineering

Self Cite

View full text Add to dashboard Cite

This paper investigates the use of evolutionary algorithms for the optimization of time-constrained impulsive multirendezvous missions. The aim is to find the minimum- Δ V trajectory that allows a chaser spacecraft to perform, in a prescribed mission time, a complete tour of a set of targets, such as space debris or artificial satellites, which move on the same orbital plane at slightly different altitudes. For this purpose, a two-level design approach is pursued. First, an outer-level combinatorial problem is defined, dealing with the simultaneous optimization of the sequence of targets and the rendezvous epochs. The suggested approach is first tested by assuming that all transfer legs last exactly the same amount of time; then, the time domain is discretized over a finer grid, allowing a more appropriate sizing of the time window allocated for each leg. The outer-level problem is solved by an in-house genetic algorithm, which features an effective permutation-preserving solution encoding. A simple, but fairly accurate, heuristic, based on a suboptimal four-impulse analytic solution of the single-target rendezvous problem, is used when solving the combinatorial problem for a fast guess at the transfer cost, given the departure and arrival epochs. The outer-level problem solution is used to define an inner-level NLP problem, concerning the optimization of each body-to-body transfer leg. In this phase, the encounter times are further refined. The inner-level problem is tackled through an in-house multipopulation self-adaptive differential evolution algorithm. Numerical results for case studies including up to 20 targets with different time grids are presented.

show abstract

Section: Two-level Optimization Approachmentioning

confidence: 88%

Evolutionary Optimization of Multirendezvous Impulsive Trajectories

Federici

Zavoli

Colasurdo

2021

International Journal of Aerospace Engineering

Self Cite

View full text Add to dashboard Cite

show abstract

“…This section presents an analytical, sub-optimal, four-impulse strategy to assess the ∆V of a trajectory leg, for any assigned pair of departure and arrival bodies that fly on circular orbits, which fairly approximates the behavior of the time-fixed optimal solution, 23,24 when the allowed travel time is sufficiently large. Assuming that departure and arrival orbits are not too far apart, the minimum-∆V solution is represented by a Hohmann transfer, possibly preceded and/or followed by coasting arcs on the departure and/or arrival orbit which allow for the correct phasing required by this kind of maneuver.…”

Section: Cost Estimate For a Single Rendezvous Legmentioning

confidence: 99%

A Time-Dependent TSP Formulation for the Design of an Active Debris Removal Mission using Simulated Annealing

Federici¹,

Zavoli²,

Colasurdo³

2019

Preprint

Self Cite

View full text Add to dashboard Cite

This paper proposes a formulation of the Active Debris Removal (ADR) Mission Design problem as a modified Time-Dependent Traveling Salesman Problem (TDTSP). The TDTSP is a well-known combinatorial optimization problem, whose solution is the cheapest monocyclic tour connecting a number of non-stationary cities in a map. The problem is tackled with an optimization procedure based on Simulated Annealing, that efficiently exploits a natural encoding and a careful choice of mutation operators. The developed algorithm is used to simultaneously optimize the targets sequence and the rendezvous epochs of an impulsive ADR mission. Numerical results are presented for sets comprising up to 20 targets.

show abstract

“…Both indirect and direct methods have been proposed for the solution of the minimum-fuel finitethrust time-constrained rendezvous problem. 1,2 Indirect methods 3 are characterized by a high numerical accuracy and require a small computational effort. However, the optimal mission structure, i.e., the sequence of burn and coast arcs, is usually unknown, and this poses a severe challenge on the capability of indirect methods to routinely, rapidly, and automatically solve the problem at hand 4 (partially mitigated by the ongoing development of control regularization and continuation techniques).…”

Section: Introductionmentioning

confidence: 99%

“…In order to show the effectiveness of the approach, numerical results for several cases are presented and compared with the solutions provided by an indirect method. 2 In particular, the solver capability of finding the best solution in the presence of different families of optimal solutions, as detected by the indirect method, is discussed.…”

Section: Introductionmentioning

confidence: 99%

A Convex Optimization Approach for Finite-Thrust Time-Constrained Cooperative Rendezvous

Benedikter,

Zavoli,

Colasurdo

2019

Preprint

Self Cite

View full text Add to dashboard Cite

This paper presents a convex approach to the optimization of a cooperative rendezvous, that is, the problem of two distant spacecraft that simultaneously operate to get closer. Convex programming guarantees convergence towards the optimal solution in a limited, short, time by using highly efficient numerical algorithms. A combination of lossless and successive convexification techniques is adopted to handle the nonconvexities of the original problem. Specifically, a convenient change of variables and a constraint relaxation are performed, while a successive linearization of the equations of motion is employed to handle the nonlinear dynamics. A filtering technique concerning the recursive update of the reference solution is proposed in order to enhance the algorithm robustness. Numerical results are presented and compared with those provided by an indirect method.

show abstract

Indirect Optimization of Finite-Thrust Cooperative Rendezvous

Cited by 9 publications

References 15 publications

Evolutionary Optimization of Multirendezvous Impulsive Trajectories

Evolutionary Optimization of Multirendezvous Impulsive Trajectories

A Time-Dependent TSP Formulation for the Design of an Active Debris Removal Mission using Simulated Annealing

A Convex Optimization Approach for Finite-Thrust Time-Constrained Cooperative Rendezvous

Contact Info

Product

Resources

About