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

arXiv 2019年

作者： Berkane, Soulaimane Dimarogonas, Dimos V. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden

In this note, we solve the problem of constrained stabilization on the n−dimensional unit sphere by mapping it to a navigation problem on the Euclidean space Rn in the presence of spherical obstacles. As a consequence, any controller that was originally designed for navigating in Euclidean sphere worlds can be used to solve the stabilization problem on the n−sphere in the presence of conic constraints. A simulation example on the 2−sphere illustrates the effectiveness of the proposed approach. Copyright © 2019, The Authors. All rights reserved.

关键词： Spheres

来源：评论

学校读者我要写书评

暂无评论

An Online Approach to Physical Watermark Design

arXiv

引用

arXiv 2019年

作者： Liu, Hanxiao Mo, Yilin Yan, Jiaqi Xie, Lihua Johansson, Karl H. School of Electrical and Electronic Engineering Nanyang Technological University Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Department of Automation and BNRist Tsinghua University China School of Electrical and Electronic Engineering Nanyang Technological University Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden

This paper considers the problem of designing physical watermark signals in order to optimally detect possible replay attack in a linear time-invariant system, under the assumption that the system parameters are unknown and need to be identified online. We first provide a replay attack model, where an adversary replays the previous sensor data in order to fool the system. A physical watermarking scheme, which leverages a random control input as a watermark to detect the replay attack, is then introduced. The optimal watermark signal design problem is cast as an optimization problem, which aims to achieve the optimal trade-off between control performance and intrusion detection. An online watermarking design and system identification algorithm is provided to deal with systems with unknown parameters. We prove that the proposed algorithm converges to the optimal one and characterize the almost sure convergence rate. A numerical example and an industrial process example are provided to illustrate the effectiveness of the proposed strategy. Copyright © 2019, The Authors. All rights reserved.

关键词： Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Anderson Acceleration of Proximal Gradient Methods

arXiv

引用

arXiv 2019年

作者： Mai, Vien V. Johansson, Mikael Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden

Anderson acceleration is a well-established and simple technique for speeding up fixed-point computations with countless applications. Previous studies of Anderson acceleration in optimization have only been able to provide convergence guarantees for unconstrained and smooth problems. This work introduces novel methods for adapting Anderson acceleration to (non-smooth and constrained) proximal gradient algorithms. Under some technical conditions, we extend the existing local convergence results of Anderson acceleration for smooth fixed-point mappings to the proposed scheme. We also prove analytically that it is not, in general, possible to guarantee global convergence of native Anderson acceleration. We therefore propose a simple scheme for stabilization that combines the global worst-case guarantees of proximal gradient methods with the local adaptation and practical speed-up of Anderson acceleration. Copyright © 2019, The Authors. All rights reserved.

关键词： Gradient methods

来源：评论

学校读者我要写书评

暂无评论

A Distributed Algorithm for Online Convex Optimization with Time-Varying Coupled Inequality Constraints

A Distributed Algorithm for Online Convex Optimization with ...

引用

IEEE Annual Conference on decision and control

作者： Xinlei Yi Xiuxian Li Lihua Xie Karl H. Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden School of Electrical and Electronic Engineering Nanyang Technological University Singapore

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

This paper considers distributed online optimization with time-varying coupled inequality constraints. The global objective function is composed of local convex cost and regularization functions and the coupled constraint function is the sum of local convex constraint functions. A distributed online primal-dual mirror descent algorithm is proposed to solve this problem, where the local cost, regularization, and constraint functions are held privately and revealed only after each time slot. We first derive regret and constraint violation bounds for the algorithm and show how they depend on the stepsize sequences, the accumulated variation of the comparator sequence, the number of agents, and the network connectivity. As a result, we prove that the algorithm achieves sublinear dynamic regret and constraint violation if the accumulated variation of the optimal sequence also grows sublinearly. We also prove that the algorithm achieves sublinear static regret and constraint violation under mild conditions. In addition, smaller bounds on the static regret are achieved when the objective functions are strongly convex. Finally, numerical simulations are provided to illustrate the effectiveness of the theoretical results.

关键词： Convex functions Heuristic algorithms Linear programming Distributed algorithms Optimization Time factors Upper bound

来源：评论

学校读者我要写书评

暂无评论

Synchronization of quadratic integrate-and-fire spiking neurons: Constant versus voltage-dependent couplings

Synchronization of quadratic integrate-and-fire spiking neur...

引用

IEEE Annual Conference on decision and control

作者： Matin Jafarian Karl H. Johansson Division of Decision and Control School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

This paper studies synchronization of a network of hybrid quadratic integrate-and-fire spiking neurons communicating over a complete graph and interconnected by means of bidirectional electrical couplings. Synchronization of the network of identical neurons with a common and constant coupling strength is studied using a Lyapunov-based argument for sufficiently large coupling strength. In addition, a voltage-dependent coupling law is proposed. It is assumed that each neuron is coupled to each of its neighbors by a coupling law which depends on the voltage of its neighboring neuron. For the voltage-dependent case, a sufficient condition for synchronization of two interconnected neurons is presented. Moreover, a comparison between the two mechanisms is given. Simulation results are provided to verify the theoretical analysis.

关键词： Neurons Synchronization Couplings Trajectory Integrated circuit modeling Synapses Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

An Assessment of Different Electricity Tariffs on Residential Photovoltaic System Profitability: Australian Case Study 2

An Assessment of Different Electricity Tariffs on Residentia...

引用

2nd International Conference on Smart Grid and Renewable Energy, SGRE 2019

作者： Al Arrouqi, Rafah Ahmed Ellabban, Omar Rasheed, Muhammad Babar Al-Fagih, Luluwah College of Science and Engineering Hamad Bin Khalifa University Division of Engineering Management and Decision Sciences Qatar Iberdrola Innovation Middle East Qatar Science Technology Park Qatar University of Lahore Department of Electronics and Electrical Systems Pakistan School of Computer Science and Mathematics Kingston University London United Kingdom

ISBN: (纸本)9781728129600

The smart grid vision includes demand response mechanisms for managing the load demand at residential and commercial premises, with the active participation of end users. Peak load demand can be managed autonomously and/or through the integration of distributed energy resources such as solar and wind. While the former can lead to enhanced end user cost benefits along with power system stability;the latter also promotes the use of sustainable energy through reduced carbon dioxide emissions. Various pricing schemes have been proposed in the literature, electric utility companies have adopted dynamic pricing plans to encourage their customers to reduce their demand during peak times. In this paper, a comprehensive assessment of the impact of different electricity tariffs on the profitability of residential PV systems has been performed. HOMER Grid software is utilized to study the impact of electricity regulator's policies and utility tariffs on the electric utilities. The results presented in this work can be used as a benchmark for energy retailers and decision makers in designing their tariffs and PV Support policies. © 2019 IEEE.

关键词： Electric utilities

来源：评论

学校读者我要写书评

暂无评论

Data-Driven Model Order Reduction for T-Product-Based Dynamical systems

arXiv

引用

arXiv 2025年

作者： Mei, Shenghan He, Ziqin Mei, Yidan Mao, Xin Dong, Anqi Wang, Ren Chen, Can Department of Mathematics University of North Carolina at Chapel Hill Chapel HillNC27599 United States School of Data Science and Society University of North Carolina at Chapel Hill Chapel HillNC27599 United States Division of Decision and Control Systems the Department of Mathematics KTH Royal Institute of Technology StockholmSE-100 44 Sweden Department of Electrical and Computer Engineering Illinois Institute of Technology ChicagoIL60616 United States School of Data Science and Society the Department of Mathematics the Department of Biostatistics University of North Carolina at Chapel Hill Chapel HillNC27599 United States

— Model order reduction plays a crucial role in simplifying complex systems while preserving their essential dynamic characteristics, making it an invaluable tool in a wide range of applications, including robotic systems, signal processing, and fluid dynamics. However, traditional model order reduction techniques like balanced truncation are not designed to handle tensor data directly and instead require unfolding the data, which may lead to the loss of important higher-order structural information. In this article, we introduce a novel framework for data-driven model order reduction of T-product-based dynamical systems (TPDSs), which are often used to capture the evolution of third-order tensor data such as images and videos through the T-product. Specifically, we develop advanced T-product-based techniques, including T-balanced truncation, T-balanced proper orthogonal decomposition, and the T-eigensystem realization algorithm for input-output TPDSs by leveraging the unique properties of T-singular value decomposition. We demonstrate that these techniques offer significant memory and computational savings while achieving reduction errors that are comparable to those of conventional methods. The effectiveness of the proposed framework is further validated through synthetic and real-world *** Codes 93C05, 15A69, 93B30, 65F99 © 2025, CC BY.

关键词： Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

Comparison of Centralized and Decentralized Approaches in Cooperative Coverage Problems with Energy-Constrained Agents

Comparison of Centralized and Decentralized Approaches in Co...

引用

IEEE Conference on decision and control

作者： Xiangyu Meng Xinmiao Sun Christos G. Cassandras Kaiyuan Xu Division of Electrical and Computer Engineering Louisiana State University Baton Rouge LA USA School of Automation and Electrical Engineering Shunde Graduate School and Key Laboratory of Knowledge Automation for Industrial Processes University of Science and Technology Beijing China Division of Systems Engineering and Center for Information and Systems Engineering Boston University Brookline MA USA

ISBN: (数字)9781728174471

ISBN: (纸本)9781728174488

A multi-agent coverage problem is considered with energy-constrained agents. The objective of this paper is to compare the coverage performance between centralized and decentralized approaches. To this end, a near-optimal centralized coverage control method is developed under energy depletion and repletion constraints. The optimal coverage formation corresponds to the locations of agents where the coverage performance is maximized. The optimal charging formation corresponds to the locations of agents with one agent fixed at the charging station and the remaining agents maximizing the coverage performance. We control the behavior of this cooperative multi-agent system by switching between the optimal coverage formation and the optimal charging formation. Finally, the optimal dwell times at coverage locations, charging time, and agent trajectories are determined so as to maximize coverage over a given time interval. In particular, our controller guarantees that at any time there is at most one agent leaving the team for energy repletion.

关键词： Charging stations Transient analysis Switches Space missions Task analysis Synchronization Sensors

来源：评论

学校读者我要写书评

暂无评论

On the Confidentiality of Linear Anomaly Detector States

On the Confidentiality of Linear Anomaly Detector States

引用

American control Conference

作者： David Umsonst Ehsan Nekouei Andre Teixeira Henrik Sandberg Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm 10044 Sweden Signals and Systems Group at Uppsala University Sweden

ISBN: (纸本)9781538679012;9781538679265

A malicious attacker with access to the sensor channel in a feedback control system can severely affect the physical system under control, while simultaneously being hard to detect. A properly designed anomaly detector can restrict the impact of such attacks, however. Anomaly detectors with an internal state (stateful detectors) have gained popularity because they seem to be able to mitigate these attacks more than detectors without a state (stateless detectors). In the analysis of attacks against control systems with anomaly detectors, it has been assumed that the attacker has access to the detector's internal state, or designs its attack such that it is not detected regardless of the detector's state. In this paper, we show how an attacker can realize the first case by breaking the confidentiality of a stateful detector state evolving with linear dynamics, while remaining undetected and imitating the statistics of the detector under nominal conditions. The realization of the attack is posed in a convex optimization framework using the notion of Kullback-Leibler divergence. Further, the attack is designed such that the maximum mean estimation error of the Kalman filter is maximized at each time step by exploiting dual norms. A numerical example is given to illustrate the results.

关键词： Confidentiality Feedback control systems anomaly Kalman filters Convex function Attackers

来源：评论

学校读者我要写书评

暂无评论

Secure Distributed Filtering for Unstable Dynamics Under Compromised Observations

Secure Distributed Filtering for Unstable Dynamics Under Com...

引用

IEEE Annual Conference on decision and control

作者： Xingkang He Xiaoqiang Ren Henrik Sandberg Karl H. Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Department of Automation Shanghai University Shanghai China

ISBN: (数字)9781728113982

ISBN: (纸本)9781728113999

In this paper, we consider a secure distributed filtering problem for linear time-invariant systems with bounded noises and unstable dynamics under compromised observations. A malicious attacker is able to compromise a subset of the agents and manipulate the observations arbitrarily. We first propose a recursive distributed filter consisting of two parts at each time. The first part employs a saturation-like scheme, which gives a small gain if the innovation is too large. The second part is a consensus operation of state estimates among neighboring agents. A sufficient condition is then established for the boundedness of estimation error, which is with respect to network topology, system structure, and the maximal compromised agent subset. We further provide an equivalent statement, which connects to 2s-sparse observability in the centralized framework in certain scenarios, such that the sufficient condition is feasible. Numerical simulations are finally provided to illustrate the developed results.

关键词： Observability Estimation error Technological innovation control systems State estimation Robustness

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：