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

arXiv 2023年

作者： Cao, John Niazi, M. Umar B. Barreau, Matthieu Johansson, Karl Henrik Division of Decision and Control Systems Digital Futures KTH Royal Institute of Technology StockholmSE-100 44 Sweden Laboratory for Information & Decision Systems Department of Electrical Engineering and Computer Science Massachusetts Institute of Technology CambridgeMA02139 United States

This paper presents a novel observer-based approach to detect and isolate faulty sensors in nonlinear systems. The proposed sensor fault detection and isolation (s-FDI) method applies to a general class of nonlinear systems. Our focus is on s-FDI for two types of faults: complete failure and sensor degradation. The key aspect of this approach lies in the utilization of a neural network-based Kazantzis- Kravaris/Luenberger (KKL) observer. The neural network is trained to learn the dynamics of the observer, enabling accurate output predictions of the system. Sensor faults are detected by comparing the actual output measurements with the predicted values. If the difference surpasses a theoretical threshold, a sensor fault is detected. To identify and isolate which sensor is faulty, we compare the numerical difference of each sensor meassurement with an empirically derived threshold. We derive both theoretical and empirical thresholds for detection and isolation, respectively. Notably, the proposed approach is robust to measurement noise and system uncertainties. Its effectiveness is demonstrated through numerical simulations of sensor faults in a network of Kuramoto oscillators. © 2023, CC BY.

关键词： Nonlinear systems

来源：评论

学校读者我要写书评

暂无评论

Fog Images Generation About Unmanned Surface Vessels with Improved Generative Adversarial Network

Fog Images Generation About Unmanned Surface Vessels with Im...

引用

Chinese control Conference (CCC)

作者： Yifeng Tang Zhihui Huang Chuancong Tang Chuanshang Luo Yifan Xu Bin Liu Hai-Tao Zhang Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and Automation the Engineering Research Center of Autonomous Intelligent Unmanned Systems Wuhan China State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology Wuhan China

This paper proposes a fog weather data augmentation method for the unmanned surface vessels (USVs) via improved Generative Adversarial Network(GAN) model. First, a generator scheme for GAN is proposed with the guided generation of the atmospheric scattering model in this paper. A Laplacian Pyramid Based Depth Residuals model is added to the generator which reduces the difficulty of generating fog images caused by the degradation of water surface image and improves the quality of generated images. Finally, fog images are generated from sunny weather images collected with HUST-12C by LPBDR-GAN model and experiments show that generated images are very close to real fog images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Distributed Online Convex Optimization with Time-Varying Constraints: Tighter Cumulative Constraint Violation Bounds under Slater's Condition

引用

IEEE Transactions on Automatic control 2025年

作者： Yi, Xinlei Li, Xiuxian Yang, Tao Xie, Lihua Hong, Yiguang Chai, Tianyou Johansson, Karl H. National Key Laboratory of Autonomous Intelligent Unmanned Systems Shanghai Institute of Intelligent Science and Technology China Ministry of Education Frontiers Science Center for Intelligent Autonomous Systems China Massachusetts Institute of Technology Lab for Information & Decision Systems CambridgeMA02139 United States Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Nanyang Technological University School of Electrical and Electronic Engineering 50 Nanyang Avenue 639798 Singapore Kth Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Sweden Digital Futures Stockholm10044 Sweden

This paper considers distributed online convex optimization with time-varying 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 static network regret and network cumulative constraint violation. A novel distributed online algorithm with a vanishing stepsize is proposed and it achieves an O(Tmax {c,1-c}) static network regret bound and an O(T1-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(T1-c). Moreover, if the loss functions are strongly convex, then static 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 tighter (network) cumulative constraint violation bounds for (distributed) online convex optimization with time-varying constraints under Slater's condition. Finally, the theoretical results are verified through numerical simulations. © 1963-2012 IEEE.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Adaptive Estimation for Environmental Monitoring Using an Autonomous Underwater Vehicle

Adaptive Estimation for Environmental Monitoring Using an Au...

引用

IEEE Conference on Decision and control

作者： Ziwen Yang Joana Fonseca Shanying Zhu Cailian Chen Xinping Guan Karl H. Johansson Department of Automation Shanghai Jiao Tong University Shanghai China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai China Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Stockholm Sweden Digital Futures

This paper considers the problem of monitoring and adaptively estimating an environmental field, such as temperature or salinity, using an autonomous underwater vehicle (AUV). The AUV moves in the field and persistently measures environmental scalars and its position in its local coordinate frame. The environmental scalars are approximately linearly distributed over the region of interest, and an adaptive estimator is designed to estimate the gradient. By orthogonal decomposition of the velocity of the AUV, a linear time-varying system is equivalently constructed, and the sufficient conditions on the motion of the AUV are established, under which the global exponential stability of the estimation error system is rigorously proved. Furthermore, an estimate of the exponential convergence rate is given, and a reference trajectory that maximizes the estimate of the convergence rate is obtained for the AUV to track. Numerical examples verify the stability and efficiency of the system.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Reduced Network Cumulative Constraint Violation for Distributed Bandit Convex Optimization under Slater’s Condition

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Ding, Jinliang Cao, Ming Johansson, Karl H. Yang, Tao State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China Department of Control Science and Engineering College of Electronics and Information Engineering Tongji University Shanghai201800 China Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands 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 studies the distributed bandit convex optimization problem with time-varying inequality constraints, where the goal is to minimize network regret and cumulative constraint violation. To calculate network cumulative constraint violation, existing distributed bandit online algorithms solving this problem directly use the clipped constraint function to replace its original constraint function. However, the use of the clipping operation renders Slater’s condition (i.e, there exists a point that strictly satisfies the inequality constraints at all iterations) ineffective to achieve reduced network cumulative constraint violation. To tackle this challenge, we propose a new distributed bandit online primal–dual algorithm. If local loss functions are convex, we show that the proposed algorithm establishes 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 total number of iterations and c ∈ (0, 1) is a user-defined trade-off parameter. When Slater’s condition holds, the network cumulative constraint violation bound is reduced to O(T 1−c). In addition, if local loss functions are strongly convex, for the case where strongly convex parameters are unknown, the network regret bound is reduced to O(T1−c), and the network cumulative constraint violation bound is O(T1−c/2) and O(T1−c) without and with Slater’s condition, respectively. For the case where strongly convex parameters are known, the network regret bound is further 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 among the first to establish reduced (network) cumulative constraint violation bounds for (distributed) bandit convex optimization with time-varying constraints under Slater’s condition. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

Global solution to sensor network localization: A non-convex potential game approach and its distributed implementation

arXiv

引用

arXiv 2024年

作者： Xu, Gehui Chen, Guanpu Hong, Yiguang Fidan, Baris Parisini, Thomas Johansson, Karl H. Key Laboratory of Systems and Control Academy of Mathematics and Systems Science Beijing100190 China The Division of Decision and Control Systems School of Electrical Engineering and Computer Science KTH Royal Institute of Technology Sweden Digital Futures StockholmSE-10044 Sweden Department of Control Science and Engineering Tongji University Shanghai201804 China Shanghai Research Institute for Intelligent Autonomous Systems Shanghai201210 China The Department of Mechanical and Mechatronics Engineering University of Waterloo WaterlooONN2L 3G1 Canada The Department of Electrical and Electronic Engineering Imperial College London LondonSW7 2AZ United Kingdom The Department of Engineering and Architecture University of Trieste Trieste34127 Italy

Consider a sensor network consisting of both anchor and non-anchor nodes. We address the following sensor network localization (SNL) problem: given the physical locations of anchor nodes and relative measurements among all nodes, determine the locations of all non-anchor nodes. The solution to the SNL problem is challenging due to its inherent non-convexity. In this paper, the problem takes on the form of a multi-player nonconvex potential game in which canonical duality theory is used to define a complementary dual potential function. After showing the Nash equilibrium (NE) correspondent to the SNL solution, we provide a necessary and sufficient condition for a stationary point to coincide with the NE. An algorithm is proposed_ to reach the NE and shown to have convergence rate O(1/√k). With the aim of reducing the information exchange within a network, a distributed algorithm for NE seeking is implemented and its global convergence analysis is provided. Extensive simulations show the validity and effectiveness of the proposed approach to solve the SNL problem. Copyright © 2024, The Authors. All rights reserved.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization With Time-Varying Constraints

引用

IEEE Transactions on control of Network systems 2025年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao Northeastern University State Key Laboratory of Synthetical Automation for Process Industries Shenyang110819 China Ministry of Education Shanghai Institute of Intelligent Science and Technology National Key Laboratory of Autonomous Intelligent Unmanned Systems Frontiers Science Center for Intelligent Autonomous Systems Shanghai201210 China Southeast University School of Automation Nanjing210096 China University of Groningen Engineering and Technology Institute Groningen Faculty of Science and Engineering GroningenAG 9747 Netherlands KTH Royal Institute of Technology Division of Decision and Control Systems School of Electrical Engineering and Computer Science Stockholm10044 Sweden KTH Royal Institute of Technology Digital Futures Stockholm10044 Sweden

This paper considers the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms solving this problem require that each agent broadcasts its decision to its neighbors at each iteration. However, communication resources are often limited. To better utilize communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. © 2014 IEEE.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Event-Triggered Bandit Convex Optimization with Time-Varying Constraints

arXiv

引用

arXiv 2024年

作者： Zhang, Kunpeng Yi, Xinlei Wen, Guanghui Cao, Ming Johansson, Karl H. Chai, Tianyou Yang, Tao The State Key Laboratory of Synthetical Automation for Process Industries Northeastern University Shenyang110819 China The Laboratory for Information and Decision Systems Massachusetts Institute of Technology CambridgeMA02139 United States The Department of Mathematics Southeast University Nanjing210096 China The Engineering and Technology Institute Groningen Faculty of Science and Engineering University of Groningen GroningenAG 9747 Netherlands 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 the distributed bandit convex optimization problem with time-varying inequality constraints over a network of agents, where the goal is to minimize network regret and cumulative constraint violation. Existing distributed online algorithms require that each agent broadcasts its decision to its neighbors at each iteration. To better utilize the limited communication resources, we propose a distributed event-triggered online primal-dual algorithm with two-point bandit feedback. Under several classes of appropriately chosen decreasing parameter sequences and non-increasing event-triggered threshold sequences, we establish dynamic network regret and network cumulative constraint violation bounds. These bounds are comparable to the results achieved by distributed event-triggered online algorithms with full-information feedback. Finally, a numerical example is provided to verify the theoretical results. Copyright © 2024, The Authors. All rights reserved.

关键词： Convex optimization

来源：评论

学校读者我要写书评

暂无评论

A Machine Learning Based Risk Identification Method for Illegal Pig Slaughtering

A Machine Learning Based Risk Identification Method for Ille...

引用

2023 International Conference on Intelligent Communication and Networking, ICN 2023

作者： Miao, Jiajun Shen, Yujun Zhang, Yan Liu, Lingjie Tian, Ye Zhao, Yu Zhou, Chunyan Harbin Engineering University College of Computer Science and Technology Harbin China Hangzhou Hikvision Digital Technology Co. Ltd Hangzhou China China Industrial Control Systems Cyber Emergency Response Team Beijing China Environment and Food and Drug Crime Investigation Detachment of Hangzhou Public Security Bureau Hangzhou China Xidian University Hangzhou Institute of Technology Harbin China Key Laboratory of Peace-Building Big Data of Zhejiang Province Hangzhou China

ISBN: (纸本)9798350357677

With the impact of African swine fever, the survival rate of domestic pigs has sharply decreased, and pork prices continue to rise. Many unscrupulous elements obtain illegal profits by avoiding inspection and quarantine, processing sick and dead pigs, and injecting water, etc. Unquarantined meat products pose serious food safety risks. In this context, we propose a machine learning based risk identification method for illegal slaughter of live pigs. Firstly, we use the RetinaNet algorithm to detect live pig transport vehicles and use a dual residual network to Super-Resolution the vehicle area in the detected image to improve facial clarity. Subsequently, the ArcFace algorithm is used to match the facial information with the ex-convicts, and finally, the Location of vehicles passing through, time, frequency and facial analysis results are combined for calculation and scoring and provide the risk warning for illegal slaughter of live pigs. © 2023 IEEE.

关键词： Risk assessment

来源：评论

学校读者我要写书评

暂无评论

Extended State Observer Based Fault-Tolerant Predictive control for a Four-Mecanum Wheels Mobile Robot

Extended State Observer Based Fault-Tolerant Predictive Cont...

引用

IEEE International Conference on Cyber Technology in Automation, control, and Intelligent systems

作者： Binghao Yang Dongliang Wang Ziling Wen Wu Wei Wenji Li Zhun Fan Key Lab of Digital Signal and Image Processing of Guangdong Province Shantou University Guangdong China School of Department of Electronic and Information Engineering Shantou University Guangdong China Key Laboratory of Autonomous Systems and Networked Control Ministry of Education Guangzhou Guangdong China School of Automation Science and Engineering South China University of Technology Guangzhou Guangdong China

ISBN: (数字)9798331506056

ISBN: (纸本)9798331506063

The application of unmanned vehicles in industrial cargo transportation is becoming increasingly widespread, particularly playing a significant role in transporting heavy-duty goods. However, when performing such tasks, whether in single-vehicle transportation or multi-vehicle collaborative transportation, the occurrence of wheel failures can potentially lead to serious safety accidents. Therefore, this paper proposes a fault-tolerant control scheme, establishing a kinematic model considering disturbances and failures, and adopts model predictive control for trajectory tracking. Additionally, an extended state observer is introduced to observe system states and counteract disturbances. To address potential failure issues, a controller reconstruction strategy is proposed. Finally, the effectiveness and superiority of the controller is validated through numerical simulation and comparative experiment.

关键词： Fault tolerance Trajectory tracking Fault tolerant systems Wheels Transportation Kinematics Predictive models Safety State estimation Predictive control

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：