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

Second-order consensus of discrete-time multi-agent systems in directed networks with nonlinear dynamics via impulsive protocols

引用

NEUROCOMPUTING 2018年 286卷 51-57页

作者： Han, Yiyan Li, Chuandong Southwest Univ Chongqing Key Lab Nonlinear Circuits & Intelligen Coll Elect & Informat Engn Chongqing 400715 Peoples R China

In this paper, we discuss the second-order consensus problem of discrete-time multi-agent systems with fixed and switching topology. Impulsive protocols are introduced for such multi-agent systems with non-linear dynamics. The consensus problem of multi-agent systems is analyzed by algebraic graph theory and matrix theory, where a connection of impulsive control methods and network topologies is established. Our main results indicate that the second-order consensus of multi-agent systems can be achieved if the graphs of the topology are balanced and strongly connected under suitable conditions. Numerical simulations are presented to support the theoretical results. (C) 2018 Elsevier B.V. All rights reserved.

关键词： Impulsive protocols Discrete-time multi-agent systems Second-order consensus nonlinear dynamics

来源：评论

学校读者我要写书评

暂无评论

The Nystrom Kernel Conjugate Gradient Algorithm Based on k-Means Sampling

引用

IEEE ACCESS 2020年 8卷 18716-18726页

作者： He, Fuliang Xiong, Kui Wang, Shiyuan Southwest Univ Chongqing Key Lab Nonlinear Circuits & Intelligen Coll Elect & Informat Engn Chongqing 400715 Peoples R China

The kernel conjugate gradient (KCG) algorithms have been proposed to improve the convergence rate and the filtering accuracy of kernel adaptive filters (KAFs) efficiently. However, sparsification is necessary in the KCG algorithms to curb the growth of network structure for online applications. To this end, a novel online kernel conjugate gradient algorithm under the mean square error criterion is proposed to approximate the kernel matrix in KAFs by combining k-means sampling into the Nystr Rom method in a fixed-dimensional feature space, namely a NystrRom kernel conjugate gradient algorithm based on k-means sampling (NysKCG-KM). The approximation accuracy of the kernel matrix as well as the filtering performance of NysKCG-KM are therefore guaranteed by k-means sampling. The proposed NysKCG-KM with no requirement of sparsification can achieve dramatically better filtering accuracy than the kernel least mean square with sparsification, and approach the filtering accuracy of the kernel recursive least squares with sparsification. Monte Carlo simulations using both the synthetic and real-world data validate the superiorities of the proposed NysKCG-KM.

关键词： Stochastic gradient descent kernel conjugate gradient recursive method Nystrom approximation k-means sampling online learning complexity

来源：评论

学校读者我要写书评

暂无评论

Fully relative state constraint impulsive consensus of nonlinear multi-agent systems via state-dependent impulsive protocols

引用

IET CONTROL THEORY AND APPLICATIONS 2021年第2期15卷 209-222页

作者： Zhang, Qiangqiang Li, Chuandong He, Zhilong Han, Yiyan Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China

In this paper, the state-dependent impulsive consensus problem of nonlinear multi-agent systems in directed topology with fully relative state constraint impulses is investigated. State-dependent impulsive protocols are designed for achieving leader-following exponential consensus. By constructing comparison systems, consensus problem of multi-agent systems with state-dependent impulses can be simplified to the ones with fixed-time impulses. In addition, state constraint impulses are considered to limit the jump values of impulses beyond the threshold. Based on algebraic graph theory, convex analysis, comparison principle and stability theory, some novel criteria of impulsive consensus have been proposed. Authors' main results indicate that fully relative state constraint impulsive consensus of nonlinear multi-agent systems via state-dependent impulsive protocols can be achieved if the nonlinear systems satisfy suitable conditions. Numerical simulations are presented to validate the effectiveness of theoretical results.

关键词： Combinatorial mathematics Stability in control theory Multivariable control systems nonlinear control systems

来源：评论

学校读者我要写书评

暂无评论

Event-Triggered Adaptive Control of nonlinear Systems With Dynamic Uncertainties: The Switching Threshold Case

引用

IEEE TRANSACTIONS ON circuits AND SYSTEMS II-EXPRESS BRIEFS 2022年第8期69卷 3540-3544页

作者： Pang, Ning Wang, Xin Wang, Ziming Southwest Univ Chongqing Key Lab Nonlinear Circuits & Intelligen Coll Westa Chongqing 400715 Peoples R China Southwest Univ Chongqing Key Lab Nonlinear Circuits & Intelligen Coll Elect & Informat Engn Chongqing 400715 Peoples R China Guangdong Univ Technol Guangdong Prov Key Lab Intelligent Decis & Cooper Guangzhou 510006 Peoples R China

This brief considers the adaptive tracking problem for a class of uncertain nonlinear systems. First, the disturbance observer (DO) is established, and the neural network (NN) technique is adopted to deal with unmeasured disturbances and system dynamic uncertainties. Then, the switching threshold event-triggered mechanism is utilized, and the adaptive tracking controller is further designed based on backstepping techniques. We show that the tracking errors simultaneously converge to an adjustable compact set of origin, and all the closed-loop signals are semi-globally uniformly bounded. Finally, the practicability and effectiveness of the proposed control approach are well illustrated by a simulation case.

关键词： Control systems Switches Artificial neural networks Uncertainty nonlinear dynamical systems Adaptive control Upper bound Uncertain nonlinear system disturbance observer event-triggered control adaptive control

来源：评论

学校读者我要写书评

暂无评论

Outage Analysis of Wireless-Powered Relaying MIMO Systems with Non-Linear Energy Harvesters and Imperfect CSI

引用

IEEE ACCESS 2016年 4卷 7046-7053页

作者： Zhang, Jiliang Pan, Gaofeng Southwest Univ Sch Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China

In this paper, we investigate a wireless-powered dual-hop relaying multiple-input multiple-output system, which consists of a multi-antenna source (S) node, a multi-antenna destination (D) node, and N(N > 1) single-antenna wireless-powered relaying nodes. At each relay, a power splitting receiver is applied to process the received signal for information decoding and energy harvesting simultaneously, and a decode-and-forward scheme is adopted to forward the processed information. Furthermore, the energy harvester at each relay is assumed to be non-linear with a saturation threshold to limit the power level of the energy. Assuming imperfect channel state information is available both at S and D, outage performance is investigated when S adopts transmit antenna selection in the presence of feedback delay and D performs maximal ratio combining technique to deal with the multiple copies of signals with channel estimation errors. Taking into account a Kth best relay selection criterion, which results in the Kth best performance in terms of outage probability for the source-relay-destination link, an analytical expression for OP is derived. Monte Carlo simulation results are presented to verify the accuracy of the derived analytical model.

关键词： Channel state information energy harvesting multiple-input multiple-output non-linear outage probability wireless-powered relaying

来源：评论

学校读者我要写书评

暂无评论

Cluster synchronization of delayed coupled neural networks: Delay-dependent distributed impulsive control

引用

NEURAL NETWORKS 2021年 142卷 34-43页

作者： Zhang, Xiaoyu Li, Chuandong He, Zhilong Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China

This paper investigates the issue of cluster synchronization (CS) for the coupled neural networks (CNNs) with time-varying delays via the delay-dependent distributed impulsive control. A new Halanay-like inequality, where delayed impulses are taken into consideration, is proposed. Based on the Lyapunov theory and the new differential inequality, sufficient conditions of CS for delayed CNNs with fixed and switching coupling topology are obtained, respectively. Moreover, delay-dependent distributed impulsive controllers with fixed or switching topology are designed thereby. Finally, we present a numerical example of CNNs with fixed or switching coupling to verify the effectiveness of our results, respectively. (C) 2021 Published by Elsevier Ltd.

关键词： Cluster synchronization Time-varying delay Distributed impulsive control Delayed impulsive control

来源：评论

学校读者我要写书评

暂无评论

Collective Neurodynamic Optimization for Image Segmentation by Binary Model with Constraints

引用

COGNITIVE COMPUTATION 2020年第6期12卷 1265-1275页

作者： He, Shengzhan Huang, Junjian He, Xing Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China

Threshold method is an important image segmentation method, which has been widely used in image segmentation. For this method, it is very important to choose a good threshold. The traditional threshold segmentation algorithm is implemented by exhaustive method, which makes the solution efficiency very low. This paper presents a collective neurodynamic optimization algorithm to solve the problem of binary optimization in the image segmentation. The problem of image segmentation based on threshold is transformed into binary optimization with constraints. Then, a collective neurodynamic optimization algorithm is introduced which combined with feedback neural network and particle swarm optimization (PSO) algorithm. And the linear programming relaxation constraint method is used to relax binary constraints. It is proved by numerical simulation that the feedback neural network algorithm can converge to the exact local optimal solution of the model and the PSO algorithm can get a better local optimal solution. Finally, several sets of comparative experiments are presented. The feasibility of our proposed method is verified;the experimental results demonstrate the effectiveness of our approach in image segmentation. In this study, a collective neurodynamic optimization was proposed for the image segmentation problem. In the future, we expect that multiple centralized neurodynamic models and intelligent algorithms can be used to solve the problem and improve the convergence speed of the solved model.

关键词： Image segmentation Collective neurodynamic optimization Binary optimization Feedback neural network Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

Forgetting memristors and memristor bridge synapses with long- and short-term memories

引用

NEUROCOMPUTING 2021年 456卷 126-135页

作者： Chen, Ling Zhou, Wenhao Li, Chuandong Huang, Junjian Southwest Univ Coll Elect Informat & Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China

In this paper, an ideal current source forgetting memristor model is proposed. Based on the model, three kinds of synapses with long-and short-term memory are designed: the series forgetting memristor synapse, the forgetting memristor bridge synapse written independently and the forgetting memristor bridge synapse written in batches. Combined with the forgetting property, the long-and short-term weight of the forgetting synapse can be controlled by the long-and short-term resistance of memristors. Compared the three forgetting synapses, the series forgetting memristor synapse has the lowest requirement for memristors, the forgetting memristor bridge synapse written independently is the most flexible, and the forgetting memristor bridge synapse written in batches is the most convenient. Compared with traditional synapses, forgetting synapses with long-and short-term memory have multi-weight storage. When forgetting synapses are applied to associative memory, it can be found more patterns are stored in the neural network and different patterns are recalled at different time due to the forgetting effect. (c) 2021 Elsevier B.V. All rights reserved.

关键词： Forgetting memristor Long short-term memory Synapse Memristor bridge

来源：评论

学校读者我要写书评

暂无评论

Widely Linear Maximum Complex Correntropy Criterion Affine Projection Algorithm and Its Performance Analysis

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2022年 70卷 3540-3550页

作者： Qiu, Chen Qian, Guobing Wang, Shiyuan Southwest Univ Coll Elect & Informat Engn Chongqing Key Lab Nonlinear Circuits & Intelligen Chongqing 400715 Peoples R China

Recently, affine projection algorithm has been extensively studied in the Gaussian noise environment. However, the performance of affine projection algorithm will deteriorate rapidly in the presence of impulsive noise and other non-Gaussian noise. To address this issue, this paper proposes a novel affine projection algorithm based on the complex Gaussian kernel function, called widely linear maximum complex correntropy criterion affine projection algorithm (WL-MCCC-APA). With the maximum complex correntropy criterion (MCCC), the robustness of affine projection algorithm is improved significantly in the non-Gaussian noise environment, especially in the presence of impulsive noise. Meanwhile, a variable step size WL-MCCC-APA (VSS-WL-MCCC-APA) method based on fixed-point theory is proposed to further balance the convergence rate and steady-state misalignment of the algorithm. Finally, the step size boundary analysis and steady-state analysis are presented for theoretical analysis. Simulation results verify the correctness of obtained theoretical results and the superiority of the proposed WL-MCCC-APA and VSS-WL -MCCC-APA.

关键词： Signal processing algorithms Projection algorithms Optimized production technology Kernel Filtering algorithms Cost function Convergence Widely linear affine projection maximum complex correntropy criterion variable step size

来源：评论

学校读者我要写书评

暂无评论

A new color image encryption scheme based on logistic map over the finite field Z_N

引用

MULTIMEDIA TOOLS AND APPLICATIONS 2018年第16期77卷 21803-21821页

作者： Yang, Bo Liao, Xiaofeng Southwest Univ Chongqing Key Lab Nonlinear Circuits & Intelligen Coll Elect & Informat Engn Chongqing 400715 Peoples R China

In recent years, various image encryption algorithms based on chaotic systems have been proposed where the chaotic maps always work over the real domain. However, the traditional chaotic map over the real domain has a disadvantage, i.e., the calculation complexity of the floating point number can be doubled when implementing the map in computer. This leads to a greatly serious drawback for practical application. To overcome this problem effectively, in this paper, we generalize the chaotic Logistic map to the finite field, and find that there exists an automorphic mapping between two Logistic maps with the different control parameters over the finite field Z(N). Moreover, we adopt the sequences generated by the automorphic mapping to design a color image encryption scheme and do simulation experiments. Security and performance analyzes also show that the proposed scheme has very good properties which provide a strong guarantee for the algorithm efficiency. Therefore, the proposed scheme is feasible for implementing image and data encryption.

关键词： Encryption scheme Chaotic systems Logistic map information security Finite field

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：