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: Continuation Method for the Numerical Solution of Singular Optimal Control Problems Using Adaptive Radau Collocatio
A continuation method for solving singular optimal control problems is presented. Assuming that the structure of the optimal solution is known a priori, the time horizon of the optimal control problem is divided into multiple domains and is discretized using a multiple-domain Radau collocation formulation. The resulting nonlinear programming problem is then solved by implementing a continuation method over singular domains. The continuation method is then demonstrated on a minimum-time rigid body reorientation problem. The results obtained demonstrate that a continuation method can be used to obtain an accurate approximation to the optimal control on both a finite-order and an infinite-order singular arc.  more » « less
Award ID(s):
2031213
PAR ID:
10308836
Author(s) / Creator(s):
;
Date Published:
Journal Name:
2022 AIAA SciTech Conference (Space Flight Mechanics Meeting)
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; (, World Scientific Publishing Company)
    Tuncer, N; Martcheva, M; Prosper, O; Childs, L (Ed.)
    In this chapter, we demonstrate how to use a nonlinear polyhedral con- strained optimization solver called the Polyhedral Active Set Algorithm (PASA) for solving a general singular control problem. We present a method for discretizing a general optimal control problem involving the use of the gradient of the Lagrangian for computing the gradient of the cost functional so that PASA can be applied. When a numerical solu- tion contains artifacts that resemble “chattering,” a phenomenon where the control oscillates wildly along the singular region, we recommend a method of regularizing the singular control problem by adding a term to the cost functional that measures a scalar multiple of the total variation of the control, where the scalar is viewed as a tuning parameter. We then demonstrate PASA’s performance on three singular control problems that give rise to different applications of mathematical biology. We also provide some exposition on the heuristics that we use in determining an appropriate size for the tuning parameter. 
    more » « less
  2. ; (, American Astronautical Society)
    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
  3. ; (, IEEE)
    A modified form of Legendre-Gauss orthogonal direct collocation is developed for solving optimal control problems whose solutions are nonsmooth due to control discon- tinuities. This new method adds switch time variables, control variables, and collocation conditions at both endpoints of a mesh interval, whereas these new variables and collocation con- ditions are not included in standard Legendre-Gauss orthogonal collocation. The modified Legendre-Gauss collocation method alters the search space of the resulting nonlinear programming problem and optimizes the switch point of the control solution. The transformed adjoint system of the modified Legendre- Gauss collocation method is then derived and shown to satisfy the necessary conditions for optimality. Finally, an example is provided where the optimal control is bang-bang and contains multiple switches. This method is shown to be capable of solving complex optimal control problems with nonsmooth solutions. 
    more » « less
  4. ; (, Mathematical Methods in the Applied Sciences)
    We prove the well‐posedness and smoothing properties of a distributed‐order time‐fractional diffusion equation with a singular density function in multiple space dimensions, which could model the ultraslow subdiffusion processes. We accordingly derive a finite element approximation to the problem and prove its optimal‐order error estimate. Numerical results are presented to support the mathematical and numerical analysis. 
    more » « less
  5. (, SIAM Undergraduate Research Online)
    The image processing task of the recovery of an image from a noisy or compromised image is an illposed inverse problem. To solve this problem, it is necessary to incorporate prior information about the smoothness, or the structure, of the solution, by incorporating regularization. Here, we consider linear blur operators with an efficiently-found singular value decomposition. Then, regularization is obtained by employing a truncated singular value expansion for image recovery. In this study, we focus on images for which the image blur operator is separable and can be represented by a Kronecker product such that the associated singular value decomposition is expressible in terms of the singular value decompositions of the separable components. The truncation index k can then be identified without forming the full Kronecker product of the two terms. This report investigates the problem of learning an optimal k using two methods. For one method to learn k we assume the knowledge of the true images, yielding a supervised learning algorithm based on the average relative error. The second method uses the method of generalized cross validation and does not require knowledge of the true images. The approach is implemented and demonstrated to be successful for Gaussian, Poisson and salt and pepper noise types across noise levels with signal to noise ratios as low as 10. This research contributes to the field by offering insights into the use of the supervised and unsupervised estimators for the truncation index, and demonstrates that the unsupervised algorithm is not only robust and computationally efficient, but is also comparable to the supervised method. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email