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

Distributed Estimator-Based Fuzzy Containment control for Nonlinear Multi-Agent systems with Deferred Constraints

IEEE Transactions on Fuzzy systems 2025年

作者： Ma, Hui Zhou, Qi Ren, Hongru Wang, Zhenyou The School of Mathematics and Statistics Guangdong University of Technology Guangdong Guangzhou510006 China The School of Automation Guangdong-Hong Kong Joint Laboratory for Intelligent Decision and Cooperative Control Guangdong Provincial Key Laboratory for Intelligent Decision and Cooperative Control Guangdong University of Technology Guangzhou510006 China

This paper concentrates on the adaptive fuzzy containment control approach for a class of nonlinear multiagent systems with deferred constraint and actuator failure. Firstly, considering that not all agents can directly receive the leader signals, this paper constructs a distributed prescribed-time estimator to provide each agent with a corresponding reference signal, thereby the containment problem is constructed as a tracking problem. Subsequently, with the help of the prescribed-time scaling function and the barrier function, the problem of deferred output constraint is reformulated as a boundedness problem of the new variable. By introducing several useful lemmas, the designed controller can ensure that the closed-loop signals are bounded in the presence of actuator fault in the system. In addition, through the designed fuzzy control algorithm, it can strictly guarantee that the system output converges within the ideal range after the settling time. The superiority and effectiveness of this method are verified through robots experiments. © 1993-2012 IEEE. All rights reserved.

关键词： Fuzzy control

来源：评论

学校读者我要写书评

暂无评论

Leader-Following Consensus control for Multi-Agent systems Under DoS Attacks and Average Dwell Time Switching Topology

Leader-Following Consensus Control for Multi-Agent Systems U...

引用

Chinese automation Congress (CAC)

作者： Li Yuan Shuai Liu Panshuo Li Guangdong Provincial Key Laboratory of Intelligent Decision and Cooperative Control and Guangdong-Hong Kong Joint Laboratory for Intelligent Decision and Cooperative Control School of Automation Guangdong University of Technology Guangzhou Guangzhou China

ISBN: (数字)9798350368604

ISBN: (纸本)9798350368611

This article studies the leader-following consensus problem of multi-agent systems (MASs) in the presence of denial-of-service (DoS) attacks and switching topology. The problem that all edges of one follower are blocked under each attack is considered in this work. By using the multiple Lyapunov functions approach and average dwell time switching technique, a piecewise consensus protocol is designed. Sufficient conditions are established for the consensus of linear MAS. Moreover, the lower bound of average dwell time of the switching topology is determined under DoS attacks. Finally, we provided simulations to validate our theoretical finding.

关键词： Sufficient conditions Lower bound automation Switches Consensus control Denial-of-service attack Topology Consensus protocol Multi-agent systems Lyapunov methods

来源：评论

学校读者我要写书评

暂无评论

Bearing Fault Diagnosis Under Variable Working Conditions Based on Domain Adaptation and Improved Depthwise Separable Convolution Network 26

Bearing Fault Diagnosis Under Variable Working Conditions Ba...

引用

26th International Conference on Industrial Technology, ICIT 2025

作者： Kuang, Zehui Mao, Fan Zhao, Xingyu Wan, Xiongbo School of Automation China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China School of Future Technology China University of Geosciences Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan China

ISBN: (纸本)9798331521950

Domain adaptation methods and appropriate feature extractors are usually applied to solve the problem that the variable working conditions of bearings affect the effectiveness of the fault diagnostic framework. However, the existing feature extractors are too complex to be deployed in real industries. In this paper, we propose a lightweight framework called improved depthwise separable convolution network (IDSCN) for the diagnosis of bearing faults in variable operating conditions. IDSCN is built on wavelet convolution and depthwise separable residual convolution (DSRC), where the wavelet convolution is used to extract frequency features from the source and target domains, and DSRC guarantees the performance of feature extraction with reduced parameters and computation. To minimise the distribution difference between the source and target domains, the local maximum mean difference is incorporated into the proposed framework. The performance of the proposed framework is validated on the Paderborn University dataset, involving a total of 6 transfer tasks. The experiment shows that the proposed framework achieves satisfactory results and outperforms other frameworks in bearing fault diagnosis. © 2025 IEEE.

关键词： Bearing fault diagnosis Depthwise separable residual convolution Domain adaptation Wavelet convolution

来源：评论

学校读者我要写书评

暂无评论

Relative Localization for UAV-UGV Based on Correlation of Bearing and Distance

Relative Localization for UAV-UGV Based on Correlation of Be...

引用

IEEE International Conference on Mechatronics and automation

作者： Jia Guo Kang Hu Jinting Liu State Key Laboratory of Intelligent Control and Decision of Complex Systems School of Automation Beijing Institute of Technology No.5 Zhongguancun South Street Beijing China

To ensure reliable localization for Unmanned Aerial Vehicles(UAVs) in the presence of uncertain speed of the Unmanned Ground Vehicle (UGV), this study examines the relative localization problem of UAV-UGV using distance and bearing measurements. A Correlation of Bearing and Distance-based Relative Localization (CBDRL) algorithm is proposed in this paper under this scenario. The estimation of altitude, distance, and angle are simplified into a representation of the relative positioning between the UAV and UGV. The relative height difference is measured using the barometer in the algorithm. To determine the relative distance, Time of Arrival (TOA) ranging and Ultra Wide Band (UWB) communication are utilized. The relative direction measurement is then determined using the correlations of bearing and distance. We integrate these observations with height, direction, and distance data in an Extended Kalman Filter(EKF) to provide accurate and reliable relative position estimates that allow the UAV to track the target. The simulation results indicate that the CBDRL method developed in this study is superior to previous relative localization algorithms that rely on multi-sensor fusion, and can significantly enhance the accuracy of UAV positioning provided that range and angle measurements are precise enough.

关键词：

来源：评论

学校读者我要写书评

暂无评论

USV Path Planning Based on ACO-SA Algorithm 42

USV Path Planning Based on ACO-SA Algorithm

引用

42nd Chinese control Conference, CCC 2023

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

ISBN: (纸本)9789887581543

This paper solves USV path planning problem constrained by multiple factors via ant-colony optimization algorithm. First, this paper uses the ways of multi-objective optimization to model the USV path planning problem. An improved ant colony algorithm named ACO-SA is put forward afterwards to effectively solve the problem. The algorithm is a combination of ACO algorithm(ant colony algorithm) and SA algorithm(simulated annealing algorithm), which has three improments: change the initial distribution of pheromone to guide the search when the algorithm has just started running;change the heuristic function and state transition probability taking three factors into consideration;change the pheromone update rule and make the ants compete for the right to update pheromone by simulated annealing algorithm, and update the best solution by the same algorithm. Finally, simulation experiment and field experiment are conducted to check the validity of ACO-SA algorithm. © 2023 Technical Committee on control Theory, Chinese Association of automation.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

A Multi-view Non-negative Matrix Factorization Single-cell Clustering Algorithm for Missing Data

A Multi-view Non-negative Matrix Factorization Single-cell C...

引用

2022 International Conference on Algorithms, Data Mining, and Information Technology, ADMIT 2022

作者： Yu, Ailian Zhu, Yuan School of Automation China University of Geosciences Wuhan430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan China

ISBN: (数字)9781665454728

ISBN: (纸本)9781665454728

A significant study focus on the field of bioinformatics has been on how to quickly and accurately accomplish the cell clustering task using computational approaches for single-cell RNA sequencing (scRNA-seq) data. Technical issues with scRNA-seq data include missing values, high noise levels, and a large batch impact. While the single-cell data recovery method based on data filling can enhance data quality, it will subjectively alter the distribution of data. To address the above-mentioned issues, we propose a non-negative matrix factorization clustering algorithm (scMVNMF) based on multi-view data of scRNA-seq. Under the assumption of essentially unchanging original data distribution, it can not only identify the typical low-dimensional representation patterns of multi-view data but also produce final explicable clustering findings. The results of the experiments demonstrate that the suggested algorithm has some advantages over the filling approach in terms of clustering tasks and can maintain a certain level of stability when the quality of single-cell data varies. © 2022 IEEE.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

Analysis of LoRa for Electronic Shelf Labels Based on Distributed Machine Learning

Analysis of LoRa for Electronic Shelf Labels Based on Distri...

引用

Chinese control Conference (CCC)

作者： Malak Abid Ali Khan Hongbin Ma Ying Jin Jingxiang Ma Zia Ur Rehman Mizanur Rahman School of Automation Beijing Institute of Technology Beijing China State Key Laboratory of Intelligent Control and Decision of Complex Systems Beijing Institute of Technology Beijing China

Deforestation is the primary source of global warming; traditional shelf labels use paper to display the price of the products, and human forces play a pivotal role in updating the tags where the pandemic has strictly limited its power. Various technologies provide connectivity and a fast-updating system to eliminate the paper-based approach. LoRa is one of the contenders to design the system for electronic shelf labels (ESLs). In this paper, LoRa has been used to minify data losses and guarantee the successful decoding of the carrier signals. The data parallelism at the network server (NS) is used to distribute the data packets among the gateways (GWs) for concurrent transmissions to the end devices (EDs). The EDs are placed in different ranges using machine clustering to avoid intra-SF interference and collision. The data rate (DR) and spreading factors (SFs) have been proposed to improve the performance of pure and slotted ALOHA for the properly allocated tags. The orthogonality principles follow industrial, scientific, and medical regulations (ISM) to avoid data traffic congestion. GWs under different duty cycles (DC) and bandwidth (BW) are examined to minify the network saturation and reduce the energy harvesting of the tags.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Dynamic Graph Dismantling with Reinforcement Supervised Learning 42

Dynamic Graph Dismantling with Reinforcement Supervised Lear...

引用

42nd Chinese control Conference, CCC 2023

作者： Wang, Yumei Tang, Chuancong Zhang, Hai-Tao School of Artificial Intelligence and Automation Huazhong University of Science and Technology The Engineering Research Center of Autonomous Intelligent Unmanned Systems The Key Laboratory of Image Processing and Intelligent Control The State Key Laboratory of Digital Manufacturing Equipment and Technology Wuhan430074 China

ISBN: (纸本)9789887581543

There are always some 'key' nodes in a big complex network, which can joint the most connected subgraphs. How to identify these nodes, finding a minimum set of nodes to attack for reducing the size of residual network's Largest Connected Component(LCC) to break up the original network, has become a research hotspot. Therefore, a method for determining the 'key' nodes based on reinforcement learning framework and supervised learning model is proposed. This algorithm can not only utilize the dynamic exploration ability of reinforcement learning to collect a rich training dataset, but also take advantage of the characteristics that supervised learning is adaptive and has strong generalization ability to possess high efficiency and strong robustness. In order to further improve the algorithm's performance, ϵ-greedy mechanism is used to explore more network states. The experiment results show that given the same fraction of removed nodes, our algorithm can make the residual LCC smaller in various networks which is superior to the state-of-the-art algorithms in terms of effectiveness and generalization. © 2023 Technical Committee on control Theory, Chinese Association of automation.

关键词： complex networks

来源：评论

学校读者我要写书评

暂无评论

Koopman Operator Learning control of the Piezoelectric Actuator 42

Koopman Operator Learning Control of the Piezoelectric Actua...

引用

42nd Chinese control Conference, CCC 2023

作者： Huang, Xiang Zhang, Hai-Tao School of Artificial Intelligence and Automation Huazhong University of Science and Technology Engineering Research Center of Autonomous Intelligent Unmanned Systems The Key Laboratory of Image Processing and Intelligent Control The State Key Laboratory of Digital Manufacturing Equipment and Technology Wuhan430074 China

ISBN: (纸本)9789887581543

The piezoelectric actuator is one kind of device that can drive nanoscale motion. However, the nonlinear hysteresis effect induced by its natural material greatly degrades its positioning accuracy. To handle this challenging issue, this work develops a Koopman model predict control (Koopman- MPC) framework for the piezoelectric actuator. Specifically, the Koopman operator theory is adapted for modeling the piezoelectric actuator dynamics. A simple yet powerful linear model spanned in a high-dimensional space is thus constructed to characterize the hysteresis dynamics. Subsequently, upon the established Koopman model, an MPC scheme is put forward for tracking control of piezoelectric actuators. Therein, by sustained optimizing a cost function containing future outputs and control increments, the control input is obtained. Moreover, extensive tracking simulations are carried out on a simulated piezoelectric actuator for verifying the feasibility and effectiveness of the Koopman- Mpc scheme. © 2023 Technical Committee on control Theory, Chinese Association of automation.

关键词： Model predictive control

来源：评论

学校读者我要写书评

暂无评论

A Test Suite and An Optimizer for Dietary Nutrition Optimization Problem: From Constrained Many-Objective Perspective

A Test Suite and An Optimizer for Dietary Nutrition Optimiza...

引用

2023 IEEE Congress on Evolutionary Computation, CEC 2023

作者： Ti, Yaqi Li, Changhe Yang, Shengxiang Hubei Key Laboratory of Advanced Control and Intelligent Automation for Complex Systems Wuhan430074 China Engineering Research Center of Intelligent Technology for Geo-Exploration Ministry of Education Wuhan430074 China School of Computer Science and Informatics De Montfort University Leicester United Kingdom

ISBN: (纸本)9798350314588

With increasing people who suffer from diet-related diseases, providing suggestions for personal daily nutrient-dense intake is highly expected. However, current dietary nutrition models are less precise, and dietary nutrition optimizers usually fail to give satisfactory solutions. Therefore, we construct a constrained many-objective nutrition model with more precise nutrient assessments and a scalable constrained many-objective benchmark set. This test suite has great flexibility in evaluating algorithms' performance on high dimensional search and objective spaces with some feasible region fragments. We also propose a kd-tree based dynamic constrained many-objective evolutionary algorithm to search for customized food combinations according to personal daily consumption and intake preference. Experiments show that our algorithm has better diversity maintenance ability in high dimension space. © 2023 IEEE.

关键词： Nutrition

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：