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.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: Structure Detection Method for Solving State-Variable Inequality Path Constrained Optimal Control Problems
A structure detection method is developed for solving state-variable inequality path con- strained optimal control problems. The method obtains estimates of activation and deactiva- tion times of active state-variable inequality path constraints (SVICs), and subsequently al- lows for the times to be included as decision variables in the optimization process. Once the identification step is completed, the method partitions the problem into a multiple-domain formulation consisting of constrained and unconstrained domains. Within each domain, Legendre-Gauss-Radau (LGR) orthogonal direct collocation is used to transcribe the infinite- dimensional optimal control problem into a finite-dimensional nonlinear programming (NLP) problem. Within constrained domains, the corresponding time derivative of the active SVICs that are explicit in the control are enforced as equality path constraints, and at the beginning of the constrained domains, the necessary tangency conditions are enforced. The accuracy of the proposed method is demonstrated on a well-known optimal control problem where the analytical solution contains a state constrained arc.  more » « less
Award ID(s):
2031213
PAR ID:
10481408
Author(s) / Creator(s):
;
Publisher / Repository:
American Astronautical Society
Date Published:
Format(s):
Medium: X
Location:
Austin, Texas
Sponsoring Org:
National Science Foundation
More Like this
  1. ; (, 2022 AAS/AIAA Astrodynamics Specialist Conference)
    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
  2. ; ; (, IMA Journal of Numerical Analysis)
    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 well-posedness of the state equations, is enforced using the cost functional. We rigorously derive the first-order necessary and sufficient conditions using adjoint equations and further study their well-posedness. For spatially discrete (time-continuous) problems, we show the convergence of our numerical scheme. Three-dimensional numerical experiments are provided showing convergence properties of a fully discrete method and the practical applicability of our approach. 
    more » « less
  3. ; ; ; (, Optimal Control Applications and Methods)
    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
  4. ; ; (, Computational Methods in Applied Mathematics)
    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 primal-dual active set algorithm. 
    more » « less
  5. ; ; ; ; (, 18th International Conference on Autonomous Agents and Multi-Agent Systems)
    In this paper, we adopt a new perspective on the Multi-Agent Path Finding (MAPF) problem and view it as a Constraint Satisfaction Problem (CSP). A variable corresponds to an agent, its domain is the set of all paths from the start vertex to the goal vertex of the agent, and the constraints allow only conflict-free paths for each pair of agents. Although the domains and constraints are only implicitly defined, this new CSP perspective allows us to use successful techniques from CSP search. With the concomitant idea of using matrix computations for calculating the size of the reduced domain of an uninstantiated variable, we apply Dynamic Variable Ordering and Rapid Random Restarts to the MAPF problem. In our experiments, the resulting simple polynomial-time MAPF solver, called Matrix MAPF solver, either outperforms or matches the performance of many state-of-the-art solvers for the MAPF problem and its variants. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email