This paper presents a deep learning framework for analyzing on-board vibration response signals in infrastructure health monitoring. The proposed WaveletInception–BiGRU network uses a Learnable Wavelet Packet Transform (LWPT) for early spectral feature extraction, followed by one-dimensional Inception-Residual Network (1D Inception-ResNet) modules for multi-scale, high-level feature learning. Bidirectional Gated Recurrent Unit (BiGRU) modules then integrate temporal dependencies and incorporate operational conditions, such as the measurement speed. This approach enables effective analysis of vibration signals recorded at varying speeds, eliminating the need for explicit signal preprocessing. The sequential estimation head further leverages bidirectional temporal information to produce an accurate, localized assessment of infrastructure health. Ultimately, the framework generates high-resolution health profiles spatially mapped to the physical layout of the infrastructure. Case studies involving track stiffness regression and transition zone classification using real-world measurements demonstrate that the proposed framework significantly outperforms state-of-the-art methods, underscoring its potential for accurate, localized, and automated on-board infrastructure health monitoring.

Max-min-plus-scaling (MMPS) systems extend max-plus and max-min-plus models by incorporating a scaling operation, making them suitable for modeling discrete-event systems involving timing, synchronization, and resource constraints. This paper focuses on implicit MMPS systems, where the current state depends on itself, which complicates analysis because solutions may not exist or may be non-unique. We investigate conditions under which such systems are solvable. We prove that the implicit MMPS system is solvable if the corresponding implicit interconnection graph does not contain any circuits. When there exist a circuit, we develop necessary and sufficient conditions for the system to be solvable. The paper also discusses solvable regions and proposes an iterative method for computing system states. We demonstrate all the theoretical results with a numerical example.

Handling model mismatch is a common challenge in model predictive control (MPC). While robust MPC is effective, its conservatism often makes it less desirable. Certainty-equivalence MPC (CE-MPC), which uses a nominal model, offers an appealing alternative due to its design simplicity and low computational costs. This paper investigates CE-MPC for uncertain nonlinear systems with multiplicative parametric uncertainty and input constraints that are inactive at the steady state. The primary contributions are two-fold. First, a novel perturbation analysis of the MPC value function is provided, without assuming the Lipschitz continuity of the stage cost, better tailoring the widely used quadratic cost and having broader applicability in value function approximation, learning-based MPC, and performance-driven MPC design. Second, the stability and performance analysis of CE-MPC are provided, quantifying the suboptimality of CE-MPC compared to the infinite-horizon optimal controller with perfect model knowledge. The results provide insights in how the prediction horizon and model mismatch jointly affect stability and the worst-case performance. Furthermore, the general results are specialized to linear quadratic control, and a competitive ratio bound is derived, serving as the first competitive-ratio bound for MPC of uncertain linear systems with input constraints and multiplicative uncertainty.

This paper presents a novel distributed model predictive control (MPC) formulation without terminal cost and a corresponding distributed synthesis approach for distributed linear discrete-time systems with coupled constraints. The proposed control scheme introduces an explicit stability condition as an additional constraint based on relaxed dynamic programming. As a result, contrary to other related approaches, system stability with the developed controller does not rely on designing a terminal cost. A distributed synthesis approach is then introduced to handle the stability constraint locally within each local agent. To solve the underlying optimization problem for distributed MPC, a violation-free distributed optimization approach is developed, using constraint tightening to ensure feasibility throughout iterations. A numerical example demonstrates that the proposed distributed MPC approach ensures closed-loop stability for each feasible control sequence, with each agent computing its control input in parallel.

This paper presents a model predictive control (MPC) framework leveraging an ensemble of data-based models to optimally control complex systems under multiple operating conditions. A novel combination rule for ensemble models is proposed, based on the statistical Mahalanobis distance, enabling the ensemble weights to suitably vary across the prediction window based on the system input. In addition, a novel state observer for ensemble models is developed using moving horizon estimation (MHE). The effectiveness of the proposed methodology is demonstrated on a benchmark energy system operating under multiple conditions.

This work analyzes how the trade-off between the modeling error, the terminal value function error, and the prediction horizon affects the performance of a nominal receding-horizon linear quadratic (LQ) controller. By developing a novel perturbation result of the Riccati difference equation, a novel performance upper bound is obtained and suggests that for many cases, the prediction horizon can be either 1 or +∞ to improve the control performance, depending on the relative difference between the modeling error and the terminal value function error. The result also shows that when an infinite horizon is desired, a finite prediction horizon that is larger than the controllability index can be sufficient for achieving a near-optimal performance, revealing a close relation between the prediction horizon and controllability. The obtained suboptimality performance upper bound is applied to provide novel sample complexity and regret guarantees for nominal receding-horizon LQ controllers in a learning-based setting. We show that an adaptive prediction horizon that increases as a logarithmic function of time is beneficial for regret minimization.

PieceWise Affine (PWA) approximations for nonlinear functions have been extensively used for tractable, computationally efficient control of nonlinear systems. However, reaching a desired approximation accuracy without prior information about the behavior of the nonlinear systems remains a challenge in the function approximation and control literature. As the name suggests, PWA approximation aims at approximating a nonlinear function or system by dividing the domain into multiple subregions where the nonlinear function or dynamics is approximated locally by an affine function also called local mode. Without prior knowledge of the form of the nonlinearity, the required number of modes, the locations of the subregions, and the local approximations need to be optimized simultaneously, which becomes highly complex for large-scale systems with multi-dimensional nonlinear functions. This paper introduces a novel approach for PWA approximation of multi-dimensional nonlinear systems, utilizing a hinging hyperplane formalism for cut-based partitioning of the domain. The complexity of the PWA approximation is iteratively increased until reaching the desired accuracy level. Further, the tractable cut definitions allow for different forms of subregions, as well as the ability to impose continuity constraints on the PWA approximation. The methodology is explained via multiple examples and its performance is compared to two existing approaches through case studies, showcasing its efficacy.

Efficient energy management is essential for sustainable microgrid operation amid increasing renewable energy integration. In this paper, an imitation learning-based framework to approximate mixed-integer Economic Model Predictive Control (EMPC) is proposed for microgrid energy management, considering fuel generators, renewable energy resources, a unified energy storage unit, and curtailable loads. Within the proposed framework, a neural network is trained to imitate EMPC control actions from offline trajectories, thereby enabling fast real-time decision making without solving online mixed-integer optimization problems, which often exhibit highly variable solution times across instances and do not scale well to large problem sizes; in particular, worst-case solving times can be excessively large and therefore unsuitable for real-time deployment. In contrast, the learned policy provides predictable and consistently low computation times. For robustness and generalization, the learning process incorporates noise injection during training to mitigate distribution shift and explicitly accounts for forecast uncertainty in renewable generation and demand. Furthermore, a constraint-tightening approach combined with a projection layer built on control barrier functions is proposed to ensure recursive feasibility and constraint satisfaction for the learned controller. Simulation results demonstrate that the learned policy achieves economic performance comparable to EMPC, while reducing computation time by approximately one order of magnitude relative to the optimization-based EMPC.

Dispersion modeling is crucial for marine environmental modeling and management. However, operational applications require a practical balance between model accuracy and computational efficiency. To address this challenge, we develop and validate a generalized cell-based model (CBM) framework for contaminant dispersion. The framework enhances physical realism through a novel three-dimensional (3D) transport model and a formulation for chemical reactions. Additionally, a new discretization-based approach is proposed to robustly relate the CBM’s diffusion coefficient to its partial differential equation counterpart, improving performance in scenarios with sharp gradients of the concentration level. The proposed framework’s favorable trade-off between accuracy and efficiency is demonstrated in a comparative simulation study, where the 3D CBM reduces computation time from 14.72 s to 0.06 s compared to finite-element methods (FEM), with a relative Root Mean Square Error (RMSE) of 7.67%. To demonstrate its practical applicability, the proposed framework is validated using ocean current and nitrate concentration data from the Copernicus Marine Environment Monitoring Service. After identifying a key model parameter from the data, the model’s forward predictions accurately reproduce the observed nitrate concentration patterns, confirming its suitability for operational scenarios.

We study feasibility guarantees for safety filters developed using Control Barrier Functions (CBFs) when a safe set is defined using the pointwise minimum of continuously differentiable functions, a construction that is common for the backup CBF (BCBF) method and typically nonsmooth. We replace the minimum by its log-sum-exp (soft-min) smoothing and show that, under a strict safety condition, the smooth function becomes a CBF (or extended CBF) for a range of the smoothing parameter. For compact safe sets, we derive an explicit lower bound on the smoothing parameter that makes the smooth function a CBF and hence renders the corresponding safety constraint feasible. For unbounded sets, we introduce tail conditions under which the smooth function satisfies an extended CBF condition uniformly. Finally, we apply these results to BCBFs. We show that safety of a compact (terminal) backup set under a backup controller, together with a condition ensuring safety of the backup trajectories on the relevant boundary of the safe set, is sufficient for constraint feasibility for BCBFs. These results provide a recipe for a priori feasibility guarantees for smooth inner approximations of nonsmooth safe sets without the need for additional online certification.

The partitioning problem is of central relevance for designing and implementing non-centralized Model Predictive Control (MPC) strategies for large-scale systems. These control approaches include decentralized MPC, distributed MPC, hierarchical MPC, and coalitional MPC. Partitioning a system for the application of non-centralized MPC consists of finding the best definition of the subsystems, and their allocation into groups for the definition of local controllers, to maximize the relevant performance indicators. The present survey proposes a novel systematization of the partitioning approaches in the literature in five main classes: optimization-based, algorithmic, community-detection-based, game-theoretic-oriented, and heuristic approaches. A unified graph-theoretical formalism, a mathematical re-formulation of the problem in terms of mixed-integer programming, the novel concepts of predictive partitioning and multi-topological representations, and a methodological formulation of quality metrics are developed to support the classification and further developments of the field. We analyze the different classes of partitioning techniques, and we present an overview of their strengths and limitations, which include a technical discussion about the different approaches. Representative case studies are discussed to illustrate the application of partitioning techniques for non-centralized MPC in various sectors, including power systems, water networks, wind farms, chemical processes, transportation systems, communication networks, industrial automation, smart buildings, and cyber–physical systems. An outlook of future challenges completes the survey.

Learning-based control with safety guarantees usually requires real-time safety certification and modifications of possibly unsafe learning-based policies. The control barrier function (CBF) method uses a safety filter (SF) containing a constrained optimization problem to produce safe policies. However, finding a valid CBF for a general nonlinear system requires a complex function parameterization, which in general makes the policy optimization problem difficult to solve in real time. For nonlinear systems with nonlinear state constraints, this paper proposes the novel concept of state-action CBFs (SACBFs), which do not only characterize the safety at each state but also evaluate the control inputs taken at each state. SACBFs, in contrast to CBFs, enable a flexible parameterization, resulting in a SF that involves a convex quadratic optimization problem, which significantly alleviates the online computational burden. We propose a learning-based approach to synthesize SACBFs. The effect of learning errors on the effectiveness of SACBFs is addressed by constraint tightening and introducing a new concept called contractive-set CBFs. This ensures formal safety guarantees for the learned CBFs and control policies. Simulation results on an inverted pendulum with elastic walls validate the proposed CBFs in terms of constraint satisfaction and CPU time.

Formation Tracking (FT) control is aimed at handling cooperative tasks in Multi-Agent Systems (MASs) to achieve desired performance. In these tasks, the leader's input is generally non-zero and unknown to all followers, i.e., its trajectory can be arbitrary and non-repetitive. In this paper, the additive property of linear systems is exploited to develop a unified framework for FT tasks of MASs, consisting of Adaptive Observer-based Control (AOC) and Iterative Learning Control (ILC). An AOC controller is employed to guarantee a fixed-shape formation between the leader and followers during the whole process, which reserves the initial condition for ILC. And ILC is used to improve the FT performance of certain repetitive tasks (followers rotating around the leader) over the trials. This gives rise to a fully distributed algorithm working for a directed communication graph containing a spanning tree without requiring any eigenvalue information from the Laplacian matrix of the graph, which enables its application to MASs with a large number of agents. Comparison is made via a numerical simulation to show that the proposed combined AOC-ILC algorithm has less FT error than pure AOC (without ILC), which validates the feasibility and efficacy of this algorithm.

This paper investigates the growth rate and fixed points of periodic max-min-plus-scaling (MMPS) systems with a period greater than one. First, we analyze the average growth rate of the periodic MMPS system by introducing an extended periodic form for the MMPS system. Then we propose a tree search algorithm to calculate the average growth rate of the periodic MMPS system with shorter execution time as compared to similar existing algorithms for MMPS systems.

Effective traffic control is essential for mitigating congestion in transportation networks. Conventional traffic management strategies, including route guidance and ramp metering, often rely on state feedback controllers, which are used for their simplicity and reactivity; however, they lack the adaptability required to cope with complex and time-varying traffic dynamics. This paper proposes a multi-agent reinforcement learning (RL) framework in which each agent adaptively tunes the parameters of a state feedback traffic controller, combining the reactivity of state feedback controllers with the adaptability of RL. By tuning parameters at a lower frequency rather than directly determining control inputs at a high frequency, the RL agents achieve improved training efficiency while maintaining adaptability to varying traffic conditions. The multi-agent structure further enhances system robustness, as local controllers can operate independently in the event of partial failures. The proposed framework is evaluated on a simulated multi-class transportation network under varying traffic conditions. Results show that the proposed multi-agent framework outperforms the no-control and fixed-parameter state feedback control cases, while performing on par with the single-agent RL-based adaptive state feedback control, but with much greater resilience to disturbances.

Distributed model predictive control (MPC) is currently being investigated as a solution to the important control challenge presented by networks of hybrid dynamical systems, for which the computational complexity is often prohibitive. However, a benchmark problem for comparing distributed hybrid MPC solutions is absent from the literature.We propose distributed control of a platoon of autonomous vehicles as a comparison benchmark problem. The problem provides a complex and adaptable case study, upon which existing and future approaches to distributed MPC for hybrid systems can be evaluated. Two hybrid modeling frameworks are presented for the vehicle dynamics. Five hybrid MPC controllers are then evaluated and extensively assessed on the fleet of vehicles. Finally, we comment on the need for new efficient and high performing distributed MPC schemes for hybrid systems.

Maintenance is a necessary to keep assets, in this case, a pavement system, in good condition. Spending too much on maintenance is not efficient, while not spending enough may cause the condition to drop below a desired level. Therefore, in this paper, a conceptual approach, based on systems and control theory, is developed to improve the efficiency of maintenance of a pavement system, compared to the currently used maintenance approach where often only fixed bounds of the condition determine whether or not a maintenance action is required.  A state-space description of the condition of the pavement system is chosen for predicting the future evolution of the health condition. This allows the use of a moving-horizon optimisation approach, to determine optimal anticipative maintenance actions. Furthermore, in this approach, the maintenance cost and the condition of the pavement system are optimised. This model-based approach can be applied in practice as well-documented data, from which degradation models can be constructed, are often available. In this paper, we also show how degradation models from the literature can be converted for use in the proposed condition-based maintenance approach. Note that because of the general character of the proposed maintenance optimisation approach, the degradation model and the chosen optimisation method that are used as illustration in this paper can easily be replaced by another one, depending on the needs of the user. A case study is performed, where a representative situation is considered using the developed approach and the maintenance approach currently used in practice. This case study shows how the approach works and what the cost reduction can be assuming that the models are accurate. The paper ends with a discussion and recommendations.