Feature subset selection is an important approach to deal with high-dimensional data. But selecting the best subset of data is NP hard. So most of feature selection methods cannot handle high-dimensional data efficien...
详细信息
Feature subset selection is an important approach to deal with high-dimensional data. But selecting the best subset of data is NP hard. So most of feature selection methods cannot handle high-dimensional data efficiently, or they can only obtain local optimum instead of global optimum. In these cases, when the data consist of both labeled and unlabeled data, semi-supervised feature selection can make full use of data information. In this paper, we introduce a novel semi-supervised feature selection algorithm, which is a filter method based on Fisher-Markov selector, thus ours can achieve global optimum and computational efficiency under certain kernels.
Consensus in multi-agent systems means that reach an agreement among states of the whole ***,almost all the existed works on consensus have been in the description of the states of nodes,and fewer efforts have been de...
详细信息
ISBN:
(纸本)9781479947249
Consensus in multi-agent systems means that reach an agreement among states of the whole ***,almost all the existed works on consensus have been in the description of the states of nodes,and fewer efforts have been devoted to the consensus taking place on the edges of multi-agent *** this paper,we focus on the dynamics proceed on the edges and establish a discrete-time and a continuous-time edge consensus protocols respectively for directed multi-agent *** mapping the edge topology to its line graph of the original nodal topology,we analyze the consensus of the edge protocols rigorously,and get that both the discrete-time protocol and the continuous-time protocol of directed multi-agent systems can guarantee that an edge consensus is asymptotically reached for all initial states when the original directed system is strongly *** simulations are provided to show the effectiveness of both the discrete-time and the continuous-time models.
In this paper, we study the existence, uniqueness and stability of periodic solution for a wide class of memristor-based neural networks with time-varying delays. By employing the topological degree theory in set-valu...
In this paper, we study the existence, uniqueness and stability of periodic solution for a wide class of memristor-based neural networks with time-varying delays. By employing the topological degree theory in set-valued analysis, differential inclusions theory and a new Lyapunov function method, we prove that the neural network has a unique periodic solution, which is globally exponentially stable. Moreover, we prove the existence, uniqueness and global exponential stability of equilibrium point for time-varying delayed memristor-based neural networks with constant coefficients. The obtained results improve and extend previous works on memristor-based or usual neural network dynamical systems with continuous or discontinuous right-hand side. Finally, two numerical examples are provided to show the applicability and effectiveness of our main results.
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.
作者:
Li, JiaojieZhang, WeiSu, HoushengYang, YupuDepartment of Automation
Shanghai Jiao Tong University and Key Laboratory of System Control and Information Processing Ministry of Education of China Shanghai China Department of Measurement and Control Technology
Shanghai Dian Ji University Shanghai China School of Automation
Key Laboratory of Image Information Processing and Intelligent Control (Huazhong University of Science and Technology) Ministry of Education National Key Laboratory of Science and Technology on Multispectral Information Processing Huazhong University of Science and Technology Wuhan China
In this paper, we study the flocking problem of multi-agent systems with obstacle avoidance, in the situation when only a fraction of the agents have information on the obstacles. Obstacles of arbitrary shape are allo...
In this paper, we study the flocking problem of multi-agent systems with obstacle avoidance, in the situation when only a fraction of the agents have information on the obstacles. Obstacles of arbitrary shape are allowed, no matter if their boundary is smooth or non-smooth, and no matter it they are convex or non-convex. A novel geometry representation rule is proposed to transfer obstacles to a dense obstacle-agents lattice structure. Non-convex regions of the obstacles are detected and supplemented using a geometric rule. The uninformed agents can detect a section of the obstacles boundary using only a range position sensor. We prove that with the proposed protocol, uninformed agents which maintain a joint path with any informed agent can avoid obstacles that move uniformly and assemble around a point along with the informed agents. Eventually all the assembled agents reach consensus on their velocity. In the entire flocking process, no distinct pair of agents collide with each other, nor collide with obstacles. The assembled agents are guaranteed not to be lost in any non-convex region of the obstacles within a distance constraint. Numerical simulations demonstrate the flocking algorithm with obstacle avoidance both in 2D and 3D space. The situation when every agent is informed is considered as a special case.
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.
An approach of direct adaptive fuzzy sliding-mode control which combines the fuzzy control with the sliding-mode control, is proposed for the control of a class of unknown nonlinear dynamic systems. The control goal i...
详细信息
ISBN:
(纸本)9781479987313
An approach of direct adaptive fuzzy sliding-mode control which combines the fuzzy control with the sliding-mode control, is proposed for the control of a class of unknown nonlinear dynamic systems. The control goal is to obtain a direct adaptive fuzzy sliding-mode control law and a constructive Lyapunov synthesis approach with respect to a class of nonlinear systems without the knowledge of uncertainties. For improving the approximate performance of the fuzzy system, the proposed approach in this study not only online updates the parameter values in the consequence fuzzy sets, but also updates the shape parameters of the membership functions of the prime fuzzy sets. The fuzzy control rules are updated through the online adaptive learning, which makes the output of fuzzy control to approximate to a sliding-mode equivalent control. The asymptotic stability of the overall system based on Lyapunov theory is proved. Some numerical simulation results show the efficiency of the proposed approach.
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.
作者:
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]
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.
暂无评论