Ke Wang , Prathyush P. Menon , Joost Veenman , Samir Bennani
{"title":"Estimation of region of attraction with Gaussian process classification","authors":"Ke Wang , Prathyush P. Menon , Joost Veenman , Samir Bennani","doi":"10.1016/j.ejcon.2023.100856","DOIUrl":"10.1016/j.ejcon.2023.100856","url":null,"abstract":"<div><p>This paper proposes a methodology for assessing the region of attraction (ROA) of stable equilibrium points, a challenging problem for a general nonlinear system, using binary Gaussian process classification (GPC). Interest in this method stems from the fact that an arbitrary point belonging to the system’s state space can be classified in the region of attraction or not. Importantly the proposed GPC approach for determining ROA gives a minimum confidence level associated with the estimate. Moreover, the active learning scheme helps to update the GPC model and yield better predictions by selecting informative observations from the state space sequentially. The methodology is applied to several examples to illustrate the effectiveness of this approach.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100856"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0947358023000857/pdfft?md5=d85a18b0a17af367f95975674a1aa103&pid=1-s2.0-S0947358023000857-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43823372","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Estimating pollution spread in water networks as a Schrödinger bridge problem with partial information","authors":"Michele Mascherpa , Isabel Haasler , Bengt Ahlgren , Johan Karlsson","doi":"10.1016/j.ejcon.2023.100846","DOIUrl":"10.1016/j.ejcon.2023.100846","url":null,"abstract":"<div><p>Incidents where water networks are contaminated with microorganisms or pollutants can result in a large number of infected or ill persons, and it is therefore important to quickly detect, localize and estimate the spread and source of the contamination. In many of today’s water networks only limited measurements are available, but with the current internet of things trend the number of sensors is increasing and there is a need for methods that can utilize this information. Motivated by this fact, we address the problem of estimating the spread of pollution in a water network given measurements from a set of sensors. We model the water flow as a Markov chain, representing the system as a set of states where each state represents the amount of water in a specific part of the network, e.g., a pipe or a part of a pipe. Then we seek the most likely flow of the pollution given the expected water flow and the sensors observations. This is a large-scale optimization problem that can be formulated as a Schrödinger bridge problem with partial information, and we address this by exploiting the connection with the entropy regularized multimarginal optimal transport problem. The software EPANET is used to simulate the spread of pollution in the water network and will be used for testing the performance of the methodology.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100846"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0947358023000754/pdfft?md5=4a88d62e0de08c61f02e905377eb8813&pid=1-s2.0-S0947358023000754-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"42948805","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"An adaptive constrained clustering approach for real-time fault detection of industrial systems","authors":"Bahman Askari , Augusto Bozza , Graziana Cavone , Raffaele Carli , Mariagrazia Dotoli","doi":"10.1016/j.ejcon.2023.100858","DOIUrl":"10.1016/j.ejcon.2023.100858","url":null,"abstract":"<div><p><span>Thanks to the pervasive deployment of sensors in Industry 4.0, data-driven methods are recently playing an important role in the fault diagnosis and prognosis of industrial systems. In this paper, a novel Adaptive Constrained Clustering algorithm is defined to support real-time fault detection of an industrial machine, by clustering the incoming monitoring data into two clusters over time, representing the nominal and non-nominal work conditions, respectively. To this aim, the proposed algorithm relies on a two-stage procedure: </span><em>micro-clustering</em> and <em>constrained macro-clustering</em>. The former stage is responsible for grouping the batches of work-cycle data into <em>micro-clusters</em>, while the data stream continuously arrives from the data acquisition system. Then, after condensing the micro-clusters into vectors of cluster features, and leveraging on additional knowledge on the nominal and non-nominal working conditions (i.e., constraints on some samples), the second stage aims at offline grouping the micro-clusters features into <em>macro-clusters</em>. Experimental results on a real-world industrial case study show that the proposed real time framework achieves the same results of offline baseline methods (e.g., Constrained <em>K</em>-means) with a higher responsiveness and processing speed; in comparison to stream baseline methods (e.g., Stream <em>K</em>-means), the proposed approach obtains more accurate and easily interpretable results.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100858"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44957353","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Distance problems in the behavioral setting","authors":"Antonio Fazzi , Ivan Markovsky","doi":"10.1016/j.ejcon.2023.100832","DOIUrl":"10.1016/j.ejcon.2023.100832","url":null,"abstract":"<div><p>Motivated by the <em>distance to uncontrollability</em> problem, we define a distance between finite-length linear time-invariant behaviors. The method proposed in this paper for computing the distance exploits the principal angles associated with structured matrices representing the systems.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100832"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0947358023000614/pdfft?md5=3fd3f5032f72eb277f50186b11649b85&pid=1-s2.0-S0947358023000614-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"44475580","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Pietro De Lellis , Fabio Della Rossa , Francesco Lo Iudice , Davide Liuzza
{"title":"Pinning control of linear systems on hypergraphs","authors":"Pietro De Lellis , Fabio Della Rossa , Francesco Lo Iudice , Davide Liuzza","doi":"10.1016/j.ejcon.2023.100836","DOIUrl":"10.1016/j.ejcon.2023.100836","url":null,"abstract":"<div><p>When steering the dynamics of network systems, the control design needs to cope with constraints on actuation and sensing, which often imply that the same control input is injected to each node in a given subset, and this input signal is a function of the state of this node subset. This common situation cannot be modeled in terms of standard pairwise interactions on digraphs, and we propose to use directed hypergraphs as the mathematical object suitable to describe this kind of directed, multibody interactions. We apply this framework to the pinning control problem in networks of coupled linear systems, and derive necessary and sufficient conditions for convergence onto the desired trajectory set by the pinner. Furthermore, we provide a dedicated control algorithm to identify the interconnections that are critical for network control.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100836"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0947358023000651/pdfft?md5=6800c2bddc543c7c4dc06ce3ca56d79a&pid=1-s2.0-S0947358023000651-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"47606745","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Safe learning-based model predictive control using the compatible models approach","authors":"Anas Makdesi , Antoine Girard , Laurent Fribourg","doi":"10.1016/j.ejcon.2023.100849","DOIUrl":"10.1016/j.ejcon.2023.100849","url":null,"abstract":"<div><p>In this paper, we introduce a novel approach to safe learning-based Model Predictive Control<span> (MPC) for nonlinear systems<span>. This approach, which we call the “compatible model approach”, relies on computing two models of the given unknown system using data generated from the system. The first model is a set-valued over-approximation guaranteed to contain the system’s dynamics. This model is used to find a set of provably safe controller actions at every state. The second model is a single-valued estimation of the system’s dynamics used to find a controller that minimises a cost function. If the two models are compatible, in the sense that the estimation is included in the over-approximation, we show that we can use the set of safe controller actions to constrain the minimisation problem and guarantee the feasibility and safety of the learning-based MPC controller at all times. We present a method to build an over-approximation for nonlinear systems with bounded derivatives on a partition of the states and inputs spaces. Then, we use piecewise multi-affine functions (defined on the same partition) to calculate a system’s dynamics estimation that is compatible with the previous over-approximation. Finally, we show the effectiveness of the approach by considering a path-planning problem with obstacle avoidance.</span></span></p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100849"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43939110","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Decentralized fixed-time uniform ISS stabilization of infinite networks of switched nonlinear systems with arbitrary switchings by small gain approach","authors":"Svyatoslav Pavlichkov, Naim Bajcinca","doi":"10.1016/j.ejcon.2023.100864","DOIUrl":"10.1016/j.ejcon.2023.100864","url":null,"abstract":"<div><p>We prove a new theorem on <span><math><msub><mi>ℓ</mi><mi>∞</mi></msub></math></span><span>-fixed-time uniform ISS decentralized stabilization of infinite networks composed of interconnected switched nonlinear systems with unknown switching signals. Each subsystem has the lower-triangular form with uncontrollable linearization, more specifically, it has the lower-triangular form with the so-called “generalized polynomial integrators”. To solve this problem, we use a new small gain theorem on </span><span><math><msub><mi>ℓ</mi><mi>∞</mi></msub></math></span>-fixed-time uniform input-to-state stability of infinite networks and redesign several previous backstepping algorithms of decentralized stabilization. In particular, our main result generalizes several recent related ones.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100864"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"43321087","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
{"title":"Optimal regulator for a class of nonlinear stochastic systems with random coefficients","authors":"Mashael Algoulity , Bujar Gashi","doi":"10.1016/j.ejcon.2023.100844","DOIUrl":"10.1016/j.ejcon.2023.100844","url":null,"abstract":"<div><p><span>We consider an optimal regulator problem for a class of nonlinear stochastic systems with a </span><em>square-root</em> nonlinearity and <em>random</em> coefficients, and using the quadratic-linear criterion. This represents a certain nonlinear generalisation of the stochastic linear-quadratic control problem with random coefficients. The solution if found in an explicit closed-form as an <em>affine state-feedback</em><span> control in terms of a Riccati and linear backward stochastic differential equations. As an application, we give the solution to an optimal investment problem in a market with random coefficients.</span></p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100844"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48279541","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Jakob Harzer , Jochem De Schutter , Moritz Diehl , Johan Meyers
{"title":"Dynamic soaring in wind turbine wakes","authors":"Jakob Harzer , Jochem De Schutter , Moritz Diehl , Johan Meyers","doi":"10.1016/j.ejcon.2023.100842","DOIUrl":"10.1016/j.ejcon.2023.100842","url":null,"abstract":"<div><p><span>Dynamic soaring for UAVs<span><span> is a flight technique that enables continuous, powerless periodic flight patterns in the presence of a wind gradient. However, sufficiently large wind gradients are uncommon over land, while at offshore locations the largest wind gradients are located close to the ocean surface, thereby limiting the scope of practical application. An intrinsic feature of </span>wind turbines<span> is that they inherently produce very sharp wind gradients in the near wake. Therefore, in this paper, we propose and investigate periodic stationary dynamic soaring trajectories in the near wake of wind turbines. We additionally consider the potential of dynamic soaring for revitalizing the wind turbine wake. To this end, we apply periodic optimal control based on a simplified model for the glider dynamics and the wind profile in the wake. The cost function maximizes the revitalization of the wake. We compute optimal orbits for a range of different wing spans and different mass-scaling assumptions. The largest glider configuration, with a wingspan of 10 m and a mass of 222.6 kg, achieves a wake revitalization of about 0.94</span></span></span><span><math><mo>%</mo></math></span> of the total turbine thrust.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100842"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48335830","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
Amon Lahr, Andrea Zanelli, Andrea Carron, Melanie N. Zeilinger
{"title":"Zero-order optimization for Gaussian process-based model predictive control","authors":"Amon Lahr, Andrea Zanelli, Andrea Carron, Melanie N. Zeilinger","doi":"10.1016/j.ejcon.2023.100862","DOIUrl":"10.1016/j.ejcon.2023.100862","url":null,"abstract":"<div><p>By enabling constraint-aware online model adaptation, model predictive control using Gaussian process (GP) regression has exhibited impressive performance in real-world applications and received considerable attention in the learning-based control community. Yet, solving the resulting optimal control problem in real-time generally remains a major challenge, due to (i) the increased number of augmented states in the optimization problem, as well as (ii) computationally expensive evaluations of the posterior mean and covariance and their respective derivatives. To tackle these challenges, we employ (i) a tailored Jacobian approximation in a sequential quadratic programming (SQP) approach and combine it with (ii) a parallelizable GP inference and automatic differentiation framework. Reducing the numerical complexity with respect to the state dimension <span><math><msub><mi>n</mi><mi>x</mi></msub></math></span> for each SQP iteration from <span><math><mrow><mi>O</mi><mo>(</mo><msubsup><mi>n</mi><mi>x</mi><mn>6</mn></msubsup><mo>)</mo></mrow></math></span> to <span><math><mrow><mi>O</mi><mo>(</mo><msubsup><mi>n</mi><mi>x</mi><mn>3</mn></msubsup><mo>)</mo></mrow></math></span>, and accelerating GP evaluations on a graphical processing unit, the proposed algorithm computes suboptimal, yet feasible, solutions at drastically reduced computation times and exhibits favorable local convergence properties. Numerical experiments verify the scaling properties and investigate the runtime distribution across different parts of the algorithm.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":"74 ","pages":"Article 100862"},"PeriodicalIF":3.4,"publicationDate":"2023-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S0947358023000912/pdfft?md5=9dd7d9ddc254ef0cea7eea581f86ab23&pid=1-s2.0-S0947358023000912-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"48101261","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}