skip to main content


This content will become publicly available on February 21, 2025

Title: Control Co-Design Optimization of Spacecraft Trajectory and System for Interplanetary Missions
This paper develops a control co-design (CCD) framework to simultaneously optimize the spacecraft’s trajectory and onboard system (rocket engine) and quantify its benefit. An open-loop optimal control problem (two-finite burn Mars missions) is used as the benchmark, and the engine design considers the combustion equilibrium and nozzle geometry. The objective function is the fuel burn. The design variables are the trajectory control parameters (such as burn times, burn directions, and time of flight), initial fuel mass, and engine design parameters (such as throat area, mixture ratio, and chamber pressure). The constraints include the final velocities and positions of spacecraft. Single-point optimizations are conducted for three departure dates in May, July, and September 2020. A multipoint optimization is also performed to balance the engine performance for these dates with 49 design variables and 20 constraints. It is found that the CCD optimizations exhibit 22–28% more fuel burn reduction than the trajectory-only optimization with fixed engine parameters and 16–20% more fuel burn reduction than the decoupled trajectory-engine optimization. The proposed CCD optimization framework can be extended to more spacecraft trajectory control parameters and onboard systems and has the potential to design more efficient spacecraft missions.  more » « less
Award ID(s):
2223676
NSF-PAR ID:
10491700
Author(s) / Creator(s):
; ;
Publisher / Repository:
AIAA
Date Published:
Journal Name:
Journal of Spacecraft and Rockets
ISSN:
0022-4650
Page Range / eLocation ID:
1 to 14
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. A parameter governor-based control scheme is developed to enforce various constraints, such as the Line of Sight (LoS) cone angle, the thrust limit, and the relative approach velocity during rendezvous missions in a near rectilinear halo orbit (NRHO) in the Earth-Moon system. The parameter governor is an add-on scheme to the nominal closed-loop system, which dynamically adjusts controller parameters in order to enforce the constraints. For the application to the rendezvous mission, we utilize the Time Shift Governor (TSG) which time shifts the target trajectory commanded to the Deputy spacecraft controller. The time shift is gradually reduced to zero so that the virtual target trajectory gradually converges to the Chief spacecraft trajectory as time evolves, and the rendezvous mission can be accomplished. Simulation results are reported that demonstrate the effectiveness of the proposed control scheme. 
    more » « less
  2. This paper presents a parameter governor-based control approach to constrained spacecraft rendezvous and docking (RVD) in the setting of the Two-Body problem with gravitational perturbations. An add-on to the nominal closed-loop system, the Time Shift Governor (TSG) is developed, which provides a time-shifted Chief spacecraft trajectory as a target reference for the Deputy spacecraft, and enforces various constraints during RVD missions, such as Line of Sight cone constraints, total magnitude of thrust limit, relative velocity constraint, and exponential convergence to the target during RVD missions. As the time shift diminishes to zero, the virtual target incrementally aligns with the Chief spacecraft over time. The RVD mission is completed when the Deputy spacecraft achieves the virtual target with zero time shift, which corresponds to the Chief spacecraft. Simulation results for the RVD mission in an elliptic orbit around the Earth are presented to validate the proposed control strategy. 
    more » « less
  3. Intelligent cruise control with traffic preview introduces a potential to adjust the vehicle velocity and improve fuel consumption and emissions. This paper presents trade-offs observed during velocity trajectory optimizations when the objective function varies from fuel-based targets to emissions-based. The scenarios studied consider velocity optimization while following a hypothetical leader executing the federal test procedure (FTP) velocity profile with distance constraint, instead of the classical legislated velocity constraint, to enable the flexibility in optimizing the velocity trajectory. The vehicle model including longitudinal dynamics, fuel consumption and tailpipe NOx emissions is developed for a medium-duty truck with a diesel engine and verified over the FTP. Then, dynamic programming is applied on a reduced-order model to solve the constraint trajectory optimization problem and calculate an optimal vehicle velocity profile over the temperature stabilized phase (Bag 2) of the FTP. Results show 59% less tailpipe NOx emissions with an emission-optimized drive cycle but with 17% more fuel consumption compared to a non-optimized baseline. Whereas, a fuel-optimized cycle improves the fuel efficiency by 18% but with doubled tailpipe NOx emissions. Moreover, it is shown that for a diesel powertrain, including the aftertreatment system efficiency associated with the thermal dynamics is crucial to optimize the tailpipe NOx emissions and can not be ignored for problem simplification. 
    more » « less
  4. We develop an optimization-based framework for joint real-time trajectory planning and feedback control of feedback-linearizable systems. To achieve this goal, we define a target trajectory as the optimal solution of a time-varying optimization problem. In general, however, such trajectory may not be feasible due to , e.g., nonholonomic constraints. To solve this problem, we design a control law that generates feasible trajectories that asymptotically converge to the target trajectory. More precisely, for systems that are (dynamic) full-state linearizable, the proposed control law implicitly transforms the nonlinear system into an optimization algorithm of sufficiently high order. We prove global exponential convergence to the target trajectory for both the optimization algorithm and the original system. We illustrate the effectiveness of our proposed method on multi-target or multi-agent tracking problems with constraints. 
    more » « less
  5. The design of cyber-physical systems (CPSs) requires methods and tools that can efficiently reason about the interaction between discrete models, e.g., representing the behaviors of ``cyber'' components, and continuous models of physical processes. Boolean methods such as satisfiability (SAT) solving are successful in tackling large combinatorial search problems for the design and verification of hardware and software components. On the other hand, problems in control, communications, signal processing, and machine learning often rely on convex programming as a powerful solution engine. However, despite their strengths, neither approach would work in isolation for CPSs. In this paper, we present a new satisfiability modulo convex programming (SMC) framework that integrates SAT solving and convex optimization to efficiently reason about Boolean and convex constraints at the same time. We exploit the properties of a class of logic formulas over Boolean and nonlinear real predicates, termed monotone satisfiability modulo convex formulas, whose satisfiability can be checked via a finite number of convex programs. Following the lazy satisfiability modulo theory (SMT) paradigm, we develop a new decision procedure for monotone SMC formulas, which coordinates SAT solving and convex programming to provide a satisfying assignment or determine that the formula is unsatisfiable. A key step in our coordination scheme is the efficient generation of succinct infeasibility proofs for inconsistent constraints that can support conflict-driven learning and accelerate the search. We demonstrate our approach on different CPS design problems, including spacecraft docking mission control, robotic motion planning, and secure state estimation. We show that SMC can handle more complex problem instances than state-of-the-art alternative techniques based on SMT solving and mixed integer convex programming. 
    more » « less