Minimum-fuel Spacecraft Rendezvous based on Sparsity Promoting Optimization
In this paper, we consider the classical spacecraft rendezvous problem in which the so-called active spacecraft has to approach the target spacecraft which is moving in an elliptical orbit around a planet by using the minimum possible amount of fuel. Instead of using standard convex optimization tools which can be computationally expensive, we use modified versions of the Iteratively Reweighted Least Squares (IRLS) algorithm from compressive sensing to compute sparse optimal control sequences which minimize the fuel consumption for both thrust vectoring and orthogonal vectoring (active) spacecraft. Numerical simulations are performed to verify the efficacy of our approach.
PDF AbstractTasks
Datasets
Add Datasets
introduced or used in this paper
Results from the Paper
Submit
results from this paper
to get state-of-the-art GitHub badges and help the
community compare results to other papers.
