This paper is concerned with the exponential synchronization problem of coupled memristive neural networks. In contrast to general neural networks, memristive neural networks exhibit state-dependent switching behavior...
详细信息
This paper is concerned with the exponential synchronization problem of coupled memristive neural networks. In contrast to general neural networks, memristive neural networks exhibit state-dependent switching behaviors due to the physical properties of memristors. Under a mild topology condition, it is proved that a small fraction of controlled sub- systems can efficiently synchronize the coupled systems. The pinned subsystems are identified via a search algorithm. Moreover, the information exchange network needs not to be undirected or strongly connected. Finally, two numerical simulations are performed to verify the usefulness and effectiveness of our results.
The discrete-time double-integrator consensus and rendezvous problems are both addressed for distributed multiagent systems with directed switching topologies and input *** develop model predictive control algorithms ...
详细信息
ISBN:
(纸本)9781479947249
The discrete-time double-integrator consensus and rendezvous problems are both addressed for distributed multiagent systems with directed switching topologies and input *** develop model predictive control algorithms to achieve stable consensus or rendezvous provided that the proximity nets always have a directed spanning tree and the sampling period is sufficiently ***,the control horizon is extended to larger than one as well,which endows sufficient degrees of freedom to facilitate controller *** simulations are finally conducted to show the effectiveness of the control algorithms.
Spiking neural (SN) P systems are a class of distributed parallel computing devices inspired by the way neurons communicate by means of spikes. In this work, we investigate reversibility in SN P systems, as well as ...
详细信息
Spiking neural (SN) P systems are a class of distributed parallel computing devices inspired by the way neurons communicate by means of spikes. In this work, we investigate reversibility in SN P systems, as well as the computing power of reversible SN P systems. Reversible SN P systems are proved to have Turing creativity, that is, they can compute any recursively enumerable set of non-negative integers by simulating universal reversible register machine.
In this paper, we study the coordinated obstacle avoidance algorithm of multi-agent systems when only a subset of agents has obstacle dynamic information, or every agent has local interaction. Each agent can get parti...
详细信息
In this paper, we study the coordinated obstacle avoidance algorithm of multi-agent systems when only a subset of agents has obstacle dynamic information, or every agent has local interaction. Each agent can get partial measuring states information from its neighboring agent and obstacle. Coordinated obstacle avoidance here represents not only the agents moving without collision with an obstacle, but also the agents bypassing and assembling at the opposite side of the obstacle collectively, where the opposite side is defined according to the initial relative position of the agents to the obstacle. We focus on the collective obstacle avoidance algorithms for both agents with first-order kinematics and agents with second-order dynamics. In the situation where only a fixed fraction of agents can sense obstacle information for agents with first-order kinematics, we propose a collective obstacle avoidance algorithm without velocity measurements. And then we extend the algorithm to the case in switched topology. We show that all agents can bypass an obstacle and converge together, and then assemble at the opposite side of the obstacle in finite time, if the agents׳ topology graph is connected and at least one agent can sense the obstacle. In the case where obstacle information is available to only a fixed fraction of agents with second-order kinematics, we propose two collective obstacle avoidance algorithms without measuring acceleration when the obstacle has varying velocity and constant velocity. The switched topology is considered and extended next. We show that agents can bypass the obstacle with their positions and velocities approaching consensus in finite time if the connectivity of switched topology is continuously maintained. Several simulation examples demonstrate the proposed algorithms.
This paper investigates the synchronization problem of memristive systems with multiple networked input and output delays via observer-based control. A memristive system is set up, and the fuzzy method has been employ...
This paper investigates the synchronization problem of memristive systems with multiple networked input and output delays via observer-based control. A memristive system is set up, and the fuzzy method has been employed to linearize the dynamical system of the memristive system; the networked input and output delays are considered in the synchronization problem of this system. A truncated predictor feedback approach is employed to design the observers. Under certain restrictions, a class of finite-dimensional observer-based output feedback controllers is designed. A numerical example is carried out to demonstrate the effectiveness of the proposed methods.
This work investigates the conflict-free path planning problems for efficient guidance of multiple mobile robots under the dynamic double-warehouse environment, a challenging problem that appears recurrently in a wide...
This work investigates the conflict-free path planning problems for efficient guidance of multiple mobile robots under the dynamic double-warehouse environment, a challenging problem that appears recurrently in a wide range of applications such as the service robots moving in a multistory building. United with two symmetrical transfer elevators, double-warehouse consists of two parallel warehouses. Within each warehouse, the polynomial based paths are subject to constraints such as motion boundaries, kinematics constraints, obstacle-avoidance, limited resource of elevators and smoothness. We formulate the shortest path planning problems as one time-varying nonlinear programming problem (TNLPP) while restricted to the above constraints, and apply the multi-phase strategy to reduce their difficulty. We present the new variant algorithms of PSO named constriction factor and random perturb PSO (Con-Per-PSO) and the simulating annealing PSO (SA-PSO) to achieve the solution. Numerical simulations verify that, our approach can fulfill multiple mobile robots path planning problems under double-warehouse successfully.
Evolutionary membrane computing is an important research direction of membrane computing that aims to explore the complex interactions between membrane computing and evolutionary computation. These disciplines are rec...
详细信息
This paper proposes two hybrid prediction models using for predicting the displacement of landslide, Genetic Algorithm-Radial Basis Function Neural Network (GA-RBFN) and Genetic Algorithm- Back Propagation Neural Netw...
详细信息
This paper proposes two hybrid prediction models using for predicting the displacement of landslide, Genetic Algorithm-Radial Basis Function Neural Network (GA-RBFN) and Genetic Algorithm- Back Propagation Neural Network (GA-BPNN). A case study of Yuhuangge landslide in the Three Gorges reservoir in China is used to illustrate the capability and merit of our schemes. In addition, the result shows that GP-BPNN get better accuracy than GA-RBFN in the same measurements.
To diagnose breast cancer, an alternative approach to X-ray mammography and B-mode ultrasound is the Breast Ultrasound Computed Tomography (UCT). Concerning breast cancer detection, mammographic techniques have been c...
详细信息
作者:
Liang, HailiSu, HoushengWang, XiaofanChen, Michael Z.Q.[a] Department of Automation
Shanghai Jiao Tong University Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai 200240 China[b] School of Automation Key Laboratory of Ministry of Education for Image Processing and Intelligent Control Huazhong University of Science and Technology Luoyu Road 1037 Wuhan 430074 China[c] Department of Mechanical Engineering The University of Hong Kong Hong Kong
This paper investigates the problem of swarm aggregations of heterogeneous multi-agent systems. Comparing with the existing studies on swarm aggregations of homogeneous multi-agent systems, this paper is much more res...
详细信息
This paper investigates the problem of swarm aggregations of heterogeneous multi-agent systems. Comparing with the existing studies on swarm aggregations of homogeneous multi-agent systems, this paper is much more resembling the practical situations, where the agents have different dynamics. We show that the heterogeneous agents will gather with a certain error under some assumptions and conditions. The stability properties have been proven by theoretical analysis and verified via numerical simulation. The stability of the heterogeneous multi-agent systems has been achieved based on matrix theory and the Lyapunov stability theorem. Numerical simulation is given to demonstrate the effectiveness of the theoretical result. [PUBLICATION ABSTRACT]
暂无评论