z-logo
open-access-imgOpen Access
Optimization for Far-distance Cooperative Rendezvous with Multiple Direction-fixed Thrusts
Author(s) -
Fei Ren
Publication year - 2021
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/2068/1/012021
Subject(s) - rendezvous , sequential quadratic programming , optimal control , mathematical optimization , thrust , homotopy , particle swarm optimization , fuel efficiency , mathematics , convergence (economics) , control theory (sociology) , computer science , quadratic programming , spacecraft , engineering , control (management) , artificial intelligence , economic growth , pure mathematics , economics , aerospace engineering
The continuous-thrust far-distance cooperative rendezvous problem between two spacecraft is investigated. The indirect optimization method, based on Pontryagin’s maximum principle (PMP), is applied to optimize fuel consumption. To overcome the difficulty in nonsmooth integration caused by the bang-bang control, the homotopy method is adopted to solve the fuel-optimal problem from a related energy-optimal problem. The quantum-behaved particle swarm optimization (QPSO) algorithm is used to obtain the energy-optimal solutions. The energy-optimal solutions are used as the initial values for the homotopic procedure to obtain the fuel-optimal solutions and optimal bang-bang control law. A hybrid algorithm combined homotopy method and sequential quadratic programming (SQP) algorithm is proposed. This hybrid algorithm can effectively obtain feasible optimal solutions even though the indirect optimization method exhibits a narrow convergence domain. Simulations of high-thrust and low-thrust rendezvous problems are provided and the proposed hybrid algorithm is verified. Moreover, the necessity of radial thrust is investigated.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here