skip to main content


Title: A Monte Carlo Analysis of Contingency Optimal Guidance for Mars Entry
A Monte Carlo analysis of a contingency optimal guidance strategy is conducted. The guidance strategy is applied to a Mars Entry problem in which it is assumed that the surface level atmospheric density is a random variable. First, a nominal guidance strategy is employed such that the optimal control problem is re-solved at constant guidance cycles. When the trajectory lies within a particular distance from a path constraint boundary, the nominal guidance strategy is replaced with a contingency guidance strategy, where the contingency guidance strategy attempts to prevent a violation in the the relevant path constraint. The contingency guidance strategy utilizes the reference optimal control problem formulation, but modifies the objective functional to maximize the margin between the path constraint limit and path constraint function value. The ability of the contingency guidance strat- egy to prevent violations in the path constraints is assessed via a Monte Carlo simulation.  more » « less
Award ID(s):
2031213
NSF-PAR ID:
10481406
Author(s) / Creator(s):
;
Publisher / Repository:
American Astronautical Society
Date Published:
Journal Name:
2023 Space Flight Mechanics Meeting
Format(s):
Medium: X
Location:
Austin, Texas
Sponsoring Org:
National Science Foundation
More Like this
  1. A Monte Carlo analysis of a contingency optimal guidance strategy is conducted. The guidance strategy is applied to a Mars Entry problem in which it is assumed that the surface level atmospheric density is a random variable. First, a nominal guidance strategy is employed such that the optimal control problem is re-solved at constant guidance cycles. When the trajectory lies within a particular distance from a path constraint boundary, the nominal guidance strategy is replaced with a contingency guidance strategy, where the contingency guidance strategy attempts to prevent a violation in the the relevant path constraint. The contingency guidance strategy utilizes the reference optimal control problem formulation, but modifies the objective functional to maximize the margin between the path constraint limit and path constraint function value. The ability of the contingency guidance strategy to prevent violations in the path constraints is assessed via a Monte Carlo simulation. 
    more » « less
  2. A robust optimal guidance strategy is proposed. The guidance strategy is designed to reduce the possibility of violations in inequality path constraints in the presence of modeling errors and perturbations. The guidance strategy solves a constrained nonlinear optimal control problem at the start of every guidance cycle. In order to reduce the possibility of path constraint violations, the objective functional for the optimal control problem is modified at the start of a guidance cycle if it is found that the solution lies within a user-specified threshold of a path constraint limit. The modified objective functional is designed such that it maximizes the margin in the solution relative to the path constraint limit that could potentially be violated in the future. The method is validated on a path-constrained Mars entry problem where the reference model and the perturbed model differ in their atmospheric density. It is found for the example studied that the approach significantly improves the path constraint margin and maintains feasibility relative to a guidance approach that maintains the original objective functional for each guidance update. 
    more » « less
  3. We propose a reinforcement learning framework where an agent uses an internal nominal model for stochastic model predictive control (MPC) while compensating for a disturbance. Our work builds on the existing risk-aware optimal control with stochastic differential equations (SDEs) that aims to deal with such disturbance. However, the risk sensitivity and the noise strength of the nominal SDE in the riskaware optimal control are often heuristically chosen. In the proposed framework, the risk-taking policy determines the behavior of the MPC to be risk-seeking (exploration) or riskaverse (exploitation). Specifcally, we employ the risk-aware path integral control that can be implemented as a Monte-Carlo (MC) sampling with fast parallel simulations using a GPU. The MC sampling implementations of the MPC have been successful in robotic applications due to their real-time computation capability. The proposed framework that adapts the noise model and the risk sensitivity outperforms the standard model predictive path integ 
    more » « less
  4. Summary

    A method is developed to numerically solve chance constrained optimal control problems. The chance constraints are reformulated as nonlinear constraints that retain the probability properties of the original constraint. The reformulation transforms the chance constrained optimal control problem into a deterministic optimal control problem that can be solved numerically. The new method developed in this paper approximates the chance constraints using Markov Chain Monte Carlo sampling and kernel density estimators whose kernels have integral functions that bound the indicator function. The nonlinear constraints resulting from the application of kernel density estimators are designed with bounds that do not violate the bounds of the original chance constraint. The method is tested on a nontrivial chance constrained modification of a soft lunar landing optimal control problem and the results are compared with results obtained using a conservative deterministic formulation of the optimal control problem. Additionally, the method is tested on a complex chance constrained unmanned aerial vehicle problem. The results show that this new method can be used to reliably solve chance constrained optimal control problems.

     
    more » « less
  5. null (Ed.)
    Contingency Constrained Optimal Power Flow (CCOPF) differs from traditional Optimal Power Flow (OPF) because its generation dispatch is planned to work with state variables between constraint limits, considering a specific contingency. When it is not desired to have changes in the power dispatch after the contingency occurs, the CCOPF is studied with a preventive perspective, whereas when the contingency occurs and the power dispatch needs to change to operate the system between limits in the post-contingency state, the problem is studied with a corrective perspective. As current power system software tools mainly focus on the traditional OPF problem, having the means to solve CCOPF will benefit power systems planning and operation. This paper presents a Quadratically Constrained Quadratic Programming (QCQP) formulation built within the matpower environment as a solution strategy to the preventive CCOPF. Moreover, an extended OPF model that forces the network to meet all constraints under contingency is proposed as a strategy to find the power dispatch solution for the corrective CCOPF. Validation is made on the IEEE 14-bus test system including photovoltaic generation in one simulation case. It was found that in the QCQP formulation, the power dispatch calculated barely differs in both pre- and post-contingency scenarios while in the OPF extended power network, node voltage values in both pre- and post-contingency scenarios are equal in spite of having different power dispatch for each scenario. This suggests that both the QCQP and the extended OPF formulations proposed, could be implemented in power system software tools in order to solve CCOPF problems from a preventive or corrective perspective. 
    more » « less