Finite-time synchronization of Markovian neural networks with proportional delays and discontinuous activations

In this paper, finite-time synchronization of neural networks (NNs) with discontinuous activation functions (DAFs), Markovian switching, and proportional delays is studied in the framework of Filippov solution. Since proportional delay is unbounded and different from infinite-time distributed delay and classical finite-time analytical techniques are not applicable anymore, new 1-norm analytical techniques are developed. Controllers with and without the sign function are designed to overcome the effects of the uncertainties induced by Filippov solutions and further synchronize the considered NNs in a finite time. By designing new Lyapunov functionals and using M-matrix method, sufficient conditions are derived to guarantee that the considered NNs realize synchronization in a settling time without introducing any free parameters. It is shown that, though the proportional delay can be unbounded, complete synchronization can still be realized, and the settling time can be explicitly estimated. Moreover, it is discovered that controllers with sign function can reduce the control gains, while controllers without the sign function can overcome chattering phenomenon. Finally, numerical simulations are given to show the effectiveness of theoretical results

On the validity of memristor modeling in the neural network literature

An analysis of the literature shows that there are two types of non-memristive models that have been widely used in the modeling of so-called "memristive" neural networks. Here, we demonstrate that such models have nothing in common with the concept of memristive elements: they describe either non-linear resistors or certain bi-state systems, which all are devices without memory. Therefore, the results presented in a significant number of publications are at least questionable, if not completely irrelevant to the actual field of memristive neural networks

Positive almost periodicity on SICNNs incorporating mixed delays and D operator

This article involves a kind of shunting inhibitory cellular neural networks incorporating D operator and mixed delays. First of all, we demonstrate that, under appropriate external input conditions, some positive solutions of the addressed system exist globally. Secondly, with the help of the differential inequality techniques and exploiting Lyapunov functional approach, some criteria are established to evidence the globally exponential stability on the positive almost periodic solutions. Eventually, a numerical case is provided to test and verify the correctness and reliability of the proposed findings

Nonlinear dynamics of full-range CNNs with time-varying delays and variable coefficients

In the article, the dynamical behaviours of the full-range cellular neural networks (FRCNNs) with variable coefficients and time-varying delays are considered. Firstly, the improved model of the FRCNNs is proposed, and the existence and uniqueness of the solution are studied by means of differential inclusions and set-valued analysis. Secondly, by using the Hardy inequality, the matrix analysis, and the Lyapunov functional method, we get some criteria for achieving the globally exponential stability (GES). Finally, some examples are provided to verify the correctness of the theoretical results

Finite-time stabilization for fractional-order inertial neural networks with time varying delays

This paper deals with the finite-time stabilization of fractional-order inertial neural network with varying time-delays (FOINNs). Firstly, by correctly selected variable substitution, the system is transformed into a first-order fractional differential equation. Secondly, by building Lyapunov functionalities and using analytical techniques, as well as new control algorithms (which include the delay-dependent and delay-free controller), novel and effective criteria are established to attain the finite-time stabilization of the addressed system. Finally, two examples are used to illustrate the effectiveness and feasibility of the obtained results

Measurements, Models, Systems and Design

531 s.

Robust Multimode Function Synchronization of Memristive Neural Networks with Parameter Perturbations and Time-Varying Delays

Publisher Copyright: IEEE Copyright: Copyright 2020 Elsevier B.V., All rights reserved.Currently, some works on studying complete synchronization of dynamical systems are usually restricted to its two special cases: 1) power-rate synchronization and 2) exponential synchronization. Therefore, how to give a generalization of these types of complete synchronization by the mathematical expression is an open question that needs to be urgently solved. To begin with, this article proposes multimode function synchronization by the mathematical expression for the first time, which is a generalization of exponential synchronization, power-rate synchronization, logarithmical synchronization, and so on. Moreover, two adaptive controllers are designed to achieve robust multimode function synchronization of memristive neural networks (MNNs) with mismatched parameters and uncertain parameters. Each adaptive controller includes function r(t) and update gain σ. By choosing different types of r(t), multiple types of complete synchronization, including power-rate synchronization and exponential synchronization can be obtained. And update gain σ can be used to adjust the speed of synchronization. Therefore, our results enlarge and strengthen the existing results. Two examples are put forward to verify the validity of our results.Peer reviewedFinal Accepted Versio

Global exponential synchronization of quaternion-valued memristive neural networks with time delays

This paper extends the memristive neural networks (MNNs) to quaternion field, a new class of neural networks named quaternion-valued memristive neural networks (QVMNNs) is then established, and the problem of drive-response global synchronization of this type of networks is investigated in this paper. Two cases are taken into consideration: one is with the conventional differential inclusion assumption, the other without. Criteria for the global synchronization of these two cases are achieved respectively by appropriately choosing the Lyapunov functional and applying some inequality techniques. Finally, corresponding simulation examples are presented to demonstrate the correctness of the proposed results derived in this paper

Adaptive and learning-based formation control of swarm robots

Autonomous aerial and wheeled mobile robots play a major role in tasks such as search and rescue, transportation, monitoring, and inspection. However, these operations are faced with a few open challenges including robust autonomy, and adaptive coordination based on the environment and operating conditions, particularly in swarm robots with limited communication and perception capabilities. Furthermore, the computational complexity increases exponentially with the number of robots in the swarm. This thesis examines two different aspects of the formation control problem. On the one hand, we investigate how formation could be performed by swarm robots with limited communication and perception (e.g., Crazyflie nano quadrotor). On the other hand, we explore human-swarm interaction (HSI) and different shared-control mechanisms between human and swarm robots (e.g., BristleBot) for artistic creation. In particular, we combine bio-inspired (i.e., flocking, foraging) techniques with learning-based control strategies (using artificial neural networks) for adaptive control of multi- robots. We first review how learning-based control and networked dynamical systems can be used to assign distributed and decentralized policies to individual robots such that the desired formation emerges from their collective behavior. We proceed by presenting a novel flocking control for UAV swarm using deep reinforcement learning. We formulate the flocking formation problem as a partially observable Markov decision process (POMDP), and consider a leader-follower configuration, where consensus among all UAVs is used to train a shared control policy, and each UAV performs actions based on the local information it collects. In addition, to avoid collision among UAVs and guarantee flocking and navigation, a reward function is added with the global flocking maintenance, mutual reward, and a collision penalty. We adapt deep deterministic policy gradient (DDPG) with centralized training and decentralized execution to obtain the flocking control policy using actor-critic networks and a global state space matrix. In the context of swarm robotics in arts, we investigate how the formation paradigm can serve as an interaction modality for artists to aesthetically utilize swarms. In particular, we explore particle swarm optimization (PSO) and random walk to control the communication between a team of robots with swarming behavior for musical creation