Fast Trajectory Optimization via Successive Convexification for Spacecraft Rendezvous with Integer Constraints

Malyuta, Danylo; Reynolds, Taylor P.; Szmuk, Michael; Açıkmeşe, Behçet; Mesbahi, Mehran

doi:10.2514/6.2020-0616

Cited by 24 publications

(29 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the worst case, however, MIP runtime remains exponential in n ζ . This is a large hindrance to onboard implementation, since space vehicle hardware is often not able to support the large MIP computational demand (Malyuta et al, 2020;Malyuta and Açıkmeşe, 2020b,a).…”

Section: Mixed-integer Programmingmentioning

confidence: 99%

Advances in Trajectory Optimization for Space Vehicle Control

Malyuta¹,

Yu²,

Elango³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

Space mission design places a premium on cost and operational efficiency. The search for new science and life beyond Earth calls for spacecraft that can deliver scientific payloads to geologically rich yet hazardous landing sites. At the same time, the last four decades of optimization research have put a suite of powerful optimization tools at the fingertips of the controls engineer. As we enter the new decade, optimization theory, algorithms, and software tooling have reached a critical mass to start seeing serious application in space vehicle guidance and control systems. This survey paper provides a detailed overview of recent advances, successes, and promising directions for optimization-based space vehicle control. The considered applications include planetary landing, rendezvous and proximity operations, small body landing, constrained attitude reorientation, endo-atmospheric flight including ascent and reentry, and orbit transfer and injection. The primary focus is on the last ten years of progress, which have seen a veritable rise in the number of applications using three core technologies: lossless convexification, sequential convex programming, and model predictive control. The reader will come away with a well-rounded understanding of the state-of-the-art in each space vehicle control application, and will be well positioned to tackle important current open problems using convex optimization as a core technology.

show abstract

Section: Mixed-integer Programmingmentioning

confidence: 99%

Advances in Trajectory Optimization for Space Vehicle Control

Malyuta¹,

Yu²,

Elango³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

“…The obtained results are reported in Figs. 6-8 for different values of γ in the range γ ∈ [1,15]. Figure 6 shows the value function J * N , evaluated at the horizon length returned by the three compared methods.…”

Section: Search Algorithm Validationmentioning

confidence: 99%

“…This is one of the salient limitations of SCP, and an intensive research is ongoing to overcome this obstacle (see, e.g., [14]). At present, SCP provides an effective and flexible way to perform rapid trajectory optimization trade studies, see, e.g., [15].…”

Section: Introductionmentioning

confidence: 99%

Variable-Horizon Guidance for Autonomous Rendezvous and Docking to a Tumbling Target

Leomanni¹,

Quartullo²,

Bianchini³

et al. 2021

Preprint

View full text Add to dashboard Cite

In this paper, the trajectory planning problem for autonomous rendezvous and docking between a controlled spacecraft and a tumbling target is addressed. The use of a variable planning horizon is proposed in order to construct an appropriate maneuver plan, within an optimization-based framework. The involved optimization problem is nonconvex and features nonlinear constraints. The main contribution is to show that such problem can be tackled effectively by solving a finite number of linear programs. To this aim, a specifically conceived horizon search algorithm is employed in combination with a polytopic constraint approximation technique. The resulting guidance scheme provides the ability to identify favourable docking configurations, by exploiting the time-varying nature of the optimization problem endpoint. Simulation results involving the capture of the nonoperational En-viSat spacecraft indicate that the method is able to generate optimal trajectories at a fraction of the computational cost incurred by a state-of-the-art nonlinear solver.

show abstract

“…Furthermore, if the main non-convex optimization heuristic relies on SCP, then this computational cost is compounded by the iterative nature of SCP approach which would require solving a MICP multiple times for each trajectory. To overcome some of these challenges, the authors of [29], reformulate the mixed-integer problem in terms of state-triggered constraints that can be easily introduced in an SCP loop.…”

Section: B Related Workmentioning

confidence: 99%

Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming

Preda¹,

Hyslop²,

Bennani³

2021

Preprint

View full text Add to dashboard Cite

This paper introduces an algorithm to perform optimal reorientation of a spacecraft during a high speed flyby mission that maximizes the time a certain target is kept within the field of view of scientific instruments. The method directly handles the nonlinear dynamics of the spacecraft, sun exclusion constraint, torque and momentum limits on the reaction wheels as well as potential faults in these actuators. A sequential convex programming approach was used to reformulate non-convex pointing objectives and other constraints in terms of a series of novel convex cardinality minimization problems. These subproblems were then efficiently solved even on limited hardware resources using convex programming solvers implementing second-order conic constraints. The proposed method was applied to a scenario that involved maximizing the science time for the upcoming Comet Interceptor flyby mission developed by the European Space Agency. Extensive simulation results demonstrate the capability of the approach to generate viable trajectories even in the presence of reaction wheel failures or prior dust particle impacts.

show abstract

Fast Trajectory Optimization via Successive Convexification for Spacecraft Rendezvous with Integer Constraints

Cited by 24 publications

References 35 publications

Advances in Trajectory Optimization for Space Vehicle Control

Advances in Trajectory Optimization for Space Vehicle Control

Variable-Horizon Guidance for Autonomous Rendezvous and Docking to a Tumbling Target

Optimal Science-time Reorientation Policy for the Comet Interceptor Flyby via Sequential Convex Programming

Contact Info

Product

Resources

About