Abstract
In this paper, the optimal fuel impulsive time-fixed rendezvous problem is considered. Under some simplifying assumptions, this problem may be recast as a non convex polynomial optimization problem. A numerical solving algorithm using a convex relaxation based on sum-of-squares representation of positive polynomials is proposed. Numerical results are evaluated on the PRISMA technology in-orbit formation flying testbed mission.
Keywords
Testbed
Rendezvous
Convex optimization
Polynomial
Relaxation (psychology)
Mathematical optimization
Regular polygon
Optimization problem
Representation (politics)
Mathematics
Computer science
Mathematical analysis
Engineering
Geometry
Subject Areas
Spacecraft Dynamics and Control
·Aerospace Engineering ·Physical Sciences
Aerospace Engineering and Control Systems
·Aerospace Engineering ·Physical Sciences
Gas Dynamics and Kinetic Theory
·Applied Mathematics ·Physical Sciences
Citations by Year
2016: 1
2023: 1
OpenAlex SDG Match
SDGs auto-classified by OpenAlex (score ≥ 0.4 shown).
Affordable and clean energy 77%
Loading…
Loading…