检索结果-内蒙古大学图书馆

63rd IEEE Conference on decision and control, CDC 2024

作者： Engelaar, M.H.W. Zhang, Z. Vlahakis, E.E. Dimarogonas, D.V. Lazar, M. Haesaert, S. Netherlands Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden

ISBN: (纸本)9798350316339

This paper addresses the control synthesis of heterogeneous stochastic linear multi-agent systems with realtime allocation of signal temporal logic (STL) specifications. Based on previous work, we decompose specifications into subspecifications on the individual agent level. To leverage the efficiency of task allocation, a heuristic filter evaluates potential task allocation based on STL robustness, and subsequently, an auctioning algorithm determines the definitive allocation of specifications. Finally, a control strategy is synthesized for each agent-specification pair using tube-based model predictive control (MPC), ensuring provable probabilistic satisfaction. We demonstrate the efficacy of the proposed methods using a multi-shuttle scenario that highlights a promising extension to automated driving applications like vehicle routing. © 2024 IEEE.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

Constructive Function Approximation with Local Models 32

Constructive Function Approximation with Local Models

引用

32nd Mediterranean Conference on control and Automation, MED 2024

作者： Mavridis, Christos N. Johansson, Karl Henrik School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Division of Decision and Control Systems Stockholm Sweden

ISBN: (纸本)9798350395440

We introduce a constructive function approximation approach as a general tool, particularly useful in adaptive and data-driven methods for perception and control. The key idea is to estimate of a collection of simple local models as opposed to a single and complex regression model trained in the entire input space. We use principles from the Online Deterministic Annealing (ODA) optimization framework to construct an adaptive partition of the input space, which enables the introduction of local function approximation models within each subset of the partition. We show that both the partitioning and the local model training algorithms are stochastic approximation algorithms that operate online, and with the same observations, as part of a two-timescale stochastic approximation scheme. This process constitutes a heuristic method to gradually increase the complexity of the function approximation framework in a task-agnostic manner, giving emphasis to regions of the input space where the regression error is high. As a result this framework has inherent explainability properties, and is suitable for continuous learning applications where regression improvement without retraining from scratch is crucial. Simulation results illustrate the properties of the proposed approach. © 2024 IEEE.

关键词： Heuristic methods

来源：评论

学校读者我要写书评

暂无评论

Slow Convergence of Interacting Kalman Filters in Word-of-Mouth Social Learning 60

Slow Convergence of Interacting Kalman Filters in Word-of-Mo...

引用

60th Annual Allerton Conference on Communication, control, and Computing, Allerton 2024

作者： Krishnamurthy, Vikram Rojas, Cristian R. School of Electrical and Computer Engineering Cornell University United States School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Division of Decision and Control Systems Stockholm Sweden

ISBN: (纸本)9798331541033

We consider word-of-mouth social learning involving m Kalman filter agents that operate sequentially. The first Kalman filter receives the raw observations, while each subsequent Kalman filter receives a noisy measurement of the conditional mean of the previous Kalman filter. The prior is updated by the m-th Kalman filter. When m=2, and the observations are noisy measurements of a Gaussian random variable, the covariance goes to zero as k-1/3 for 7kappa;observations, instead of O(k-1) in the standard Kalman filter. In this paper we prove that for m agents, the covariance decreases to zero as k-(2m-1), i.e, the learning slows down exponentially with the number of agents. We also show that by artificially weighing the prior at each time, the learning rate can be made optimal as k-1. The implication is that in word-of-mouth social learning, artificially re-weighing the prior can yield the optimal learning rate. © 2024 IEEE.

关键词： Kalman filters

来源：评论

学校读者我要写书评

暂无评论

On final opinions of the Friedkin-Johnsen model over random graphs with partially stubborn community 63

On final opinions of the Friedkin-Johnsen model over random ...

引用

63rd IEEE Conference on decision and control, CDC 2024

作者： Wang, Lingfei Xing, Yu Johansson, Karl H. Kth Royal Institute of Technology and with Digital Futures Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm Sweden

ISBN: (纸本)9798350316339

This paper studies the formation of final opinions for the Friedkin-Johnsen (FJ) model with a community of partially stubborn agents. The underlying network of the FJ model is symmetric and generated from a random graph model, in which each link is added independently from a Bernoulli distribution. It is shown that the final opinions of the FJ model will concentrate around those of an FJ model over the expected graph as the network size grows, on the condition that the stubborn agents are well connected to other agents. Probability bounds are proposed for the distance between these two final opinion vectors, respectively for the cases where there exist non-stubborn agents or not. Numerical experiments are provided to illustrate the theoretical findings. The simulation shows that, in presence of non-stubborn agents, the link probability between the stubborn and the non-stubborn communities affect the distance between the two final opinion vectors significantly. Additionally, if all agents are stubborn, the opinion distance decreases with the agent stubbornness. © 2024 IEEE.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

On convergence of covariance matrix of empirical Bayes hyper-parameter estimator

引用

control Theory and Technology 2024年第2期22卷 149-162页

作者： Yue Ju Biqiang Mu Tianshi Chen School of Data Science and Shenzhen Research Institute of Big Data The Chinese University of Hong KongShenzhenShenzhen518172GuangdongChina Division of Decision and Control Systems School of Electrical Engineering and Computer ScienceKTH Royal Institute of Technology10044StockholmSweden Key Laboratory of Systems and Control Institute of Systems ScienceAcademy of Mathematics and System ScienceChinese Academy of SciencesBeijing100190China

Regularized system identification has become the research frontier of system identification in the past *** related core subject is to study the convergence properties of various hyper-parameter estimators as the sample size goes to *** this paper,we consider one commonly used hyper-parameter estimator,the empirical Bayes(EB).Its convergence in distribution has been studied,and the explicit expression of the covariance matrix of its limiting distribution has been ***,what we are truly interested in are factors contained in the covariance matrix of the EB hyper-parameter estimator,and then,the convergence of its covariance matrix to that of its limiting distribution is *** general,the convergence in distribution of a sequence of random variables does not necessarily guarantee the convergence of its covariance ***,the derivation of such convergence is a necessary complement to our theoretical analysis about factors that influence the convergence properties of the EB hyper-parameter *** this paper,we consider the regularized finite impulse response(FIR)model estimation with deterministic inputs,and show that the covariance matrix of the EB hyper-parameter estimator converges to that of its limiting ***,we run numerical simulations to demonstrate the efficacy of ourtheoretical results.

关键词： Regularized system identification Hyper-parameter estimator Empirical Bayes Convergence of covariance matrix

来源：评论

学校读者我要写书评

暂无评论

Switching control for Identification Deception in Cyber-Physical systems 63

Switching Control for Identification Deception in Cyber-Phys...

引用

63rd IEEE Conference on decision and control, CDC 2024

作者： Mavridis, Christos Kanellopoulos, Aris Sandberg, Henrik Johansson, Karl Henrik Kth Royal Institute of Technology Division of Decision and Control School of Electrical Engineering and Computer Science Stockholm Sweden

ISBN: (纸本)9798350316339

We investigate the problem of deceiving a malicious agent employing an identification method to estimate the closed-loop dynamics of a cyber-physical system. In particular, we propose a moving target defense mechanism that utilizes stochastic switching between linear closed-loop dynamics to drive a linear system identification process of a potential adversary to sub-optimal solutions with non-vanishing error. We provide a statistical analysis of the induced identification error and show that it is not possible for any linear system identification method to reconstruct the average dynamics of a stochastic switched linear system. Finally, we utilize the theory of Markov jump linear systems to guarantee asymptotic stability of the switching system, and formulate the switching control problem as an optimization problem that guarantees stability while taking into account the trade-off between security and switching effort. Simulation results showcase the efficacy of the proposed approach in inducing identification error for the adversary using minimal switching. © 2024 IEEE.

关键词： Markov processes

来源：评论

学校读者我要写书评

暂无评论

Unknown Input Observers Breaking Confidentiality of controller States 63

Unknown Input Observers Breaking Confidentiality of Controll...

引用

63rd IEEE Conference on decision and control, CDC 2024

作者： Breukelman, Enno Sandberg, Henrik Kth Royal Institute of Technology School of Electrical Engineering and Computer Science Division of Decision and Control Systems Malvinas väg 10 StockholmSE-100 44 Sweden

ISBN: (纸本)9798350316339

Driven by ubiquitous digitalization and cyberattacks on critical infrastructure, there is a high interest in research on the security of cyber-physical systems. If an attacker gains access to protected and sensitive information, such as the internal states of a control system, this is considered a breach of confidentiality. Access to sensitive information can be the first step in a larger cyber-attack scheme, such as a stealthy false data injection attack. Considering process and measurement noise in the plant, existing research investigated when an attacker equipped with a Kalman filter can perfectly estimate the internal controller states if the attacker has access to plant measurements and all model parameters. For this estimate to converge, the controller is required to have stable poles. In this paper, we show that if the attacker has access to the control inputs instead of the plant measurements, the controller needs to have stable zeros. Additionally, we demonstrate that an attacker equipped with an Unknown Input Observer, using tools from delayed system inversion, can get a delayed yet perfect estimate of the controller states from the control inputs without knowledge of the plant's parameters and noise characteristics. Lastly, we present simulation results from a three-tank system to showcase the differences in controller state estimation. © 2024 IEEE.

关键词： Delay control systems

来源：评论

学校读者我要写书评

暂无评论

Differentially Private Online Federated Learning with Correlated Noise 63

Differentially Private Online Federated Learning with Correl...

引用

63rd IEEE Conference on decision and control, CDC 2024

作者： Zhang, Jiaojiao Zhu, Linglingzhi Johansson, Mikael Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science StockholmSE-100 44 Sweden Chinese University of Hong Kong Department of Systems Engineering and Engineering Management Hong Kong

ISBN: (纸本)9798350316339

We introduce a novel differentially private algorithm for online federated learning that employs temporally correlated noise to enhance utility while ensuring privacy of continuously released models. To address challenges posed by DP noise and local updates with streaming non-iid data, we develop a perturbed iterate analysis to control the impact of the DP noise on the utility. Moreover, we demonstrate how the drift errors from local updates can be effectively managed under a quasi-strong convexity condition. Subject to an (, δ) DP budget, we establish a dynamic regret bound over the entire time horizon, quantifying the impact of key parameters and the intensity of changes in dynamic environments. Numerical experiments confirm the efficacy of the proposed algorithm. © 2024 IEEE.

关键词： Federated learning

来源：评论

学校读者我要写书评

暂无评论

Finite Sample Analysis for a Class of Subspace Identification Methods 63

Finite Sample Analysis for a Class of Subspace Identificatio...

引用

63rd IEEE Conference on decision and control, CDC 2024

作者： He, Jiabao Ziemann, Ingvar Rojas, Cristian R. Hjalmarsson, Hakan Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm100 44 Sweden University of Pennsylvania PhiladelphiaPA19104 United States

ISBN: (纸本)9798350316339

While subspace identification methods (SIMs) are appealing due to their simple parameterization for MIMO systems and robust numerical realizations, a comprehensive statistical analysis of SIMs remains an open problem, especially in the non-asymptotic regime. In this work, we provide a finite sample analysis for a class of SIMs, which reveals that the convergence rates for estimating Markov parameters and system matrices are O(1 / SN), in line with classical asymptotic results. Based on the observation that the model format in classical SIMs is non-causal because of a projection step, we choose a parsimonious SIM that bypasses the projection step and strictly enforces a causal model to facilitate the analysis, where a bank of ARX models are estimated in parallel. Leveraging recent results from a finite sample analysis of an individual ARX model, we obtain a union error bound for an array of ARX models and proceed to derive error bounds for system matrices using robustness results for the singular value decomposition. © 2024 IEEE.

关键词： Singular value decomposition

来源：评论

学校读者我要写书评

暂无评论

Learning Communities from Equilibria of Nonlinear Opinion Dynamics 63

Learning Communities from Equilibria of Nonlinear Opinion Dy...

引用

63rd IEEE Conference on decision and control, CDC 2024

作者： Xing, Yu Bizyaeva, Anastasia Johansson, Karl H. Kth Royal Institute of Technology and with Digital Futures Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm Sweden Cornell University Sibley School of Mechanical and Aerospace Engineering IthacaNY United States

ISBN: (纸本)9798350316339

This paper studies community detection for a nonlinear opinion dynamics model from its equilibria. It is assumed that the underlying network is generated from a stochastic block model with two communities, where agents are assigned with community labels and edges are added independently based on these labels. Agents update their opinions following a nonlinear rule that incorporates saturation effects on interactions. It is shown that clustering based on a single equilibrium can detect most community labels (i.e., achieving almost exact recovery), if the two communities differ in size and link probabilities. When the two communities are identical in size and link probabilities, and the intercommunity connections are denser than intra-community ones, the algorithm can achieve almost exact recovery under negative influence weights but fails under positive influence weights. Utilizing fixed point equations and spectral methods, we also propose a detection algorithm based on multiple equilibria, which can detect communities with positive influence weights. Numerical experiments demonstrate the performance of the proposed algorithms. © 2024 IEEE.

关键词： Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：