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

Scale-free distributed control for the DC MG cluster under DoS attacks: An asynchronous switched strategy

Automatica 2025年 179卷

作者： Cheng, Fabin Lai, Jingang School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan430074 China

This paper studies the voltage restoration problem of the DC Microgrid (MG) cluster with a two-layer communication structure under Denial-of-Service (DoS) attacks. Based on the open multiagent framework, an asynchronous switching strategy is designed to suppress the impact of DoS attacks on the entire MG cluster's voltage restoration. Meanwhile, we derived the relationship between attack model parameters and communication link switching mode selection through the general model of DoS attacks and asynchronous switching methods based on average dwell time. Moreover, the designed distributed control protocol is scale-free;that is, it does not rely on any information from the two-layer communication structure and the number of distributed generations (DGs), which makes it universal. Through rigorous theoretical proof, it has been proven that in the DC MG cluster with two-layer communication structures, voltage restoration can be achieved regardless of the number and structure of DGs being attacked. Finally, two simulation examples on the MATlab/SimPowerSystem, including a DC MG cluster consisting of 8 DGs and an IEEE 33-node system are used to investigate the scalability and flexibility of the proposed distributed control algorithm. © 2025 Elsevier Ltd

关键词： Asynchronous switched strategy DC MG cluster Distributed control DoS attack Scale-free

来源：评论

学校读者我要写书评

暂无评论

The Bipartite Consensus for Multi-Agent Systems With Matrix-Weight-Based Signed Network

引用

IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS 2020年第10期67卷 2019-2023页

作者： Su, Housheng Chen, Jinhe Yang, Yucheng Rong, Zhihai Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Key Lab Image Proc & Intelligent Control Educ Minist China Wuhan 430074 Peoples R China Univ Elect Sci & Technol China Sch Comp Sci & Engn Chengdu 610054 Peoples R China

This brief focuses on the consensus problem of multi-agent systems (MASs) consisting of friends and enemies in a matrix-weight-based signed topological network. To highlight the effects of matrix coupling, we analyze the integrator model in a competitive-cooperative coexistence network. Unlike scalar-weight-based topological networks, the phenomenon of clustering in matrix-weight-based networks naturally exists, which means the important role of matrix coupling in convergence. Hence, different form existing results, depending on matrix coupling, the research shows bipartite consensus can be achieved in an unbalanced situation. Algebraic conditions are proposed for achieving a bipartite consensus and our results on structural unbalanced graph are shown to be more universality. Finally, some simulation results are given to vindicate the analysis.

关键词： Couplings Laplace equations Symmetric matrices Circuits and systems Multi-agent systems Topology Matrix-weighted consensus bipartite consensus signed graph structural unbalance

来源：评论

学校读者我要写书评

暂无评论

Robust quantum teleportation via a non-Markovian channel

arXiv

引用

arXiv 2023年

作者： Wang, Yanfang Xue, Shibei Song, Hongbin Jiang, Min Department of Automation Shanghai Jiao Tong University Shanghai200240 China Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Engineering Research Center of Intelligent Control and Management Shanghai200240 China General Education Division Shenzhen Key Lab of Semiconductor Lasers The Chinese University of Hong Kong Guang Dong Shenzhen518116 China School of Electronics and Information Engineering Soochow University Suzhou215006 China

In this paper, we propose a non-Markovian quantum channel approach to mitigating the degradation of the average fidelity in continuous-variable quantum teleportation. The non-Markovian quantum channel is modeled by an augmented system, where ancillary systems are introduced to represent the internal modes of non-Markovian environments. With a proper non-Markovianity, enhanced effects of the channels on continuous-variable quantum teleportation are observed. Also, the logarithmic negativity of entangled states can be effectively maintained so that the decay of the average fidelity of quantum teleportation is mitigated. In addition, the analysis on different teleported quantum states shows that coherent states exhibit stronger robustness than those of squeezed states and cat states in quantum teleportation with a non-Markovian channel. Copyright © 2023, The Authors. All rights reserved.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Head-free,Human Gaze-driven Assistive Robotic System for Reaching and Grasping

Head-free,Human Gaze-driven Assistive Robotic System for Rea...

引用

第40届中国控制会议

作者： Bo Yang Jian Huang Menglin Sun Jun Huo Xiaolong Li Caihua Xiong The Key Laboratory of Image Processing and Intelligent Control School of Artificial Intelligence and AutomationHuazhong University of Science and Technology the School of Mechanical Science and Engineering and the State Key Laboratory of Digital Manufacturing Equipment and Technology Huazhong University of Science and Technology

Patients with limb dysfunction have limited mobility,which prevents them from performing daily *** have developed an assistive robot system with an intuitive head free gaze *** system consists of multiple modules,including 3 D gaze estimation,head free coordinate transformation,intention recognition,and robot trajectory *** robotic assistive system obtains clues from the user’s gaze to decode their intentions and implement *** allows the user only needs to look at the objects to make the robot system reach,grasp,and bring them to the *** 3 D gaze estimation is evaluated with 5 subjects,showing an overall accuracy of 5.53±1.2 *** integrated system’s experimental results show that the success rate is 96% in the implementation of automatic trajectory planning,and the success rate is 92% in the implementation of fixation-based trajectory ***,the results and work required to improve the system are discussed.

关键词： 3D gaze estimation Intention estimation Gaze-based control Assistive robot

来源：评论

学校读者我要写书评

暂无评论

Adaptive tracking synchronization for coupled reaction-diffusion neural networks with parameter mismatches

引用

NEURAL NETWORKS 2020年 124卷 146-157页

作者： Zhang, Hao Ding, Zhixia Zeng, Zhigang Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Key Lab Image Proc & Intelligent Control Educ Min Wuhan 430074 Peoples R China Wuhan Inst Technol Sch Elect & Informat Engn Wuhan 430205 Peoples R China

In this paper, tracking synchronization for coupled reaction-diffusion neural networks with parameter mismatches is investigated. For such a networked control system, only local neighbor information is used to compensate the mismatch characteristic termed as parameter mismatch, uncertainty or external disturbance. Different from the general boundedness hypothesis, the parameter mismatches are permitted to be unbounded. For the known parameter mismatches, parameter-dependent controller and parameter-independent adaptive controller are respectively designed. While for fully unknown network parameters and parameter mismatches, a distributed adaptive controller is proposed. By means of partial differential equation theories and differential inequality techniques, the tracking synchronization errors driven by these nonlinear controllers are proved to be uniformly ultimately bounded and exponentially convergent to some adjustable bounded domains. Finally, three numerical examples are given to test the effectiveness of the proposed controllers. (C) 2020 Elsevier Ltd. All rights reserved.

关键词： Tracking synchronization Reaction-diffusion neural network Adaptive control Parameter mismatch

来源：评论

学校读者我要写书评

暂无评论

The Design of Memristive Circuit for Affective Multi-Associative Learning

引用

IEEE TRANSACTIONS ON BIOMEDICAL CIRCUITS AND SYSTEMS 2020年第2期14卷 173-185页

作者： Wang, Zilu Wang, Xiaoping Lu, Zezao Wu, Weiguo Zeng, Zhigang Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Educ Minist China Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China Harbin Inst Technol Sch Mechatron Engn Harbin 150001 Peoples R China

In this work, a memristive circuit with affective multi-associative learning function is proposed, which mimics the process of human affective formation. It mainly contains three modules: affective associative learning, affective formation, affective expression. The first module is composed of several affective single-associative learning circuits consisting of memristive neurons and synapses. Memristive neuron will be activated and output pulses if its input exceeds the threshold. After it is activated, memristive neuron can automatically return to the inactive state. Memristive synapse can realize learning and forgetting functions based on the signals from pre- and post-neurons. The learning rule is pre-neuron activated lags behind post-neuron for a short time;the forgetting rule is to repeatedly activate pre-neuron after the emotion is learned. The process of learning or forgetting corresponds to facilitating or inhibiting synaptic weight, that is, decreasing or increasing memristance continuously. Different voltage signals applied to memristors and different parameters of memristors would lead to different synaptic weights which indicate different affective association. The second module can convert affective signals to corresponding emotions. The formed emotions can be shown in a face by the third module. The simulation results in PSPICE show that the proposed circuit system can learn, forget and form emotions like human. If the proposed circuit is further used on a humanoid robot platform through further research, the robot will have the ability of affective interaction with human so that it can be effectively used in affective company and other aspects.

关键词： Affective associative learning affective formation Little Albert experiment memristive circuit system

来源：评论

学校读者我要写书评

暂无评论

image saliency detection via multi-feature and manifold-space ranking 2021

Image saliency detection via multi-feature and manifold-spac...

引用

3rd Asia Pacific Information Technology Conference, APIT 2021

作者： Li, Xiaoli Zhao, Huaici Liu, Yunpeng Shenyang Institute of Automation Chinese Academy of Sciences Shenyang110016 China Institutes for Robotics and Intelligent Manufacturing Chinese Academy of Sciences Shenyang110169 China University of Chinese Academy of Sciences Beijing100049 China Key Laboratory of Opto-Electronic Information Processing Shenyang110016 China The Key Lab of Image Understanding and Computer Vision Shenyang110016 China Shenyang Jianzhu University Shenyang110168 China

ISBN: (纸本)9781450388108

In this paper, we propose an image saliency detection method by using multi-feature and manifold-space ranking. Basically, the proposed method extracts the color-histogram feature to obtain the fine information of the image, and the color-mean feature to obtain the coarse information respectively. To further improve the detection accuracy of the feature correlation between different image units, a manifold-space ranking method is used to calculate saliency values of image units to construct a saliency map on each feature-space. Specifically, we fuse the two saliency maps to obtain the final saliency map. Extensive experiments demonstrate that the proposed method not only outperforms the other methods, but also improves the accuracy and robustness of the saliency detection. © 2021 ACM.

关键词： Color

来源：评论

学校读者我要写书评

暂无评论

Lithium-ion battery state-of-charge estimation using a real-time moving horizon estimation algorithm

Lithium-ion battery state-of-charge estimation using a real-...

引用

Fault Detection, Supervision and Safety for Technical Processes (SAFEPROCESS), CAA Symposium on

作者： Jiayu Yan Song Li Yiming Wan Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan China the 29th Research Institute of China Electronics Technology Group Corporation Chengdu China

ISBN: (纸本)9781665401166

For battery management systems, it is significant to reliably estimate state-of-charge (SOC) from limited measurements in real time. Based on a nonlinear SOC-dependent equivalent circuit model, we propose a real-time moving horizon estimation (MHE) algorithm for SOC estimation. For efficient computation, the sequential quadratic programming strategy is applied, and each quadratic programming (QP) iteration is solved via the structure-exploiting forward and backward recursions. To account for the limited computation time allowed within each sampling interval, the proposed algorithm does not fully solve the receding horizon optimization problem over each sliding window, but performs fixed number of QP iterations. The simulation results show that compared to the existing fully solved MHE applied to SOC estimation, the proposed real-time MHE algorithm significantly saves computation time at the cost of a slight loss of estimation performance.

关键词： Computational modeling Simulation Estimation Real-time systems Time measurement Computational efficiency State of charge

来源：评论

学校读者我要写书评

暂无评论

A memristor-based generalization and differentiation circuit design and the application in recognition 39

A memristor-based generalization and differentiation circuit...

引用

39th Chinese control Conference (CCC)

作者： Shang, Meijia Wang, Xiaoping Li, Mian Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Educ Minist China Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China

ISBN: (纸本)9789881563903

The traditional Pavlov associative memory circuit realizes the law of learning and forgetting in classical conditioned reflex. In addition, the law of generalization and differentiation also belongs to classical conditioned reflex, so the process of associative memory can be more effectively simulated by adding generalization and differentiation theory on the basis of traditional associative memory. In this paper, a memristor-based circuit is designed to implement generalization and differentiation based on Pavlov associative memory. The circuit can be applied to simple classification recognition. Based on the features of objects as input, the output of the circuit is used as the classification result to achieve the function of classification and recognition. Finally, the accuracy of classification recognition on the generalization and differentiation circuit proposed in this paper can be verified by the simulation results in PSPICE.

关键词： Memristor generalization differentiation Pavlov associative memory recognition

来源：评论

学校读者我要写书评

暂无评论

Hop Count Distribution for Minimum Hop-Count Routing in Finite Ad Hoc Networks

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2022年第7期21卷 5317-5332页

作者： Li, Silan Hu, Xiaoya Jiang, Tao Zhang, Rongqing Yang, Liuqing Hu, Hui Huazhong Univ Sci & Technol Wuhan Natl Lab Optoelect Sch Cyber Sci & Engn Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Sixth Generat Mobile Commun 6G Res Ctr Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Minist Educ Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China Huazhong Univ Sci & Technol Minist Educ Key Lab Image Proc & Intelligent Control Wuhan 430074 Peoples R China Tongji Univ Sch Software Engn Shanghai 201804 Peoples R China Univ Minnesota Dept Elect & Comp Engn Minneapolis MN 55455 USA Huazhong Univ Sci & Technol Sch Artificial Intelligence & Automat Wuhan 430074 Peoples R China

Hop count distribution (HCD), generally formulated as a discrete probability distribution of the hop count, constitutes an attractive tool for performance analysis and algorithm design. This paper devotes to deriving an analytical HCD expression for a finite ad hoc network under the minimum hop-count routing protocols. Formulating the node distribution with binomial point process, the network is provided as a bounded area with all nodes randomly and uniformly distributed. Considering an arbitrary pair of source node (SN) and destination node, an innovative and straightforward definition is presented for HCD. In order to derive HCD out, an original mathematical framework, named as the equivalent area replacement method (EARM), is proposed and verified. Under the EARM, HCD is derived by first considering the special case where SN locates at the network center and then extending to the general case where SN is randomly distributed. For each case, the accuracy of our HCD model is evaluated by simulation comparison. Results show that our model matches well with the simulation results over a wide range of parameters. Particularly, the derived HCD outperforms the existing formulations in terms of the Kullback Leibler divergence, especially when SN is randomly distributed.

关键词： Routing Ad hoc networks Graphical models Distribution functions Mathematical models Routing protocols Spread spectrum communication Ad hoc networks hop count distribution minimum hop-count route binomial point process random coverage of multiple circles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：