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.
According to the distribution characteristics of the Pareto set (PS) of multi-objective optimization problems (MOPs), a cooperative coevolutionary model with new problem decomposition method was designed. By introduci...
详细信息
According to the distribution characteristics of the Pareto set (PS) of multi-objective optimization problems (MOPs), a cooperative coevolutionary model with new problem decomposition method was designed. By introducing the proposed coevolutionary model into artificial immune system, a cooperative immune coevolutionary algorithm for multi-objective optimization (CICAMO) was proposed. In CICAMO, the Tchebycheff decomposition method is employed to divide sub-populations at first, and then linear probabilistic models are built for each sub-population to piecewise approximate the distribution of the whole PS. In antibody reproducing step, two types of approaches based on clonal selection and model sampling are employed. Experimental results indicate that CICAMO can achieve a good performance in terms of both solution quality and convergence rate, especially when solving MOPs with non-linear relationship between decision variables.
作者:
Jiao ShiJiaji WuXidian University
Key Laboratory of Intelligent Perception and Image Understanding of Ministry of Education Institute of Intelligent Information Processing Xi''an Shaanxi 710071China
The aurora is a natural light phenomenon in the sky, particularly in high-latitude *** is caused by the collision of energetic charged particles from the earth's magnetosphere and solar *** aurora is not only ...
The aurora is a natural light phenomenon in the sky, particularly in high-latitude *** is caused by the collision of energetic charged particles from the earth's magnetosphere and solar *** aurora is not only an optical *** also emits radio waves and has a strong influence on radio communications, on the weather, and on complex biological *** study of auroral activity attracts great interest form geophysicists due to its utility in analyzing high-latitude ionosphere-thermosphere-magnetosphere behaviors.A major source of images available for studying auroral activity consists of data collected by the Polar Ultraviolet imager (UVI).
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.
In this paper, the formation tracking problem for the second-order multi-agent system with and without input delay are investigated, respectively. The objective is to design the formation tracking algorithm such that ...
详细信息
In this paper, the formation tracking problem for the second-order multi-agent system with and without input delay are investigated, respectively. The objective is to design the formation tracking algorithm such that a certain follower follows the trajectory of the leader while also maintains a certain desired geometric formation with other agents simultaneously. The impulsive algorithms are designed by using only the relative position information of the neighbors for both the cases with and without the input delay. By using properties of the Laplacian matrix and combining the stability theory of impulsive systems, necessary and sufficient conditions are derived to achieve the formation tracking of the second-order multi-agent system with and without the input delay, respectively. The numerical examples are given to illustrate the effectiveness of our theoretical results.
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.
Blood vessel segmentation is an important problem for quantitative structure analysis of retinal images, and many diseases are related to the structure changes. Manual segmentation is time consuming and computer aided...
详细信息
Blood vessel segmentation is an important problem for quantitative structure analysis of retinal images, and many diseases are related to the structure changes. Manual segmentation is time consuming and computer aided segmentation is required to deal with large amount images. This paper presents a new supervised method for segmentation of blood vessels in retinal photographs. Multiple kernel learning (MKL) is introduced to deal with the problem, utilizing features from Hessian matrix based vesselness measure, response of multiscale Gabor filter, and multiple scale line strength features. The method is evaluated on the publicly available DRIVE and STARE databases. The performance of the MKL method is evaluated and experimental results show the high accuracy of the proposed method.
作者:
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 is considered with the H ∞ observer design problem for a class of nonlinear systems with the one-sided Lipschitz condition. The systems under consideration include the well-studied Lipschitz system as a sp...
详细信息
This paper is considered with the H ∞ observer design problem for a class of nonlinear systems with the one-sided Lipschitz condition. The systems under consideration include the well-studied Lipschitz system as a special case and possess inherent advantages with respect to conservativeness. For such systems in the presence of noises, we develop a Linear Matrix Inequality (LMI) based approach to design a nonlinear H ∞ observer by carefully dealing with the one-sided Lipschitz condition together with the quadratic inner-bounded condition. The resulting nonlinear H ∞ observer guarantees asymptotic stability of the estimation error dynamics with a prescribed H ∞ performance. Moreover, for the design purpose, the existence condition of the proposed nonlinear H ∞ observer is formulated in terms of LMIs by using a matrix generalized inverse technique. Finally, a simulation example is given to illustrate the effectiveness of the proposed design.
In this paper, we investigate exponential stability of delayed recurrent neural networks. By using the delay partitioning method, some sufficient conditions are established to guarantee exponential stability of delaye...
详细信息
In this paper, we investigate exponential stability of delayed recurrent neural networks. By using the delay partitioning method, some sufficient conditions are established to guarantee exponential stability of delayed recurrent neural networks under two different conditions with constructing new Lyapunov–Krasvoskii functional. This partitioning approach can reduce the conservatism comparing with some previous results of stability. At last, numerical examples are given out to show the effectiveness and advantage of our results.
暂无评论