Pub Date : 2024-06-20DOI: 10.1016/j.ejcon.2024.101034
Giorgia Disarò, Maria Elena Valcher
In this paper we propose a data-driven approach to the design of reduced-order unknown-input observers (rUIOs). We first recall the model-based solution, by assuming a problem set-up slightly different from those traditionally adopted in the literature, in order to be able to easily adapt it to the data-driven scenario. Necessary and sufficient conditions for the existence of a reduced-order unknown-input observer, whose matrices can be derived from a sufficiently rich set of collected historical data, are first derived and then proved to be equivalent to the ones obtained in the model-based framework. Finally, a numerical example is presented, to validate the effectiveness of the proposed scheme.
{"title":"Data-driven reduced-order unknown-input observers","authors":"Giorgia Disarò, Maria Elena Valcher","doi":"10.1016/j.ejcon.2024.101034","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101034","url":null,"abstract":"In this paper we propose a data-driven approach to the design of reduced-order unknown-input observers (rUIOs). We first recall the model-based solution, by assuming a problem set-up slightly different from those traditionally adopted in the literature, in order to be able to easily adapt it to the data-driven scenario. Necessary and sufficient conditions for the existence of a reduced-order unknown-input observer, whose matrices can be derived from a sufficiently rich set of collected historical data, are first derived and then proved to be equivalent to the ones obtained in the model-based framework. Finally, a numerical example is presented, to validate the effectiveness of the proposed scheme.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510766","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}
Pub Date : 2024-06-19DOI: 10.1016/j.ejcon.2024.101033
Max van Haren, Kentaro Tsurumoto, Masahiro Mae, Lennart Blanken, Wataru Ohnishi, Tom Oomen
Iterative learning control (ILC) techniques are capable of improving the tracking performance of control systems that repeatedly perform similar tasks by utilizing data from past iterations. The aim of this paper is to achieve both the task flexibility enabled by ILC with basis functions and the performance of frequency-domain ILC, with an intuitive design procedure. The cost function of norm-optimal ILC is determined that recovers frequency-domain ILC, and consequently, the feedforward signal is parameterized in terms of basis functions and frequency-domain ILC. The resulting method has the performance and design procedure of frequency-domain ILC and the task flexibility of basis functions ILC, and are complimentary to each other. Validation on a benchmark example confirms the capabilities of the framework.
{"title":"A frequency-domain approach for enhanced performance and task flexibility in finite-time ILC","authors":"Max van Haren, Kentaro Tsurumoto, Masahiro Mae, Lennart Blanken, Wataru Ohnishi, Tom Oomen","doi":"10.1016/j.ejcon.2024.101033","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101033","url":null,"abstract":"Iterative learning control (ILC) techniques are capable of improving the tracking performance of control systems that repeatedly perform similar tasks by utilizing data from past iterations. The aim of this paper is to achieve both the task flexibility enabled by ILC with basis functions and the performance of frequency-domain ILC, with an intuitive design procedure. The cost function of norm-optimal ILC is determined that recovers frequency-domain ILC, and consequently, the feedforward signal is parameterized in terms of basis functions and frequency-domain ILC. The resulting method has the performance and design procedure of frequency-domain ILC and the task flexibility of basis functions ILC, and are complimentary to each other. Validation on a benchmark example confirms the capabilities of the framework.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510831","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}
Pub Date : 2024-06-19DOI: 10.1016/j.ejcon.2024.101056
Marc Seidel, Simon Lang, Frank Allgöwer
This paper considers control systems with failures in the feedback channel, that occasionally lead to loss of the control input signal. A useful approach for modeling such failures is to consider window-based constraints on possible loss sequences, for example that at least control attempts in every window of are successful. A powerful framework to model such constraints are weakly-hard real-time constraints. Various approaches for stability analysis and the synthesis of stabilizing controllers for such systems have been presented in the past. However, existing results are mostly limited to asymptotic stability and rarely consider performance measures such as the resulting -gain. To address this problem, we adapt a switched system description where the switching sequence is constrained by a graph that captures the loss information. We present an approach for -performance analysis involving linear matrix inequalities (LMI). Further, leveraging a system lifting method, we propose an LMI-based approach for synthesizing state-feedback controllers with guaranteed -performance. The results are illustrated by a numerical example.
{"title":"On [formula omitted]-performance of weakly-hard real-time control systems","authors":"Marc Seidel, Simon Lang, Frank Allgöwer","doi":"10.1016/j.ejcon.2024.101056","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101056","url":null,"abstract":"This paper considers control systems with failures in the feedback channel, that occasionally lead to loss of the control input signal. A useful approach for modeling such failures is to consider window-based constraints on possible loss sequences, for example that at least control attempts in every window of are successful. A powerful framework to model such constraints are weakly-hard real-time constraints. Various approaches for stability analysis and the synthesis of stabilizing controllers for such systems have been presented in the past. However, existing results are mostly limited to asymptotic stability and rarely consider performance measures such as the resulting -gain. To address this problem, we adapt a switched system description where the switching sequence is constrained by a graph that captures the loss information. We present an approach for -performance analysis involving linear matrix inequalities (LMI). Further, leveraging a system lifting method, we propose an LMI-based approach for synthesizing state-feedback controllers with guaranteed -performance. The results are illustrated by a numerical example.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141530138","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}
Pub Date : 2024-06-19DOI: 10.1016/j.ejcon.2024.101061
Michalis Ramp, Andreas Kasis, Charalambos Menelaou, Stelios Timotheou
This paper considers the stability and optimality properties of traffic demand management schemes, motivated by the integration of smart monitoring and control technologies in traffic networks. First, a suitable optimization problem is formulated that aims to obtain demand input values that maximize the throughput within traffic networks adhering to regional traffic dynamics with triangular macroscopic fundamental diagrams. We show that optimal solutions to this problem may lead to unstable behaviour, revealing a trade-off between stability and optimality. To address this issue, we analytically study the stability properties of traffic networks at the presence of constant demand input and provide suitable local conditions that guarantee stability when the system’s equilibrium densities are strictly within the free-flow region, but not at the critical density. The latter case is significant, since the maximum throughput behaviour coincides in many cases with the local critical density. We resolve this by proposing a decentralized proportional demand control scheme and suitable local design conditions such that stability is guaranteed. Our analytic results are validated with numerical simulations in a 3-region system that demonstrate the effectiveness and practicality of the proposed approach.
{"title":"Stability of regional traffic networks employing maximum throughput demand management","authors":"Michalis Ramp, Andreas Kasis, Charalambos Menelaou, Stelios Timotheou","doi":"10.1016/j.ejcon.2024.101061","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101061","url":null,"abstract":"This paper considers the stability and optimality properties of traffic demand management schemes, motivated by the integration of smart monitoring and control technologies in traffic networks. First, a suitable optimization problem is formulated that aims to obtain demand input values that maximize the throughput within traffic networks adhering to regional traffic dynamics with triangular macroscopic fundamental diagrams. We show that optimal solutions to this problem may lead to unstable behaviour, revealing a trade-off between stability and optimality. To address this issue, we analytically study the stability properties of traffic networks at the presence of constant demand input and provide suitable local conditions that guarantee stability when the system’s equilibrium densities are strictly within the free-flow region, but not at the critical density. The latter case is significant, since the maximum throughput behaviour coincides in many cases with the local critical density. We resolve this by proposing a decentralized proportional demand control scheme and suitable local design conditions such that stability is guaranteed. Our analytic results are validated with numerical simulations in a 3-region system that demonstrate the effectiveness and practicality of the proposed approach.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141577018","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}
Pub Date : 2024-06-18DOI: 10.1016/j.ejcon.2024.101047
Pieter van Goor, Punjaya Wickramasinghe, Matthew Hampsey, Robert Mahony
Inertial Navigation Systems (INS) estimate a vehicle’s navigation states (attitude, velocity, and position) by combining measurements from an Inertial Measurement Unit (IMU) with other supporting sensors, typically including a Global Navigation Satellite System (GNSS) and a magnetometer. Recent nonlinear observer designs for INS provide powerful stability guarantees but do not account for some of the real-world challenges of INS. One of the key challenges is to account for the time-delay characteristic of GNSS measurements. This paper addresses this question by extending recent work on synchronous observer design for INS. The delayed GNSS measurements are related to the state at the current time using recursively-computable delay matrices, and this is used to design correction terms that leads to almost-globally asymptotic and locally exponential stability of the error. Simulation results verify the proposed observer and show that the compensation of time-delay is key to both transient and steady-state performance.
惯性导航系统（INS）通过将惯性测量单元（IMU）的测量数据与其他支持传感器（通常包括全球导航卫星系统（GNSS）和磁力计）的测量数据相结合来估计车辆的导航状态（姿态、速度和位置）。最近针对 INS 的非线性观测器设计提供了强大的稳定性保证，但没有考虑到 INS 在现实世界中面临的一些挑战。其中一个主要挑战是如何考虑 GNSS 测量的时延特性。本文通过扩展最近有关 INS 同步观测器设计的工作来解决这一问题。利用可递归计算的延迟矩阵，将延迟的 GNSS 测量与当前时间的状态联系起来，并以此设计校正项，从而实现误差的几乎全局渐近稳定性和局部指数稳定性。仿真结果验证了所提出的观测器，并表明时间延迟补偿是瞬态和稳态性能的关键。
{"title":"Constructive synchronous observer design for inertial navigation with delayed GNSS measurements","authors":"Pieter van Goor, Punjaya Wickramasinghe, Matthew Hampsey, Robert Mahony","doi":"10.1016/j.ejcon.2024.101047","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101047","url":null,"abstract":"Inertial Navigation Systems (INS) estimate a vehicle’s navigation states (attitude, velocity, and position) by combining measurements from an Inertial Measurement Unit (IMU) with other supporting sensors, typically including a Global Navigation Satellite System (GNSS) and a magnetometer. Recent nonlinear observer designs for INS provide powerful stability guarantees but do not account for some of the real-world challenges of INS. One of the key challenges is to account for the time-delay characteristic of GNSS measurements. This paper addresses this question by extending recent work on synchronous observer design for INS. The delayed GNSS measurements are related to the state at the current time using recursively-computable delay matrices, and this is used to design correction terms that leads to almost-globally asymptotic and locally exponential stability of the error. Simulation results verify the proposed observer and show that the compensation of time-delay is key to both transient and steady-state performance.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510832","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}
Pub Date : 2024-06-17DOI: 10.1016/j.ejcon.2024.101064
Anders Hilmar Damm Christensen, John Bagterp Jørgensen
This paper compares the impact of iterated and direct approaches to sensitivity computation in fixed step-size explicit singly diagonally implicit Runge–Kutta (ESDIRK) methods when applied to optimal control problems (OCPs). We strictly use the principle of internal numerical differentiation (IND) for the iterated approach, i.e., reusing iteration matrix factorizations, the number of Newton-type iterations, and Newton iterates, to compute the sensitivities. The direct method computes the sensitivities without using the Newton schemes. We compare the impact of these sensitivity computations in OCPs for the quadruple tank system (QTS). We discretize the OCPs using multiple shooting and solve these with a sequential quadratic programming (SQP) solver. We benchmark the iterated and direct approaches against a base case. This base case applies the ESDIRK methods with exact Newton schemes and a direct approach for sensitivity computations. In these OCPs, we vary the number of integration steps between control intervals and evaluate the performance based on the number of SQP and QPs iterations, KKT violations, function evaluations, Jacobian updates, and iteration matrix factorizations. We also provide examples using the continuous-stirred tank reactor (CSTR), and the IPOPT algorithm instead of the SQP. For OCPs solved using SQP, the QTS results show the direct method converges only once, while the iterated approach and base case converges in all situations. Similar results are seen with the CSTR. Using IPOPT, both the iterated approach and base case converge in all cases. In contrast, the direct method only converges in all cases regarding the CSTR.
{"title":"A comparative study of sensitivity computations in ESDIRK-based optimal control problems","authors":"Anders Hilmar Damm Christensen, John Bagterp Jørgensen","doi":"10.1016/j.ejcon.2024.101064","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101064","url":null,"abstract":"This paper compares the impact of iterated and direct approaches to sensitivity computation in fixed step-size explicit singly diagonally implicit Runge–Kutta (ESDIRK) methods when applied to optimal control problems (OCPs). We strictly use the principle of internal numerical differentiation (IND) for the iterated approach, i.e., reusing iteration matrix factorizations, the number of Newton-type iterations, and Newton iterates, to compute the sensitivities. The direct method computes the sensitivities without using the Newton schemes. We compare the impact of these sensitivity computations in OCPs for the quadruple tank system (QTS). We discretize the OCPs using multiple shooting and solve these with a sequential quadratic programming (SQP) solver. We benchmark the iterated and direct approaches against a base case. This base case applies the ESDIRK methods with exact Newton schemes and a direct approach for sensitivity computations. In these OCPs, we vary the number of integration steps between control intervals and evaluate the performance based on the number of SQP and QPs iterations, KKT violations, function evaluations, Jacobian updates, and iteration matrix factorizations. We also provide examples using the continuous-stirred tank reactor (CSTR), and the IPOPT algorithm instead of the SQP. For OCPs solved using SQP, the QTS results show the direct method converges only once, while the iterated approach and base case converges in all situations. Similar results are seen with the CSTR. Using IPOPT, both the iterated approach and base case converge in all cases. In contrast, the direct method only converges in all cases regarding the CSTR.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510833","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}
Pub Date : 2024-06-17DOI: 10.1016/j.ejcon.2024.101048
Saket Adhau, Sébastien Gros, Sigurd Skogestad
This paper presents an end-to-end learning approach to developing a Nonlinear Model Predictive Control (NMPC) policy, which does not require an explicit first-principles model and assumes that the system dynamics are either unknown or partially known. The paper proposes the use of available measurements to identify a nominal Recurrent Neural Network (RNN) model to capture the nonlinear dynamics, which includes constraints on the state variables and inputs. To address the issue of suboptimal control policies resulting from simply fitting the model to the data, this paper uses Reinforcement learning (RL) to tune the NMPC scheme and generate an optimal policy for the real system. The approach’s novelty lies in the use of RL to overcome the limitations of the nominal RNN model and generate a more accurate control policy. The paper discusses the implementation aspects of initial state estimation for RNN models and integration of neural models in MPC. The presented method is demonstrated on a classic benchmark control problem: cascaded two tank system (CTS).
{"title":"Reinforcement learning based MPC with neural dynamical models","authors":"Saket Adhau, Sébastien Gros, Sigurd Skogestad","doi":"10.1016/j.ejcon.2024.101048","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101048","url":null,"abstract":"This paper presents an end-to-end learning approach to developing a Nonlinear Model Predictive Control (NMPC) policy, which does not require an explicit first-principles model and assumes that the system dynamics are either unknown or partially known. The paper proposes the use of available measurements to identify a nominal Recurrent Neural Network (RNN) model to capture the nonlinear dynamics, which includes constraints on the state variables and inputs. To address the issue of suboptimal control policies resulting from simply fitting the model to the data, this paper uses Reinforcement learning (RL) to tune the NMPC scheme and generate an optimal policy for the real system. The approach’s novelty lies in the use of RL to overcome the limitations of the nominal RNN model and generate a more accurate control policy. The paper discusses the implementation aspects of initial state estimation for RNN models and integration of neural models in MPC. The presented method is demonstrated on a classic benchmark control problem: cascaded two tank system (CTS).","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510834","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}
Pub Date : 2024-06-17DOI: 10.1016/j.ejcon.2024.101016
Bing Liu, Zhongmei Li, Wenli Du
The article proposes a fault-tolerant control approach for a series of uncertain linear parameter-varying (LPV) time-delay models to obtain disturbance suppressions. Specifically, by applying the Lyapunov functions, a series of feedback controllers are provided to ensure the robust performance of LPV models with actuator faults. Meanwhile, a convex optimization strategy is developed for resolving optimization problems in the presence of bilinear matrix inequalities (BMIs), where the robustness conditions are improved to guarantee the stability of LPV model under uncertain factors. By resolving a class of linear matrix inequalities (LMIs), the gain matrices for LPV systems can be obtained. Furthermore, the less conservative conditions are developed and supported by strict theoretical derivation. Ultimately, the validity of proposed approach is confirmed by simulation analyses of truck–trailer systems.
{"title":"A robust H∞ fault-tolerant control approach for time-delay LPV systems with uncertain parameters and unknown disturbances","authors":"Bing Liu, Zhongmei Li, Wenli Du","doi":"10.1016/j.ejcon.2024.101016","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101016","url":null,"abstract":"<div><p>The article proposes a <span><math><msub><mrow><mi>H</mi></mrow><mrow><mi>∞</mi></mrow></msub></math></span> fault-tolerant control approach for a series of uncertain linear parameter-varying (LPV) time-delay models to obtain disturbance suppressions. Specifically, by applying the Lyapunov functions, a series of feedback controllers are provided to ensure the robust performance of LPV models with actuator faults. Meanwhile, a convex optimization strategy is developed for resolving optimization problems in the presence of bilinear matrix inequalities (BMIs), where the robustness conditions are improved to guarantee the stability of LPV model under uncertain factors. By resolving a class of linear matrix inequalities (LMIs), the gain matrices for LPV systems can be obtained. Furthermore, the less conservative conditions are developed and supported by strict theoretical derivation. Ultimately, the validity of proposed approach is confirmed by simulation analyses of truck–trailer systems.</p></div>","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":2.5,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141542138","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}
Pub Date : 2024-06-17DOI: 10.1016/j.ejcon.2024.101037
Qingkai Meng, Andreas Kasis, Hao Yang, Marios M. Polycarpou
This paper studies the problem of secure state estimation of networked switched systems in the presence of denial-of-service (DoS) attacks, as well as disturbances and measurement noise. Firstly, a state transformation rule is designed to partition the original system into two subsystems, facilitating the design of discrete and continuous state observers. Secondly, by modifying the traditional super-twisting sliding-mode method and taking into account the frequency and duration characteristics of DoS attacks, we employ dynamic differential properties between different modes to design a switching law identification strategy. We show that this strategy can accurately estimate the switching state without imposing any requirement on the switching times and sequences. Thirdly, based on the identified activated mode, a set of mode-dependent continuous state sliding-mode observers is designed, that achieves continuous state estimation in finite time. The practicality and applicability of the developed results are validated through numerical simulations.
本文研究了存在拒绝服务（DoS）攻击以及干扰和测量噪声的网络交换系统的安全状态估计问题。首先，本文设计了一种状态变换规则，将原始系统划分为两个子系统，从而方便设计离散和连续状态观测器。其次，通过修改传统的超扭曲滑动模式方法，并考虑到 DoS 攻击的频率和持续时间特征，我们利用不同模式之间的动态差分特性设计了一种切换规律识别策略。我们的研究表明，这种策略可以准确估计切换状态，而无需对切换时间和顺序提出任何要求。第三，基于识别出的激活模式，我们设计了一组与模式相关的连续状态滑动模式观测器，可在有限时间内实现连续状态估计。通过数值模拟验证了所开发成果的实用性和适用性。
{"title":"Secure state estimation of networked switched systems under denial-of-service attacks","authors":"Qingkai Meng, Andreas Kasis, Hao Yang, Marios M. Polycarpou","doi":"10.1016/j.ejcon.2024.101037","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101037","url":null,"abstract":"This paper studies the problem of secure state estimation of networked switched systems in the presence of denial-of-service (DoS) attacks, as well as disturbances and measurement noise. Firstly, a state transformation rule is designed to partition the original system into two subsystems, facilitating the design of discrete and continuous state observers. Secondly, by modifying the traditional super-twisting sliding-mode method and taking into account the frequency and duration characteristics of DoS attacks, we employ dynamic differential properties between different modes to design a switching law identification strategy. We show that this strategy can accurately estimate the switching state without imposing any requirement on the switching times and sequences. Thirdly, based on the identified activated mode, a set of mode-dependent continuous state sliding-mode observers is designed, that achieves continuous state estimation in finite time. The practicality and applicability of the developed results are validated through numerical simulations.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141510835","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}
Pub Date : 2024-06-17DOI: 10.1016/j.ejcon.2024.101066
M. Batu Özmeteler, Deborah Bilgic, Guanru Pan, Alexander Koch, Timm Faulwasser
Stochastic predictive control schemes that account for epistemic and aleatoric uncertainties, i.e. lack of model knowledge and stochastic disturbances, are of major interest for multi-energy systems. However, there exists a trade-off between model complexity, computational effort, and accuracy of uncertainty quantification. This paper attempts to assess this trade-off by comparing a recently proposed approach combining Willems’ fundamental lemma with polynomial chaos expansion to a model-based scheme that first propagates uncertainty with PCE and then considers chance constraints in the optimization. The simulation results show that the data-driven scheme yields similar performance and computational efficiency compared to the model-based scheme, with the advantage of avoiding the construction of explicit models.
{"title":"Data-driven uncertainty propagation for stochastic predictive control of multi-energy systems","authors":"M. Batu Özmeteler, Deborah Bilgic, Guanru Pan, Alexander Koch, Timm Faulwasser","doi":"10.1016/j.ejcon.2024.101066","DOIUrl":"https://doi.org/10.1016/j.ejcon.2024.101066","url":null,"abstract":"Stochastic predictive control schemes that account for epistemic and aleatoric uncertainties, i.e. lack of model knowledge and stochastic disturbances, are of major interest for multi-energy systems. However, there exists a trade-off between model complexity, computational effort, and accuracy of uncertainty quantification. This paper attempts to assess this trade-off by comparing a recently proposed approach combining Willems’ fundamental lemma with polynomial chaos expansion to a model-based scheme that first propagates uncertainty with PCE and then considers chance constraints in the optimization. The simulation results show that the data-driven scheme yields similar performance and computational efficiency compared to the model-based scheme, with the advantage of avoiding the construction of explicit models.","PeriodicalId":50489,"journal":{"name":"European Journal of Control","volume":null,"pages":null},"PeriodicalIF":3.4,"publicationDate":"2024-06-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141722045","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：