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.

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.

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.

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.

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.

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.

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.

Learning-based control, in particularReinforcement Learning (RL) reinforcementReinforcement learning, and optimization-based control, in particular model predictive control, each have their advantages and disadvantages for online, real-timeOptimal control optimal controlOptimal control of systems with complex dynamicsDynamic. However, both approaches are highly complementary and therefore there is an increased interest in combining their advantages in an integrated approach. In this chapter, we provide an overview of recent results, challenges, and opportunities on an integrated learning-based and optimization-based control approach. We focus in particular on piecewise affine systems as they are an extension of linear systemsLinear systems that can model or approximate hybridHybrid or nonlinearNonlinearbehaviorBehavior and as they still allow for effective numerical solutionSolution approaches.

In this paper, the disjunctive and conjunctive lattice piecewise affine (PWA) approximations of explicit linear model predictive control (MPC) are proposed. Training data consisting of states and corresponding affine control laws are generated in a control invariant set, and redundant sample points are removed to simplify the construction of lattice PWA approximations. Resampling is proposed to guarantee the equivalence of lattice PWA approximations and optimal MPC control law at the sample points. Under certain conditions, the disjunctive lattice PWA approximation constitutes a lower bound, while the conjunctive version formulates an upper bound of the original optimal control law. The equivalence of the two lattice PWA approximations then guarantees error-free approximations in the domain of interest, which is tested through a statistical guarantee. The performance of the proposed approximation strategy is tested through two simulation examples, and the results show that error-free lattice PWA approximations can be obtained with low offline complexity and small storage requirements. Besides, the online complexity is less compared with the state-of-the-art method.

Uncertainty in the behavior of other traffic participants is a crucial factor in collision avoidance for automated driving; here, stochastic metrics could avoid overly conservative decisions. This article introduces a stochastic model predictive control (SMPC) planner for emergency collision avoidance in highway scenarios to proactively minimize collision risk while ensuring safety through chance constraints. To guarantee that the emergency trajectory can be attained, we incorporate nonlinear tire dynamics in the prediction model of the ego vehicle. Further, we exploit max-min-plus-scaling (MMPS) approximations of the nonlinearities to avoid conservatism, enforce proactive collision avoidance, and improve computational efficiency in terms of performance and speed. Consequently, our contributions include integrating a dynamic ego vehicle model into the SMPC planner, introducing the MMPS approximation for real-time implementation in emergency scenarios, and integrating SMPC with hybridized chance constraints and risk minimization. We evaluate our SMPC formulation in terms of proactivity and efficiency in various hazardous scenarios. Moreover, we demonstrate the effectiveness of our proposed approach by comparing it with a state-of-the-art SMPC planner and we validate that the generated trajectories can be attained using a high-fidelity vehicle model in IPG CarMaker.

This paper presents a novel approach for distributed model predictive control (MPC) for piecewise affine (PWA) systems. Existing approaches rely on solving mixed-integer optimization problems, requiring significant computation power or time. We propose a distributed MPC scheme that requires solving only convex optimization problems. The key contribution is a novel method, based on the alternating direction method of multipliers, for solving the non-convex optimal control problem that arises due to the PWA dynamics. We present a distributed MPC scheme, leveraging this method, that explicitly accounts for the coupling between subsystems by reaching agreement on the values of coupled states. Stability and recursive feasibility are shown under additional assumptions on the underlying system. Two numerical examples are provided, in which the proposed controller is shown to significantly improve the CPU time and closed-loop performance over existing state-of-the-art approaches.

Marine litter pollution is a major environmental threat due to the widespread presence of plastics and their detrimental impact on marine life and human health. There is a need for autonomous systems with computer vision to help clean the oceans. This study compares the latest state-of-the-art You Only Look Once (YOLO) models YOLOv9 - YOLOv12 in an underwater object detection setting in terms of accuracy, computational speed, and architecture complexity. We specifically focus on the smallest versions of these architectures, due to the real-time constraints of the setting. Multiple underwater datasets are combined to obtain a wide representation of underwater conditions and marine objects. The findings provide valuable insights into selecting and optimizing object detection architectures for underwater litter detection, contributing to monitoring marine ecosystems and addressing marine pollution. This work can be used as a building ground for further improving underwater object detection systems.

In practice, achieving a balance between accuracy, stability, and computational efficiency in modeling contaminant dispersion in marine environments remains challenging due to complex physical dynamics and numerical constraints. To address these challenges, an enhanced cell-based model (CBM) is developed and applied to simulate pollutant transport in the ocean. The CBM discretizes the spatial domain into uniform cells, resulting in a naturally parallelizable structure, and characterizes the transport process by incorporating both water flow-driven convection and diffusion effects. Moreover, two approaches are proposed for estimating the diffusion coefficient, and their performance is compared to a first-order upwind scheme finite-difference method (FDM) solution. Finally, the CBM is comprehensively compared with both the FDM and the finite-element method (FEM) solvers under varying spatial and temporal resolutions. Simulation results show that the CBM is less affected by the Courant-Friedrichs-Lewy (CFL) conditions and demonstrates stable convergence where the FDM fails or requires stricter settings. In addition, the CBM offers a favorable trade-off between accuracy and computational efficiency under coarse configurations. These results indicate that the CBM provides a reliable foundation for dynamic modeling and integration with learning-based frameworks in marine environment simulations.

Temperature plays a critical role in performance and stability of anaerobic digestion processes, subject to frequent meteorological fluctuations. However, state-of-the-art modeling and process control approaches for anaerobic digestion often do not consider the temporal dynamics of the temperature, which can influence microbial communities, kinetics, and chemical equilibrium, and consequently, biogas production efficiency. Therefore, to account for anaerobic digesters operating under fluctuating meteorological conditions, the Anaerobic Digestion Model no. 1 (ADM1) is mechanistically extended in this paper to incorporate temporal changes into temperature-dependent parameters by defining inhibition functions for microbial activities using the cardinal temperature model, and accounting for the lag in microbial adaptation to temperature fluctuations using a time-lag adaptation function. Thereafter, given that temperature fluctuations are a significant disturbance, a control framework based on Model Predictive Control (MPC) is developed to regulate the feeding flow rate and to ensure stable production rates despite temperature disturbances without relying on direct temperature control. An adaptive MPC approach is formulated based on a linear input–output model, where the parameters of the linear model are updated online to capture the nonlinear dynamics of the process and frequent changes in the dynamics accurately. In addition, a fuzzy logic system is employed to assign a reference trajectory for the production rate based on the temperature and its rate of change. Integrating this fuzzy logic system with the MPC controller enhances the production rate on warm days and avoids the operational failure in production on cold days. Additionally, to enhance biogas production rates, the feasibility of utilizing a portion of the produced biogas for external heating purposes is also investigated. It is demonstrated that by utilizing the proposed MPC approach, the additional amount of feed for the digester to produce methane required for a self-consumption biogas-fueled heating system can be calculated according to the meteorological variations. This enhances the process performance and stability. Finally, a thermally optimized dome digester semi-buried in the ground, operating under climate conditions of The Netherlands is considered as a case study to validate the extended model in agreement with biological and physicochemical behaviors of real-world applications, and to demonstrate the effectiveness of the proposed control system in handling temperature changes and enhancing performance.

Co-optimization of both vehicle speed and gear position via model predictive control (MPC) has been shown to offer benefits for fuel-efficient autonomous driving. However, optimizing both the vehicle’s continuous dynamics and discrete gear positions may be too computationally intensive for a real-time implementation. This work proposes a learning-based MPC scheme to address this issue. A policy is trained to select and fix the gear positions across the prediction horizon of the MPC controller, leaving a significantly simpler continuous optimization problem to be solved online. In simulation, the proposed approach is shown to have a significantly lower computation burden and a comparable performance, with respect to pure MPC-based co-optimization.

Implementing model predictive control (MPC) in practice faces many subtle but prevalent problems, including modeling errors, solver errors, and actuator faults. In essence, the real control input applied to the system always deviates from the ideal one based on a perfect controller, resulting in an imperfect controller. In this letter, we provide a general analysis to quantify the suboptimality of MPC for Lipschitz-continuous nonlinear systems due to imperfect control inputs in terms of dynamic regret. Based on a general assumption about how the imperfect controller may improve over time, sublinear regret upper bounds are established for cases where the closed-loop system under the ideal controller is Lipschitz-contractive (i.e., its Lipschitz constant is smaller than one). In addition, we also discuss how the regret scales when the closed-loop system under the oracle controller is not Lipschitz-contractive. The results provide insights into designing suitable MPC strategies, especially for learning-based MPC.