 Award ID(s):
 2031213
 NSFPAR ID:
 10481408
 Publisher / Repository:
 American Astronautical Society
 Date Published:
 Format(s):
 Medium: X
 Location:
 Austin, Texas
 Sponsoring Org:
 National Science Foundation
More Like this

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 userspecified 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 pathconstrained 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

Abstract We consider an optimal control problem where the state equations are a coupled hyperbolic–elliptic system. This system arises in elastodynamics with piezoelectric effects—the elastic stress tensor is a function of elastic displacement and electric potential. The electric flux acts as the control variable and bound constraints on the control are considered. We develop a complete analysis for the state equations and the control problem. The requisite regularity on the control, to show the wellposedness of the state equations, is enforced using the cost functional. We rigorously derive the firstorder necessary and sufficient conditions using adjoint equations and further study their wellposedness. For spatially discrete (timecontinuous) problems, we show the convergence of our numerical scheme. Threedimensional numerical experiments are provided showing convergence properties of a fully discrete method and the practical applicability of our approach.

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.

Abstract We investigate a P 1 P_{1} finite element method for an elliptic distributed optimal control problem with pointwise state constraints and a state equation that includes advective/convective and reactive terms.The convergence of this method can be established for general polygonal/polyhedral domains that are not necessarily convex.The discrete problem is a strictly convex quadratic program with box constraints that can be solved efficiently by a primaldual active set algorithm.more » « less

null (Ed.)A method is developed for transforming chance constrained optimization problems to a form numerically solvable. The transformation is accomplished by reformulating the chance constraints as nonlinear constraints using a method that combines the previously developed SplitBernstein approximation and kernel density estimator (KDE) methods. The SplitBernstein approximation in a particular form is a biased kernel density estimator. The bias of this kernel leads to a nonlinear approximation that does not violate the bounds of the original chance constraint. The method of applying biased KDEs to reformulate chance constraints as nonlinear constraints transforms the chance constrained optimization problem to a deterministic optimization problems that retains key properties of the chance constrained optimization problem and can be solved numerically. This method can be applied to chance constrained optimal control problems. As a result, the SplitBernstein and Gaussian kernels are applied to a chance constrained optimal control problem and the results are compared.more » « less