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.


  • NSF Public Access
  • Search Results
  • Optimal control of parameterized stationary Maxwell's system: Reduced basis, convergence analysis, and a posteriori error estimates
Title: Optimal control of parameterized stationary Maxwell's system: Reduced basis, convergence analysis, and a posteriori error estimates
We consider an optimal control problem governed by parameterized stationary Maxwell's system with the Gauss's law. The parameters enter through dielectric, magnetic permeability, and charge density. Moreover, the parameter set is assumed to be compact. We discretize the electric field by a finite element method and use variational discretization concept for the control. We present a reduced basis method for the optimal control problem and establish the uniform convergence of the reduced order solutions to that of the original full-dimensional problem provided that the snapshot parameter sample is dense in the parameter set, with an appropriate parameter separability rule. Finally, we establish the absolute a posteriori error estimator for the reduced order solutions and the corresponding cost functions in terms of the state and adjoint residuals.  more » « less
Award ID(s):
2110263 1913004
PAR ID:
10345645
Author(s) / Creator(s):
; ;
Date Published:
Journal Name:
Mathematical Control & Related Fields
Volume:
0
Issue:
0
ISSN:
2156-8472
Page Range / eLocation ID:
0
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. ; ; ; (, Proceedings of HSCC 2023, 26th ACM International Conference on Hybrid Systems: Computation and Control)
    We present ResilienC, a framework for resilient control of Cyber- Physical Systems subject to STL-based requirements. ResilienC uti- lizes a recently developed formalism for specifying CPS resiliency in terms of sets of (rec,dur) real-valued pairs, where rec repre- sents the system’s capability to rapidly recover from a property violation (recoverability), and dur is reflective of its ability to avoid violations post-recovery (durability). We define the resilient STL control problem as one of multi-objective optimization, where the recoverability and durability of the desired STL specification are maximized. When neither objective is prioritized over the other, the solution to the problem is a set of Pareto-optimal system trajectories. We present a precise solution method to the resilient STL control problem using a mixed-integer linear programming encoding and an a posteriori n-constraint approach for efficiently retrieving the complete set of optimally resilient solutions. In ResilienC, at each time-step, the optimal control action selected from the set of Pareto- optimal solutions by a Decision Maker strategy realizes a form of Model Predictive Control. We demonstrate the practical utility of the ResilienC framework on two significant case studies: autonomous vehicle lane keeping and deadline-driven, multi-region package delivery. 
    more » « less
  3. ; ; ; (, IEEE)
    Optimal power management of battery energy storage systems (BESS) is crucial for their safe and efficient operation. Numerical optimization techniques are frequently utilized to solve the optimal power management problems. However, these techniques often fall short of delivering real-time solutions for large-scale BESS due to their computational complexity. To address this issue, this paper proposes a computationally efficient approach. We introduce a new set of decision variables called power-sharing ratios corresponding to each cell, indicating their allocated power share from the output power demand. We then formulate an optimal power management problem to minimize the system-wide power losses while ensuring compliance with safety, balancing, and power supply-demand match constraints. To efficiently solve this problem, a parameterized control policy is designed and leveraged to transform the optimal power management problem into a parameter estimation problem. We then implement the ensemble Kalman inversion to estimate the optimal parameter set. The proposed approach significantly reduces computational requirements due to 1) the much lower dimensionality of the decision parameters and 2) the estimation treatment of the optimal power management problem. Finally, we conduct extensive simulations to validate the effectiveness of the proposed approach. The results show promise in accuracy and computation time compared with explored numerical optimization techniques. 
    more » « less
  4. ; ; ; (, Applied Mathematics & Optimization)
    The paper is devoted to the study of a new class of optimal control problems governed by discontinuous constrained differential inclusions of the sweeping type involving the duration of the dynamic process into optimization. We develop a novel version of the method of discrete approximations of its own qualitative and numerical values with establishing its well-posedness and strong convergence to optimal solutions of the controlled sweeping process. Using advanced tools of first-order and second-order variational analysis and generalized differentiation allows us to derive new necessary conditions for optimal solutions of the discrete-time problems and then, by passing to the limit in the discretization procedure, for designated local minimizers in the original problem of sweeping optimal control. The obtained results are illustrated by a numerical example 
    more » « less
  5. ; (, 2018 Annual American Control Conference (ACC))
    In this paper, we consider a multi-objective control problem for stochastic systems that seeks to minimize a cost of interest while ensuring safety. We introduce a novel measure of safety risk using the conditional value-at-risk and a set distance to formulate a safety risk-constrained optimal control problem. Our reformulation method using an extremal representation of the safety risk measure provides a computationally tractable dynamic programming solution. A useful byproduct of the proposed solution is the notion of a risk-constrained safe set, which is a new stochastic safety verification tool. We also establish useful connections between the risk-constrained safe sets and the popular probabilistic safe sets. The tradeoff between the risk tolerance and the mean performance of our controller is examined through an inventory control problem. 
    more » « less
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email