Abstract The Allen‐Cahn equation satisfies the maximum bound principle, that is, its solution is uniformly bounded for all time by a positive constant under appropriate initial and/or boundary conditions. It has been shown recently that the time‐discrete solutions produced by low regularity integrators (LRIs) are likewise bounded in the infinity norm; however, the corresponding fully discrete error analysis is still lacking. This work is concerned with convergence analysis of the fully discrete numerical solutions to the Allen‐Cahn equation obtained based on two first‐order LRIs in time and the central finite difference method in space. By utilizing some fundamental properties of the fully discrete system and the Duhamel's principle, we prove optimal error estimates of the numerical solutions in time and space while the exact solution is only assumed to be continuous in time. Numerical results are presented to confirm such error estimates and show that the solution obtained by the proposed LRI schemes is more accurate than the classical exponential time differencing (ETD) scheme of the same order.
more »
« less
This content will become publicly available on February 1, 2026
Practical considerations for implementing robust-to-early termination model predictive control
Model Predictive Control (MPC) is widely used to achieve performance objectives, while enforcing operational and safety constraints. Despite its high performance, MPC often demands significant computational resources, making it challenging to implement in systems with limited computing capacity. A recent approach to address this challenge is to use the Robust-to-Early Termination (REAP) strategy. At any time instant, REAP converts the MPC problem into the evolution of a virtual dynamical system whose trajectory converges to the optimal solution, and provides guaranteed sub-optimal and feasible solution whenever its evolution is terminated due to limited computational power. REAP has been introduced as a continuous-time scheme and its theoretical properties have been derived under the assumption that it performs all the computations in continuous time. However, REAP should be practically implemented in discrete-time. This paper focuses on the discrete-time implementation of REAP, exploring conditions under which anytime feasibility and convergence properties are maintained when the computations are performed in discrete time. The proposed methodology is validated and evaluated through extensive simulation and experimental studies.
more »
« less
- Award ID(s):
- 2244082
- PAR ID:
- 10601165
- Publisher / Repository:
- Elsevier
- Date Published:
- Journal Name:
- Systems & Control Letters
- Volume:
- 196
- Issue:
- C
- ISSN:
- 0167-6911
- Page Range / eLocation ID:
- 106018
- Subject(s) / Keyword(s):
- Model predictive control Robust-to-early termination Discrete-time implementation Limited computing capacity
- Format(s):
- Medium: X
- Sponsoring Org:
- National Science Foundation
More Like this
-
-
The use of mobile actuators for the control of spatially distributed systems governed by PDEs results in both implementational and computational challenges. First it requires the backward-in-time solution to the actuator guidance and the backward-in-time solution to the control operator Riccati equation. A way to address this computational challenge is to consider a continuous-discrete alternative whereby the mobile actuator is repositioned at discrete instances and resides in a specific spatial location for a certain time interval. In order to find optimal paths for a given time interval, a set of feasible locations is derived using the reachability set. These reachability sets are further constrained to take into account the time it takes to travel to any spatial position with a prescribed maximum velocity. The proposed hybrid continuous-discrete control and actuator guidance is demonstrated for a 2D diffusion PDE that uses no constraints and angular constraints on the actuator motion.more » « less
-
As more non-synchronous renewable energy sources (RES) participate in power systems, the system's inertia decreases and becomes time dependent, challenging the ability of existing control schemes to maintain frequency stability. System operators, research laboratories, and academic institutes have expressed the importance to adapt to this new power system paradigm. As one of the potential solutions, virtual inertia has become an active research area. However, power dynamics have been modeled as time-invariant, by not modeling the variability in the system's inertia. To address this, we propose a new modeling framework for power system dynamics to simulate a time-varying evolution of rotational inertia coefficients in a network. We model power dynamics as a hybrid system with discrete modes representing different rotational inertia regimes of the network. We test the performance of two classical controllers from the literature in this new hybrid modeling framework: optimal closed-loop Model Predictive Control (MPC) and virtual inertia placement. Results show that the optimal closed-loop MPC controller (Linear MPC) performs the best in terms of cost; it is 82 percent less expensive than virtual inertia placement. It is also more efficient in terms of energy injected/absorbed to control frequency. To address the lower performance of virtual inertia placement, we then propose a new Dynamic Inertia Placement scheme and we find that it is more efficient in terms of cost (74 percent cheaper) and energy usage, compared to classical inertia placement schemes from the literature.more » « less
-
Abstract This paper provides a (rigorous) theoretical framework for the numerical approximation of Riccati-based feedback control problems of hyperbolic-like dynamics over a finite-time horizon, with emphasis on genuine unbounded control action. Both continuous and approximation theories are illustrated by specific canonical hyperbolic-like equations with boundary control, where the abstract assumptions are actually sharp regularity properties of the hyperbolic dynamics under discussion. Assumptions are divided in two groups. A first group of dynamical assumptions (actually dynamic properties) imply some preliminary critical properties of the control problem, including the definition of the would-be Riccati operator, in terms of the original data. However, in order to guarantee that such an operator is moreover the unique solution (within a specific class) of the corresponding Differential/Integral Riccati Equation, additional smoothing assumptions on the operators defining the performance index are required. The ultimate goal is to show that the the discrete finite dimensional Riccati based feedback operator, when inserted into the original PDE dynamics, provides near optimal performance.more » « less
-
Model predictive control (MPC) has been applied to many platforms in robotics and autonomous systems for its capability to predict a system’s future behavior while incorporating constraints that a system may have. To enhance the performance of a system with an MPC controller, one can manually tunethe MPC’s cost function. However, it can be challenging due to the possibly high dimension of the parameter space as well as the potential difference between the open-loop cost function in MPC and the overall closed-loop performance metric function. This letter presents Difffune-MPC, a novel learning method, to learn the cost function of an MPC in a closed-loop manner. The proposed framework is compatible with the scenario where the time interval for performance evaluation and MPC’s planning horizon have different lengths. We show the auxiliary problem whose solution admits the analytical gradients of MPC and discuss its variations in different MPC settings, including nonlinear MPCs that are solved using sequential quadratic programming. Simulation results demonstrate the learning capability of DiffTune-MPC and the generalization capability of the learned MPC parameters.more » « less
An official website of the United States government
