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

arXiv 2023年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. Lab for Information & Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems China The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China School of Electrical and Electronic Engineering Nanyang Technological University 50 Nanyang Avenue Singapore639798 Singapore Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with adversarial constraints. In this setting, a network of agents makes decisions at each round, and then only a portion of the loss function and a coordinate block of the constraint function are privately revealed to each agent. The loss and constraint functions are convex and can vary arbitrarily across rounds. The agents collaborate to minimize network regret and cumulative constraint violation. A novel distributed online algorithm is proposed and it achieves an O(T max{c,1−c}) network regret bound and an O(T 1−c/2) network cumulative constraint violation bound, where T is the number of rounds and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds (i.e, there is a point that strictly satisfies the inequality constraints), the network cumulative constraint violation bound is reduced to O(T 1−c). Moreover, if the loss functions are strongly convex, then the network regret bound is reduced to O(log(T)), and the network cumulative constraint violation bound is reduced to O(√log(T)T) and O(log(T)) without and with Slater’s condition, respectively. To the best of our knowledge, this paper is the first to achieve reduced (network) cumulative constraint violation bounds for (distributed) online convex optimization with adversarial constraints under Slater’s condition. Finally, the theoretical results are verified through numerical simulations. Copyright © 2023, The Authors. All rights reserved.

关键词： Economic and social effects

来源：评论

学校读者我要写书评

暂无评论

Quantized Distributed Nonconvex Optimization with Linear Convergence

Quantized Distributed Nonconvex Optimization with Linear Con...

引用

IEEE Conference on Decision and Control

作者： Lei Xu Xinlei Yi Jiayue Sun Yang Shi Karl Henrik Johansson Tao Yang State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering University of Victoria Victoria Canada

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

This paper considers distributed nonconvex op-timization for minimizing the average of local cost functions, by using local information exchange over undirected communication networks. Since the communication channels often have limited bandwidth or capacity, we first introduce a quantization rule and an encoder/decoder scheme to reduce the transmission bits. By integrating them with a distributed algorithm, we then propose a distributed quantized nonconvex optimization algorithm. Assuming the global cost function satisfies the Polyak– Łojasiewicz condition, which does not require the global cost function to be convex and the global minimizer is not necessarily unique, we show that the proposed algorithm linearly converges to a global optimal point. Moreover, a low data rate is shown to be sufficient to ensure linear convergence when the algorithm parameters are properly chosen. The theoretical results are illustrated by numerical simulation examples.

关键词： Quantization (signal) Communication channels Bandwidth Cost function Numerical simulation Communication networks Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Communication Compression for Distributed Nonconvex Optimization

arXiv

引用

arXiv 2022年

作者： Yi, Xinlei Zhang, Shengjun Yang, Tao Chai, Tianyou Johansson, Karl H. Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm100 44 Sweden Department of Electrical Engineering University of North Texas DentonTX76203 United States State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China

This paper considers distributed nonconvex optimization with the cost functions being distributed over agents. Noting that information compression is a key tool to reduce the heavy communication load for distributed algorithms as agents iteratively communicate with neighbors, we propose three distributed primal–dual algorithms with compressed communication. The first two algorithms are applicable to a general class of compressors with bounded relative compression error and the third algorithm is suitable for two general classes of compressors with bounded absolute compression error. We show that the proposed distributed algorithms with compressed communication have comparable convergence properties as state-of-the-art algorithms with exact communication. Specifically, we show that they can find first-order stationary points with sublinear convergence rate O(1/T) when each local cost function is smooth, where T is the total number of iterations, and find global optima with linear convergence rate under an additional condition that the global cost function satisfies the Polyak–Lojasiewicz condition. Numerical simulations are provided to illustrate the effectiveness of the theoretical results. Copyright © 2022, The Authors. All rights reserved.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Algal Bloom Front Tracking Using an Unmanned Surface Vehicle: Numerical Experiments Based on Baltic Sea Data

Algal Bloom Front Tracking Using an Unmanned Surface Vehicle...

引用

OCEANS

作者： Joana Fonseca Miguel Aguiar João Borges de Sousa Karl H. Johansson Division of Decision and Control Systems School of Electrical Engineering and Computer Science and Digital Futures KTH Royal Institute of Technology Stockholm Sweden Underwater Systems and Technology Laboratory (LSTS) University of Porto Portugal

ISBN: (纸本)9781665427883

We consider the problem of tracking moving algal bloom fronts using an unmanned surface vehicle (USV) equipped with a sensor that measures the concentration of chlorophyll a. Chlorophyll a is a green pigment found in plants, and its concentration is an indicator of phytoplankton abundance. Our algal bloom front tracking mission consists of three stages: deployment, data collection, and front tracking. At the deployment stage, a satellite collects an image of the sea from which the location of the front, the reference value for the concentration at this front and, consequently, the appropriate initial position for the USV are determined. At the data collection stage, the USV collects data points to estimate the local algal gradient as it crosses the front. Finally, at the front tracking stage, an adaptive algorithm based on recursive least squares fitting using recent past sensor measures is executed. We evaluate the performance of the algorithm and its sensitivity to measurement noise through MATLAB simulations. We also present an implementation of the algorithm on the DUNE onboard software platform for marine robots and validate it using simulations with satellite model forecasts from Baltic sea data.

关键词： Water Temperature measurement Satellites Software algorithms Sea measurements Predictive models Robot sensing systems

来源：评论

学校读者我要写书评

暂无评论

Stochastic-Robust Planning of Networked Hydrogen-electrical Microgrids: A Study on Induced Refueling Demand

arXiv

引用

arXiv 2024年

作者： Sun, Xunhang Cao, Xiaoyu Zeng, Bo Zhai, Qiaozhu Başar, Tamer Guan, Xiaohong School of Automation Science and Engineering The Ministry of Education Key Laboratory for Intelligent Networks and Network Security Xi’an Jiaotong University Shaanxi Xi’an710049 China Coordinated Science Laboratory University of Illinois Urbana-Champaign UrbanaIL61801 United States Smart Integrated Energy Department Sichuan Digital Economy Industry Development Research Institute Sichuan Chengdu610037 China Department of Industrial Engineering The Department of Electrical and Computer Engineering University of Pittsburgh PittsburghPA15106 United States Center for Intelligent and Networked Systems Department of Automation Tsinghua University Beijing100084 China

Hydrogen-electrical microgrids are increasingly assuming an important role on the pathway toward decarbonization of energy and transportation systems. This paper studies networked hydrogen-electrical microgrids planning (NHEMP), considering a critical but often-overlooked issue, i.e., the demand-inducing effect (DIE) associated with infrastructure development decisions. Specifically, higher refueling capacities will attract more refueling demand of hydrogen-powered vehicles (HVs). To capture such interactions between investment decisions and induced refueling demand, we introduce a decision-dependent uncertainty (DDU) set and build a trilevel stochastic-robust formulation. The upper-level determines optimal investment strategies for hydrogen-electrical microgrids, the lower-level optimizes the risk-aware operation schedules across a series of stochastic scenarios, and, for each scenario, the middle-level identifies the "worst" situation of refueling demand within an individual DDU set to ensure economic feasibility. Then, an adaptive and exact decomposition algorithm, based on Parametric Column-and-Constraint Generation (PC&CG), is customized and developed to address the computational challenge and to quantitatively analyze the impact of DIE. Case studies on an IEEE exemplary system validate the effectiveness of the proposed NHEMP model and the PC&CG algorithm. It is worth highlighting that DIE can make an important contribution to the economic benefits of NHEMP, yet its significance will gradually decrease when the main bottleneck transits to other system restrictions. Copyright © 2024, The Authors. All rights reserved.

关键词： Stochastic systems

来源：评论

学校读者我要写书评

暂无评论

A Zeroth-Order Momentum Method for Risk-Averse Online Convex Games

A Zeroth-Order Momentum Method for Risk-Averse Online Convex...

引用

IEEE Conference on Decision and Control

作者： Zifan Wang Yi Shen Zachary I. Bell Scott Nivison Michael M. Zavlanos Karl H. Johansson Division of Decision and Control Systems School of Electrical Enginnering and Computer Science KTH Royal Institute of Technology Digital Futures Stockholm Sweden Department of Mechanical Engineering and Materials Science Duke University Durham NC USA Air Force Research Laboratory Eglin AFB FL USA

ISBN: (数字)9781665467612

ISBN: (纸本)9781665467629

We consider risk-averse learning in repeated unknown games where the goal of the agents is to minimize their individual risk of incurring significantly high cost. Specifically, the agents use the conditional value at risk (CVaR) as a risk measure and rely on bandit feedback in the form of the cost values of the selected actions at every episode to estimate their CVaR values and update their actions. A major challenge in using bandit feedback to estimate CVaR is that the agents can only access their own cost values, which, however, depend on the actions of all agents. To address this challenge, we propose a new risk-averse learning algorithm with momentum that utilizes the full historical information on the cost values. We show that this algorithm achieves sub-linear regret and matches the best known algorithms in the literature. We provide numerical experiments for a Cournot game that show that our method outperforms existing methods.

关键词： Costs Estimation Games Numerical simulation Standards

来源：评论

学校读者我要写书评

暂无评论

Meta-Learning Based Early Fault Detection for Rolling Bearings via Few-Shot Anomaly Detection

arXiv

引用

arXiv 2022年

作者： Song, Wenbin Wu, Di Shen, Weiming Boulet, Benoit School of Mechanical Science and Engineering Huazhong University of Science and Technology Wuhan430074 China Department of Electrical and Computer Engineering McGill University MontrealQCH3A 2A7 Canada Department of Industrial and Manufacturing Systems Engineering State Key Laboratory of Digital Manufacturing Equipment and Technology School of Mechanical Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

Early fault detection (EFD) of rolling bearings can recognize slight deviation of the health states and contribute to the stability of mechanical systems. In practice, very limited target bearing data are available to conduct EFD, which makes it hard to adapt to the EFD task of new bearings. To address this problem, many transfer learning based EFD methods utilize historical data to learn transferable domain knowledge and conduct early fault detection on new target bearings. However, most existing methods only consider the distribution drift across different working conditions but ignore the difference between bearings under the same working condition, which is called Unit-to-Unit Variability (UtUV). The setting of EFD with limited target data considering UtUV can be formulated as a Few-shot Anomaly Detection task. Therefore, this paper proposes a novel EFD method based on meta-learning considering UtUV. The proposed method can learn a generic metric based on Relation Network (RN) to measure the similarity between normal data and the new arrival target bearing data. Besides, the proposed method utilizes a health state embedding strategy to decrease false alarms. The performance of proposed method is tested on two bearing datasets. The results show that the proposed method can detect incipient faults earlier than the baselines with lower false alarms. Copyright © 2022, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

An Early Fault Detection Method of Rotating Machines Based on Multiple Feature Fusion with Stacking Architecture

arXiv

引用

arXiv 2022年

作者： Song, Wenbin Wu, Di Shen, Weiming Boulet, Benoit The School of Mechanical Science and Engineering Huazhong University of Science and Technology Wuhan430074 China The Department of Electrical and Computer Engineering McGill University MontrealQCH3A 2A7 Canada The Department of Industrial and Manufacturing Systems Engineering State Key Laboratory of Digital Manufacturing Equipment and Technology School of Mechanical Science and Engineering Huazhong University of Science and Technology Wuhan430074 China

Early fault detection (EFD) of rotating machines is important to decrease the maintenance cost and improve the mechanical system stability. One of the key points of EFD is developing a generic model to extract robust and discriminative features from different equipment for early fault detection. Most existing EFD methods focus on learning fault representation by one type of feature. However, a combination of multiple features can capture a more comprehensive representation of system state. In this paper, we propose an EFD method based on multiple feature fusion with stacking architecture (M2FSA). The proposed method can extract generic and discriminiative features to detect early faults by combining time domain (TD), frequency domain (FD), and time-frequency domain (TFD) features. In order to unify the dimensions of the different domain features, Stacked Denoising Autoencoder (SDAE) is utilized to learn deep features in three domains. The architecture of the proposed M2FSA consists of two layers. The first layer contains three base models, whose corresponding inputs are different deep features. The outputs of the first layer are concatenated to generate the input to the second layer, which consists of a meta model. The proposed method is tested on three bearing datasets. The results demonstrate that the proposed method is better than existing methods both in sensibility and reliability. Copyright © 2022, The Authors. All rights reserved.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Secure State Estimation against Sparse Attacks on a Time-varying Set of Sensors

arXiv

引用

arXiv 2022年

作者： Li, Zishuo Niazi, Muhammad Umar B. Liu, Changxin Mo, Yilin Johansson, Karl H. Department of Automation Tsinghua University Beijing100084 China Division of Decision and Control Systems Digital Futures School of Electrical Engineering and Computer Science KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information and Decision Systems Massachusetts Institute of Technology 77 Massachusetts Avenue CambridgeMA02139 United States

This paper studies the problem of secure state estimation of a linear time-invariant (LTI) system with bounded noise in the presence of sparse attacks on an unknown, time-varying set of sensors. In other words, at each time, the attacker has the freedom to choose an arbitrary set of no more that p sensors and manipulate their measurements without restraint. To this end, we propose a secure state estimation scheme and guarantee a bounded estimation error subject to 2p-sparse observability and a mild, technical assumption that the system matrix has no degenerate eigenvalues. The proposed scheme comprises a design of decentralized observer for each sensor based on the local observable subspace decomposition. At each time step, the local estimates of sensors are fused by a median operator to obtain a secure estimation, which is then followed by a local detection-and-resetting process of the decentralized observers. The estimation error is shown to be upper-bounded by a constant which is determined only by the system parameters and noise magnitudes. Moreover, we design the detector threshold to ensure that the benign sensors never trigger the detector. The efficacy of the proposed algorithm is demonstrated by its application on a benchmark example of IEEE 14-bus system. © 2022, CC BY-NC-ND.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

A Pricing Rule for Third-Party Platoon Coordination Service Provider

A Pricing Rule for Third-Party Platoon Coordination Service ...

引用

Asian Control Conference

作者： Ting Bai Alexander Johansson Shaoyuan Li Karl Henrik Johansson Jonas Må rtensson Integrated Transport Research Lab Digital Futures and Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Department of Automation Key Laboratory of System Control and Information Processing Ministry of Education Shanghai Jiao Tong University Shanghai China

We model a platooning system including trucks and a third-party service provider that performs platoon coordination, distributes the platooning profit within platoons, and charges the trucks in exchange for its services. This paper studies one class of pricing rules, where the third-party service provider keeps part of the platooning profit each time a platoon is formed. Furthermore, we propose a platoon coordination solution based on distributed model predictive control in which the pricing rule is integrated. To evaluate the effect of the pricing on the platooning system, we perform a simulation over the Swedish road network. The simulation shows that the platooning rate and profit highly depend on the pricing. This suggests that pricing needs to be set carefully to obtain a satisfactory platooning system in the future.

关键词： Roads Pricing Predictive control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：