This paper addresses a quantized consensus problem of general linear multi-agent systems in a symmetric network under an event-triggered scheme. Firstly, a distributed event-triggered strategy is developed with a dyna...
详细信息
This paper addresses a quantized consensus problem of general linear multi-agent systems in a symmetric network under an event-triggered scheme. Firstly, a distributed event-triggered strategy is developed with a dynamic threshold to reduce the unnecessary control update. Then, based on absolute quantized state measurements, a distributed controller is proposed and then a consensus criterion is derived, which ensures bounded consensus of linear multi-agent systems. The Zeno behavior is also successfully excluded. Finally, a numerical simulation is presented to validate theoretical results.
This paper considers the state feedback stabilization over finite-state fading channels, where the stochastic characteristic of time-varying fading channels is assumed to be driven by a finite-state random process. Th...
详细信息
ISBN:
(纸本)9781479937097
This paper considers the state feedback stabilization over finite-state fading channels, where the stochastic characteristic of time-varying fading channels is assumed to be driven by a finite-state random process. The finite-state process is used to represent different channel fading amplitudes and/or to model different configurations of the overall physical environment. Necessary and sufficient conditions are given for stabilization over finite-state Markov fading *** the case of finite-state i.i.d. fading channels, explicit network requirements for stabilization are presented for both single-input case and multi-input case. Our results cover some existing results as special cases.
This paper investigates synchronization between two delayed chaotic systems with parameter mismatches. Based on Lyapunov functional approach and generalized Halanay inequality, some delay-dependent criteria are derive...
详细信息
In a resource limited multi-agent system, it is of practical importance to select a fraction of nodes (agents) to provide control inputs such that consensus can be achieved with optimized performance in terms of netwo...
详细信息
In a resource limited multi-agent system, it is of practical importance to select a fraction of nodes (agents) to provide control inputs such that consensus can be achieved with optimized performance in terms of network cost and/or convergence speed. In this paper, we investigate the problem of how to select control nodes so as to minimize the network cost, where the control nodes are selected at the beginning and will be fixed all the time. This problem can be transformed to a combinatorial optimization problem, and further relaxed to a convex optimization problem with reweighted l 1 norm. We propose a suboptimal algorithm to solve the convex optimization problem. Finally, we offer several numerical examples to illustrate the efficiency of the proposed strategies, and investigate the relationship how the degrees of control nodes will influence network cost and convergence speed.
Since the activity and selectivity of acetylene hydrogenation catalyst change with time, the operating parameters need to be changed to maximize the profit. Therefore, we collected the industrial process data and esti...
详细信息
The homogeneous metal/bromide-catalyzed aerobic oxidation of p-xylene with different catalyst concentrations was carried out, and the formation kinetics of COx including CO2 and CO was measured. The simplified element...
详细信息
This paper presents that the majorization theory plays an essential role in a class of sensor scheduling problems, whose solutions all have periodic or uniformly distributed patterns. This paper revisits the problem o...
详细信息
ISBN:
(纸本)9781479978878
This paper presents that the majorization theory plays an essential role in a class of sensor scheduling problems, whose solutions all have periodic or uniformly distributed patterns. This paper revisits the problem of communication time scheduling for a single sensor with local computation capability, and strengthens its original result by the majorization theory. The scheduling for a single normal sensor in a general-order system is also studied, and the optimal schedules for minimizing the upper bound of the objective function is provided. Examples are provided at the end.
Independent component analysis (ICA) and fuzzy c-means (FCM) clustering were adopted for automatic ocular artifact suppression from operator's electroencephalogram. Firstly, ICA was applied to the 20s data contain...
详细信息
This paper presents an improved particle swarm optimization (PSO) algorithm based on the chaos of Zaslavskii to solve the path planning problem of Uninhabited Combat Air Vehicle (UCAV) in the threat battlefield. The p...
详细信息
ISBN:
(数字)9781728176871
ISBN:
(纸本)9781728176888
This paper presents an improved particle swarm optimization (PSO) algorithm based on the chaos of Zaslavskii to solve the path planning problem of Uninhabited Combat Air Vehicle (UCAV) in the threat battlefield. The proposed method uses the characteristics of traditional particle swarm optimization algorithm, such as fast convergence speed, ergodicity, randomness of chaotic motion and sensitivity to initial value. The chaos mapping formula of Zaslavskii is used to generate chaotic sequence and improves the inertia weight and random variables of PSO algorithm. The improved PSO algorithm is applied to bear on the problem of path planning of UCAV. It gradually escapes from the local optimal path and find the global optimal path in the complex and changeable battlefield environment. The simulation results show that the improved PSO algorithm can effectively accelerate the convergence speed and improve the optimal trajectory.
The P300 potential is a positive peak of an event-related potential(ERP) that happens at 300 ms after a *** this study,both offline and online stages were carried out in the *** motivation of this paper is to compare ...
详细信息
The P300 potential is a positive peak of an event-related potential(ERP) that happens at 300 ms after a *** this study,both offline and online stages were carried out in the *** motivation of this paper is to compare two different P300 brain-computer interfaces(BCIs) which were evoked by random stimulus and non-random stimulus *** offline data demonstrated that the random stimulus induced a higher P300 amplitude and classification accuracy than the non-random *** offline data were used to train the Bayesian linear discriminate analysis(BLDA),which was used in offline experiment. The online results further proved that random stimulus P300 BCI yields better performance than non-random stimulus P300 BCI.
暂无评论