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

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

Automatica 2025年 179卷

作者： Fabin Cheng Jingang Lai School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan 430074 China Key Laboratory of Image Processing and Intelligent Control Ministry of Education Huazhong University of Science and Technology Wuhan 430074 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 scalab.lity and flexibility of the proposed distributed control algorithm.

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

来源：评论

学校读者我要写书评

暂无评论

NiuEM: A Nested-iterative Unsupervised Learning Model for Single-particle Cryo-EM image processing

NiuEM: A Nested-iterative Unsupervised Learning Model for Si...

引用

2020 IEEE International Conference on Bioinformatics and Biomedicine, BIBM 2020

作者： Hu, Rui Cai, Jiaming Zheng, Wangjie Yang, Yang Shen, Hong-Bin Shanghai Jiao Tong University Key Lab. of Shanghai Education Commission for Intelligent Interaction and Cognitive Engineering Department of Computer Science and Engineering Shanghai200240 China Institute of Image Processing and Pattern Recognition Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai200240 China Shanghai Jiao Tong University Department of Bioinformatics and Biostatistics Shanghai200240 China

ISBN: (纸本)9781728162157

Cryo-electron microscopy (cryo-EM) has become a mainstream technology for solving spatial structures of biomacromolecules, while the processing of cryo-EM images is a very challenging task. One of the great challenges is the high noise in the images. A common method is to cluster the images with close projecting angles to get mean images, which are used for 3D reconstruction. However, due to the extremely low signal-to-noise-ratio, common clustering methods often fail to obtain high-quality mean images, leading to poorly reconstructed structures. In this study, we present a new unsupervised learning framework, called NiuEM, to discriminate images captured from different angles and yield cluster-mean images. NiuEM first generates pseudo-lab.ls and then exploits both contrastive loss and cross-entropy loss for training convolutional layers to learn feature representations. Moreover, the pseudo-lab.ls are updated iteratively to enhance the reliability of lab.ls. We assess the performance of NiuEM on four data sets via both visualized and quantitative experiments. Especially, two kinds of metrics are adopted to measure the performance, regarding the clustering quality and the resolution of reconstructed 3D models, respectively. The experimental results show that NiuEM achieves very competitive clustering accuracy in the comparison with the state-of-the-art image clustering methods. Moreover, the cluster mean images yielded by NiuEM lead to better initial 3D models compared with the mainstream reconstruction tools. © 2020 IEEE.

关键词： image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Research on the detection method of alignment beacon based on the spatial structure feature of train bogies

Research on the detection method of alignment beacon based o...

引用

Chinese Automation Congress (CAC)

作者： Chong Cao Shaowei Wan Gang Peng Dingxin He Sheng Zhong Zhang Deng Wentao Guo School of Artificial Intelligence and Automation Huazhong University of Science and Technology Key Laboratory of Image Processing and Intelligent Control Ministry of Education Wuhan China Beijing Railway Institute of Mechanical & Electrical Engineering Group Co. Ltd. Beijing China Wuhan Lisai Technology Co. Ltd. Wuhan China

The high-speed train inspection robot needs to perform alignment parking and image acquisition at the position of the train bogie, and reliable alignment identification marks are the basis for the inspection robot to achieve highprecision alignment parking. The existing alignment method is mainly based on the way of artificial beacons, in the inspection workshop through manual laying of additional identification marks such as QR codes, magnetic stripes, RFID electronic tags, auxiliary robot alignment parking, but this type of method in beacon maintenance, laying costs and other aspects have certain limitations. Aiming at the problem, this paper proposes a vision-based bogie beacon detection method, which combines the target detection technology with the unique bogie spatial structure feature of the train, and provides reliable identification marks for the alignment and parking of the inspection robot. This method improves the alignment accuracy, reduces the cost of laying and maintaining artificial beacons, and has high application value.

关键词： Shafts Costs Wheels Object detection Inspection Maintenance engineering Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A Visual Kinematics Calibration Method for Manipulator Based on Nonlinear Optimization

A Visual Kinematics Calibration Method for Manipulator Based...

引用

Chinese Automation Congress (CAC)

作者： Gang Peng Zhihao Wang Shangbin Guan Zhang Deng Wentao Guo Key Laboratory of Image Processing and Intelligent Control Ministry of Education School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Beijing Railway Institute of Mechanical & Electrical Engineering Group Co. Ltd. Beijing China Wuhan Lisai Technology Co. Ltd. Wuhan China

The traditional kinematic calibration method for manipulators requires precise three-dimensional measuring instruments to measure the end pose, which is not only expensive due to the high cost of the measuring instruments but also not applicable to all manipulators. Another calibration method uses a camera, but the system error caused by the camera’s parameters affects the calibration accuracy of the kinematics of the robot arm. In order to solve this problem, this paper reduces the dimensionality of the experimental data and redesigns the objective function to be optimized. That is, the three-dimensional positions of the feature points of the calibration plate under each manipulator attitude corresponding to the actual kinematic model and the classic D-H kinematic model are mapped into the pixel coordinate system, and the sum of Euclidean distance errors of the pixel coordinates of the two is used as the objective function to be optimized. And then, nonlinear optimization and parameter compensation are performed. The experimental results show that the pixel deviation of the end pose corresponding to the optimized D-H kinematic model proposed in this paper and the end pose corresponding to the actual kinematic model in the pixel coordinate system is 0.99 pixels. Compared with the 7.9 deviation pixels between the pixel coordinates calculated by the classic D-H kinematic model and the actual pixel coordinates, the deviation is reduced by nearly 7 pixels for an 87% reduction in error. Therefore, the proposed method can effectively avoid system errors caused by camera parameters in visual calibration, can improve the absolute positioning accuracy of the end of the robotic arm, and has good economy and universality.

关键词： Visualization Robot kinematics Instruments Robot vision systems Kinematics Manipulators Cameras

来源：评论

学校读者我要写书评

暂无评论

Fuzzy DNA Strand Displacement: A Strategy to Decrease the Complexity of DNA Network Design

引用

Angewandte Chemie 2020年第35期132卷 15089-15095页

作者： Wang Z. Hu Y. Pan L. Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology 1037 Luoyu Road Wuhan 430074 China College of Information Science and Technology Shijiazhuang Tiedao University Shijiazhuang 050043 China

Toehold-mediated DNA strand displacement endows DNA nanostructures with dynamic response capability. However, the complexity of sequence design dramatically increases as the size of the DNA network increases. We attribute this problem to the mechanism of toehold-mediated strand displacement, termed exact strand displacement (ESD), in which one input strand corresponds to one specific substrate. In this work, we propose an alternative to toehold-mediated DNA strand displacement, termed fuzzy strand displacement (FSD), in which one-to-many and many-to-one relationships are established between the input strand and the substrate, to reduce the complexity. We have constructed four modules, termed converter, reporter, fuzzy detector, and fuzzy trigger, and demonstrated that a sequence pattern recognition network composed of these modules requires less complex sequence design than an equivalent network based on toehold-mediated DNA strand displacement. © 2020 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim

关键词： DNA recognition DNA structures enzymes molecular devices self-assembly

来源：评论

学校读者我要写书评

暂无评论

Grey Wolf Optimization Based Self-Organizing Fuzzy Multi-Objective Evolution Algorithm

Research Square

引用

Research Square 2021年

作者： Xie, Jialiang Zhang, Shanli Wang, Honghui Wu, Dongrui School of Science Jimei University Xiamen361021 China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan430074 China Key Laboratory of the Ministry of Education for Image Processing and Intelligent Control China

Two goals of multi-objective evolutionary algorithms are effectively improving its convergence and diversity, and making the Pareto set evenly distributed and close to the real Pareto Front. This paper proposes a grey wolf optimization based self-organizing fuzzy multi-objective evolutionary algorithm. Grey wolf optimization algorithm is used to optimize the initial weights of the self-organizing map network. New neighborhood relationships for individuals are built by self-organizing map, which can maintain the invariance of feature distribution and map the structural information of the current population into Pareto Sets. Based on this neighborhood relationship, this paper uses the fuzzy differential evolution operator, which constructs a fuzzy inference system to dynamically adjust the weighting parameter in the differential operator, to generate a new initial solution, and the polynomial mutation operator to refine them. Boundary processing is then conducted. Experiments on fifteen test problems were conducted to verify its effectiveness. Results show that the convergence and diversity of the proposed algorithm are better than several state-of-the-art multi-objective evolutionary algorithms. © 2021, CC BY.

关键词： Self organizing maps

来源：评论

学校读者我要写书评

暂无评论

A Pushing-Grasping Collab.rative Method Based on Deep Q-Network Algorithm in Dual Viewpoints

Research Square

引用

Research Square 2021年

作者： Peng, Gang Liao, Jinhu Guan, Shangbin Yang, Jin Li, Xinde 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 China School of Automation South East University Nanjing China

In the field of intelligent manufacturing, robot grasping and sorting is an important content. However, in the traditional 2D camera-based robotic arm grasping method, the grasping efficiency is low and the grasping accuracy is low when facing the scene of stacking and occlusion. Insufficiency and other issues, a dual perspective-based deep reinforcement learning promotion and capture method is proposed. In this case, a novel method of pushing-grasping collab.rative based on the deep Q-network in dual viewpoints is proposed in this paper. This method adopts an improved deep Q-network algorithm, with an RGB-D camera to obtain the information of objects’ RGB images and point clouds from two viewpoints, and combines the pushing and grasping actions, so that the trained manipulator can make the scenes better for grasping, so that it can perform well in more complicated grasping scenes. What’s more, we improved the reward function of the deep Q-network and propose the piecewise reward function to speed up the convergence of the deep Q-network. We trained different models and tried different methods in the V-REP simulation environment, and it drew a conclusion that the method proposed in this paper converges quickly and the success rate of grasping objects in unstructured scenes raises up to 83.5%. Besides, it shows the generalization ability and well performance when novel objects appear in the scenes that the manipulator has never grasped before. © 2021, CC BY.

关键词： Manipulators

来源：评论

学校读者我要写书评

暂无评论

Large-scale Multiobjective Optimization via Problem Decomposition and Reformulation

Large-scale Multiobjective Optimization via Problem Decompos...

引用

Congress on Evolutionary Computation

作者： Lianghao Li Cheng He Ran Cheng Linqiang Pan Key Laboratory of Image Information Processing and Intelligent Control of Education Ministry of China School of Artificial Intelligence and Automation Huazhong University of Science and Technology Wuhan China Guangdong Provincial Key Laboratory of Brain-inspired Intelligent Computation Southern University of Science and Technology Shenzhen China

Large-scale multiobjective optimization problems (LSMOPs) are challenging for existing approaches due to the complexity of objective functions and the massive volume of decision space. Some large-scale multiobjective evolutionary algorithms (LSMOEAs) have recently been proposed, which have shown their effectiveness in solving some benchmarks and real-world applications. They merely focus on handling the massive volume of decision space and ignore the complexity of LSMOPs in terms of objective functions. The complexity issue is also important since the complexity grows along with the increment in the number of decision variables. Our previous study proposed a framework to accelerate evolutionary large-scale multiobjective optimization via problem reformulation for handling large-scale decision variables. Here, we investigate the effectiveness of LSMOF combined with decomposition-based MOEA (MOEA/D), aiming to handle the complexity of LSMOPs in both the decision and objective spaces. Specifically, MOEA/D is embedded in LSMOF via two different strategies, and the proposed algorithm is tested on various benchmark LSMOPs. Experimental results indicate the encouraging performance improvement benefited from the solution of the complexity issue in large-scale multiobjective optimization.

关键词： Sociology Evolutionary computation Benchmark testing Linear programming Complexity theory Statistics Optimization

来源：评论

学校读者我要写书评

暂无评论

Online Attentive Kernel-Based Temporal Difference Learning

arXiv

引用

arXiv 2022年

作者： Yang, Guang Chen, Xingguo Yang, Shangdong Wang, Huihui Dong, Shaokang Gao, Yang The the Jiangsu Key Laboratory of Big Data Security & Intelligent Processing Nanjing University of Posts and Telecommunications National Engineering Laboratory for Agri-Product Quality Traceability Beijing Technology and Business University China The State Key Laboratory for Novel Software Technology Nanjing University China The PCA Lab Key Lab of Intelligent Perception and Systems for High-Dimensional Information Ministry of Education Jiangsu Key Lab of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing University of Science and Technology China

With rising uncertainty in the real world, online Reinforcement Learning (RL) has been receiving increasing attention due to its fast learning capability and improving data efficiency. However, online RL often suffers from complex Value Function Approximation (VFA) and catastrophic interference, creating difficulty for the deep neural network to be applied to an online RL algorithm in a fully online setting. Therefore, a simpler and more adaptive approach is introduced to evaluate value function with the kernel-based model. Sparse representations are superior at handling interference, indicating that competitive sparse representations should be learnable, non-prior, non-truncated and explicit when compared with current sparse representation methods. Moreover, in learning sparse representations, attention mechanisms are utilized to represent the degree of sparsification, and a smooth attentive function is introduced into the kernel-based VFA. In this paper, we propose an Online Attentive Kernel-Based Temporal Difference (OAKTD) algorithm using two-timescale optimization and provide convergence analysis of our proposed algorithm. Experimental evaluations showed that OAKTD outperformed several Online Kernel-based Temporal Difference (OKTD) learning algorithms in addition to the Temporal Difference (TD) learning algorithm with Tile Coding on public Mountain Car, Acrobot, CartPole and Puddle World tasks. Copyright © 2022, The Authors. All rights reserved.

关键词： Learning algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：