skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.


Title: Command Governors Based on Bilevel Optimization for Constrained Spacecraft Orbital Transfer
The use of Command governors (CGs) to enforce pointwise-in-time state and control constraints by minimally altering reference commands to closed-loop systems has been proposed for a range of aerospace applications. In this paper, we revisit the design of the CG and describe approaches to its implementation based directly on a bilevel (inner loop + outer loop) optimization problem in the formulation of CG. Such approaches do not require offline construction and storage of constraint admissible sets nor the use of online trajectory prediction, and hence can be beneficial in situations when the reference command is high-dimensional and constraints are nonlinear and change with time or are reconfigured online. In the case of linear systems with linear constraints, or in the case of nonlinear systems with linear constraints for which a quadratic Lyapunov function is available, the inner loop optimization problem is explicitly solvable and the bilevel optimization reduces to a single stage optimization. In other cases, a reformulation of the bilevel optimization problem into a mathematical programming problem with equilibrium constraints (MPEC) can be used to arrive at a single stage optimization problem. By applying the bilevel optimization-based CG to the classical low thrust orbital transfer problem, in which the dynamics are represented by Gauss-Variational Equations (GVEs) and the nominal controller is of Lyapunov type, we demonstrate that constraints, such as on the radius of periapsis to avoid planetary collision, on the osculating orbit eccentricity and on the thrust magnitude can be handled. Furthermore, in this case the parameters of the Lyapunov function can be simultaneously optimized online resulting in faster maneuvers.  more » « less
Award ID(s):
1904394
PAR ID:
10525258
Author(s) / Creator(s):
; ;
Publisher / Repository:
American Institute of Aeronautics and Astronautics
Date Published:
ISBN:
978-1-62410-711-5
Format(s):
Medium: X
Location:
Orlando, FL
Sponsoring Org:
National Science Foundation
More Like this
  1. Abstract In this work, we propose the integration of Koopman operator methodology with Lyapunov‐based model predictive control (LMPC) for stabilization of nonlinear systems. The Koopman operator enables global linear representations of nonlinear dynamical systems. The basic idea is to transform the nonlinear dynamics into a higher dimensional space using a set of observable functions whose evolution is governed by the linear but infinite dimensional Koopman operator. In practice, it is numerically approximated and therefore the tightness of these linear representations cannot be guaranteed which may lead to unstable closed‐loop designs. To address this issue, we integrate the Koopman linear predictors in an LMPC framework which guarantees controller feasibility and closed‐loop stability. Moreover, the proposed design results in a standard convex optimization problem which is computationally attractive compared to a nonconvex problem encountered when the original nonlinear model is used. We illustrate the application of this methodology on a chemical process example. 
    more » « less
  2. Bilevel optimization has become a powerful tool in a wide variety of machine learning problems. However, the current nonconvex bilevel optimization considers an offline dataset and static functions, which may not work well in emerging online applications with streaming data and time-varying functions. In this work, we study online bilevel optimization (OBO) where the functions can be time-varying and the agent continuously updates the decisions with online streaming data. To deal with the function variations and the unavailability of the true hypergradients in OBO, we propose a single-loop online bilevel optimizer with window averaging (SOBOW), which updates the outer-level decision based on a window average of the most recent hypergradient estimations stored in the memory. Compared to existing algorithms, SOBOW is computationally efficient and does not need to know previous functions. To handle the unique technical difficulties rooted in single-loop update and function variations for OBO, we develop a novel analytical technique that disentangles the complex couplings between decision variables, and carefully controls the hypergradient estimation error. We show that SOBOW can achieve a sublinear bilevel local regret under mild conditions. Extensive experiments across multiple domains corroborate the effectiveness of SOBOW. 
    more » « less
  3. This paper introduces an approach for reducing the computational cost of implementing Linear Quadratic Model Predictive Control (MPC) for set-point tracking subject to pointwise-in-time state and control constraints. The approach consists of three key components: First, a log-domain interior-point method used to solve the receding horizon optimal control problems; second, a method of warm-starting this optimizer by using the MPC solution from the previous timestep; and third, a computational governor that maintains feasibility and bounds the suboptimality of the warm-start by altering the reference command provided to the MPC problem. Theoretical guarantees regarding the recursive feasibility of the MPC problem, asymptotic stability of the target equilibrium, and finite-time convergence of the reference signal are provided for the resulting closed-loop system. In a numerical experiment on a lateral vehicle dynamics model, the worst-case execution time of a standard MPC implementation is reduced by over a factor of 10 when the computational governor is added to the closed-loop system. 
    more » « less
  4. This paper introduces a computationally efficient approach for solving Model Predictive Control (MPC) reference tracking problems with state and control constraints. The approach consists of three key components: First, a log-domain interior-point quadratic programming method that forms the basis of the overall approach; second, a method of warm-starting this optimizer by using the MPC solution from the previous timestep; and third, a computational governor that bounds the suboptimality of the warm-start by altering the reference command provided to the MPC problem. As a result, the closed-loop system is altered in a manner so that MPC solutions can be computed using fewer optimizer iterations per timestep. In a numerical experiment, the computational governor reduces the worst-case computation time of a standard MPC implementation by 90%, while maintaining good closed-loop performance. 
    more » « less
  5. This paper illustrates an approach to integrate learning into spacecraft automated rendezvous, proximity maneuvering, and docking (ARPOD) operations. Spacecraft rendezvous plays a significant role in many spacecraft missions including orbital transfers, ISS re-supply, on-orbit refueling and servicing, and debris removal. On one hand, precise modeling and prediction of spacecraft dynamics can be challenging due to the uncertainties and perturbation forces in the spacecraft operating environment and due to multi-layered structure of its nominal control system. On the other hand, spacecraft maneuvers need to satisfy required constraints (thrust limits, line of sight cone constraints, relative velocity of approach, etc.) to ensure safety and achieve ARPOD objectives. This paper considers an application of a learning-based reference governor (LRG) to enforce constraints without relying on a dynamic model of the spacecraft during the mission. Similar to the conventional Reference Governor (RG), the LRG is an add-on supervisor to a closed-loop control system, serving as a pre-filter on the command generated by the ARPOD planner. As the RG, LRG modifies, if it becomes necessary, the command to a constraint-admissible reference to enforce specified constraints. The LRG is distinguished, however, by the ability to rely on learning instead of an explicit model of the system, and guarantees constraints satisfaction during and after the learning. Simulations of spacecraft constrained relative motion maneuvers on a low Earth orbit are reported that demonstrate the effectiveness of the proposed approach. 
    more » « less