Systems & Control Letters最新文献

英文中文

On computation of approximate solutions to large-scale backstepping kernel equations via continuum approximation

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.105982

Jukka-Pekka Humaloja, Nikolaos Bekiaris-Liberis

We provide two methods for computation of continuum backstepping kernels that arise in control of continua (ensembles) of linear hyperbolic PDEs and which can approximate backstepping kernels arising in control of a large-scale, PDE system counterpart (with computational complexity that does not grow with the number of state components of the large-scale system). In the first method, we provide explicit formulae for the solution to the continuum kernels PDEs, employing a (triple) power series representation of the continuum kernel and establishing its convergence properties. In this case, we also provide means for reducing computational complexity by properly truncating the power series (in the powers of the ensemble variable). In the second method, we identify a class of systems for which the solution to the continuum (and hence, also an approximate solution to the respective large-scale) kernel equations can be constructed in closed form. We also present numerical examples to illustrate computational efficiency/accuracy of the approaches, as well as to validate the stabilization properties of the approximate control kernels, constructed based on the continuum.

{"title":"On computation of approximate solutions to large-scale backstepping kernel equations via continuum approximation","authors":"Jukka-Pekka Humaloja, Nikolaos Bekiaris-Liberis","doi":"10.1016/j.sysconle.2024.105982","DOIUrl":"10.1016/j.sysconle.2024.105982","url":null,"abstract":"<div><div>We provide two methods for computation of continuum backstepping kernels that arise in control of continua (ensembles) of linear hyperbolic PDEs and which can approximate backstepping kernels arising in control of a large-scale, PDE system counterpart (with computational complexity that does not grow with the number of state components of the large-scale system). In the first method, we provide explicit formulae for the solution to the continuum kernels PDEs, employing a (triple) power series representation of the continuum kernel and establishing its convergence properties. In this case, we also provide means for reducing computational complexity by properly truncating the power series (in the powers of the ensemble variable). In the second method, we identify a class of systems for which the solution to the continuum (and hence, also an approximate solution to the respective large-scale) kernel equations can be constructed in closed form. We also present numerical examples to illustrate computational efficiency/accuracy of the approaches, as well as to validate the stabilization properties of the approximate control kernels, constructed based on the continuum.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 105982"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182995","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}

引用次数: 0

Exponential stabilization of linear systems using nearest-action control with countable input set

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.105992

Muhammad Zaki Almuzakki , Bayu Jayawardhana , Aneel Tanwani , Antonis I. Vakis

This paper studies stabilization of linear time-invariant (LTI) systems when control actions can only be realized in finitely many directions where it is possible to actuate uniformly or logarithmically extended positive scaling factors in each direction. Furthermore, a nearest-action selection approach is used to map the continuous measurements to a realizable action where we show that the approach satisfies a weak sector condition for multiple-input multiple-output (MIMO) systems. Using the notion of input-to-state stability, under some assumptions imposed on the transfer function of the system, we show that the closed-loop system converges to the target ball exponentially fast. Moreover, when logarithmic extension for the scaling factors is realizable, the closed-loop system is able to achieve asymptotic stability instead of only practical stability. Finally, we present an example of the application that confirms our analysis.

引用次数: 0

The minimal hitting probability of continuous-time controlled Markov systems with countable states 状态可数的连续时间受控马尔可夫系统的最小命中概率

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.106002

Yanyun Li , Junping Li

This paper concentrates on the minimal hitting probability of continuous-time controlled Markov systems (CTCMSs) with countable state and finite admissible action spaces. The existence of an optimal policy is first proved. In particular, for a special and important case of controlled branching processes (CBPs), it is proved that the minimal hitting probability is the unique solution to an improved optimal system of equations. Furthermore, a novel and precise improved-policy iteration algorithm of an optimal policy and the minimal hitting probability (minimal extinction probability) is presented for CBPs.

引用次数: 0

The delay feedback control for the McKean–Vlasov stochastic differential equations with common noise

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.105993

Xing Chen , Xiaoyue Li , Chenggui Yuan

Since response lags are essential in the feedback loops and are required by most physical systems, it is more appropriate to stabilize McKean–Vlasov stochastic differential equations (MV-SDEs) with common noise through the implementation of delay feedback control mechanisms. The aim of this paper is to design delay feedback control functions such that the controlled system is bounded in infinite horizon and further exponentially stable in the mean square. The designed controller, which depends only on the system state is easier to implement than that in Wu et al. (2022) which was designed to depend on both system state and measure. The existence and uniqueness of the global solution of the controlled system is proved. The Itô formula in both state and measure is derived. The proposed delay feedback control strategies are rendered viable for effective stabilization of MV-SDEs with common noise. Furthermore, the moment Lyapunov exponent, which is intricately linked to the time delays, is meticulously estimated.

由于响应滞后在反馈回路中至关重要，而且大多数物理系统都需要响应滞后，因此通过实施延迟反馈控制机制来稳定具有普通噪声的麦金-弗拉索夫随机微分方程（MV-SDE）更为合适。本文的目的是设计延迟反馈控制函数，使被控系统在无限视界内是有界的，并进一步在均方上呈指数稳定。所设计的控制器只取决于系统状态，比 Wu 等人（2022 年）设计的同时取决于系统状态和测量值的控制器更容易实现。证明了受控系统全局解的存在性和唯一性。推导出了状态和度量的 Itô 公式。所提出的延迟反馈控制策略对于具有普通噪声的 MV-SDEs 的有效稳定是可行的。此外，还细致地估算了与时间延迟密切相关的矩 Lyapunov 指数。

引用次数: 0

Event-triggered predefined-time distributed optimization algorithm based on zero-gradient-sum

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2025.106019

Ge Guo , Xinxin Zhang , Renyongkang Zhang , Jian Kang

This paper presents an event-triggered distributed optimization (DO) algorithm for consensus constraints and strongly convex local cost functions. The algorithm is derived by means of the zero-gradient-sum mechanism and sliding mode control, which is free from any initial conditions or local minimization. In order to avoid continuous communication and measurement, our algorithm enables the interaction between agents solely at event-triggered instants, resulting in conserving communication resources. Importantly, the proposed method drives system to the optimal consensus state within a predefined time. Simulation results demonstrate the effectiveness of our approach.

引用次数: 0

Finite-time safe control of probabilistic Boolean networks: An event-triggered approach

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.106012

Shao Shao , Linying Xiang , Fei Chen

This paper explores finite-time safe control in probabilistic Boolean control networks (PBCNs) through event-triggered control (ETC), presenting necessary and sufficient conditions as a set-based testing framework for problem solvability under ETC. Despite the unsolvability of the safe control problem in PBCNs with non-intermittent feedback controllers, ETC offers a potential solution. The paper contributes an algorithm to calculate the feasible triggering set and corresponding feedback gain matrices. An illustrative example is included to highlight the practical effectiveness of the proposed approach.

引用次数: 0

Approximate linear programming for decentralized policy iteration in cooperative multi-agent Markov decision processes

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.106003

Lakshmi Mandal , Chandrashekar Lakshminarayanan , Shalabh Bhatnagar

In this work, we consider a ‘cooperative’ multi-agent Markov decision process (MDP) involving

m (> 1)

agents. At each decision epoch, all the

m

agents independently select actions in order to minimize a common long-term cost objective. In the policy iteration process of multi-agent setup, the number of actions grows exponentially with the number of agents, incurring huge computational costs. Thus, recent works consider decentralized policy improvement, where each agent improves its decisions unilaterally, assuming that the decisions of the other agents are fixed. However, exact value functions are considered in the literature, which is computationally expensive for a large number of agents with high dimensional state–action space. Thus, we propose approximate decentralized policy iteration algorithms, using approximate linear programming with function approximation to compute the approximate value function for decentralized policy improvement. Further, we consider (both) cooperative multi-agent finite and infinite horizon discounted MDPs and propose suitable algorithms in each case. Moreover, we provide theoretical guarantees for our algorithms and also demonstrate their advantages over existing state-of-the-art algorithms in the literature.

{"title":"Approximate linear programming for decentralized policy iteration in cooperative multi-agent Markov decision processes","authors":"Lakshmi Mandal , Chandrashekar Lakshminarayanan , Shalabh Bhatnagar","doi":"10.1016/j.sysconle.2024.106003","DOIUrl":"10.1016/j.sysconle.2024.106003","url":null,"abstract":"<div><div>In this work, we consider a ‘cooperative’ multi-agent Markov decision process (MDP) involving <span><math><mrow><mi>m</mi><mrow><mo>(</mo><mo>></mo><mn>1</mn><mo>)</mo></mrow></mrow></math></span> agents. At each decision epoch, all the <span><math><mi>m</mi></math></span> agents independently select actions in order to minimize a common long-term cost objective. In the policy iteration process of multi-agent setup, the number of actions grows exponentially with the number of agents, incurring huge computational costs. Thus, recent works consider decentralized policy improvement, where each agent improves its decisions unilaterally, assuming that the decisions of the other agents are fixed. However, exact value functions are considered in the literature, which is computationally expensive for a large number of agents with high dimensional state–action space. Thus, we propose approximate decentralized policy iteration algorithms, using approximate linear programming with function approximation to compute the approximate value function for decentralized policy improvement. Further, we consider (both) cooperative multi-agent finite and infinite horizon discounted MDPs and propose suitable algorithms in each case. Moreover, we provide theoretical guarantees for our algorithms and also demonstrate their advantages over existing state-of-the-art algorithms in the literature.</div></div>","PeriodicalId":49450,"journal":{"name":"Systems & Control Letters","volume":"196 ","pages":"Article 106003"},"PeriodicalIF":2.1,"publicationDate":"2025-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143182988","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}

引用次数: 0

Maximum correntropy recursive three-step filter

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.106006

Yike Zhang , Xinmin Song , Wei Xing Zheng

Recursive three-step filters are often used for state estimation of systems with unknown input direct feedthrough, that is, systems where the unknown input simultaneously affect the state equation and measurement equation. However, when the system is disturbed by non-Gaussian noise, especially heavy-tailed impulsive noise, the performance of such recursive three-step filters will deteriorate. This paper proposes a maximum correntropy recursive three-step filter that can effectively handle non-Gaussian measurement noise pollution. The derivation of this filter is based on the traditional recursive three-step filter and utilizes a maximum correntropy criterion and a fixed-point iterative algorithm to simultaneously estimate the unknown input and state. It is shown that when the kernel bandwidths approach infinity, the derived maximum correntropy recursive three-step filter will degenerate into the traditional recursive three-step filter. Finally, the effectiveness and reliability of the proposed algorithm are demonstrated through simulation experiments.

引用次数: 0

Command governor schemes for dynamical systems subject to rate-bounded disturbances

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.106015

Francesco Tedesco, Gianfranco Gagliardi, Alessandro Casavola

This paper extends the well-known Command Governor (CG) scheme to the case of rate-bounded persistent disturbances acting as exogenous signals on the plant. The methodology is founded on a multimodal supervisory unit that, during online operations, effectively orchestrates the switching among various CG configurations. These configurations are pre-designed offline based on the magnitude of disturbance occurrences to satisfy the prescribed constraints. To achieve this, a customized notion of transition dwell-time is incorporated within the proposed supervisory framework to determine the necessary duration to facilitate safe transitions among operational modes without compromising constraint satisfaction. Simulation results on two different linear systems indicate that the multimodal CG architecture is markedly less conservative when compared to the traditional single CG scheme.

本文将众所周知的 "指挥调速器"（CG）方案扩展到了作为外生信号作用于电厂的速率受限持续干扰的情况。该方法建立在多模式监控单元的基础上，在线运行期间，该单元可有效协调各种 CG 配置之间的切换。这些配置是根据干扰发生的程度离线预先设计的，以满足规定的约束条件。为实现这一目标，在拟议的监控框架中纳入了一个定制的过渡停留时间概念，以确定必要的持续时间，从而在不影响满足约束条件的前提下促进运行模式之间的安全转换。对两个不同线性系统的仿真结果表明，与传统的单一 CG 方案相比，多模式 CG 架构的保守性明显降低。

引用次数: 0

Improving discrete observers via unreliable direct state reconstruction 通过不可靠的直接状态重构改进离散观测器

IF 2.1 3区计算机科学 Q3 AUTOMATION & CONTROL SYSTEMS

Systems & Control Letters

Pub Date : 2025-02-01 DOI: 10.1016/j.sysconle.2024.105991

Florian Meiners, Jürgen Adamy

Unknown differences between system states and observer estimates inherently result in, potentially large, initial errors. This paper deals with the mitigation of this problem in discrete LTI systems by using an approximation of the system state directly calculated from past and present values of its input and output. This information is used in a nonlinear modification of the classical linear state observer structure to reduce the transient error and deviations due to disturbances. We show the stability of this extension in the presence and absence of noise. Additionally, we prove the fulfillment of the separation principle. For the case of noisy measurement, we argue that there is a predictable ideal filter length if the noise variance is known. The ideas are subsequently illustrated in simulation.

引用次数: 0

首页上一页

下一页尾页

类型

全部化学•材料生命科学医学物理工程技术环境•农林材料科学地球科学法学管理学化学环境科学与生态学计算机科学教育学经济学农林科学人文科学生物学数学物理与天体物理心理学综合性期刊其他工业工程理学历史学农学文学信息工程

数据库

全部 ACS Publications Elsevier ieeexplore Springer The Royal Society of Chemistry Wiley

期刊

Systems & Control Letters

全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.

﹀