This paper is concerned with the distributed resilient fusion filtering(DRFF)problem for a class of time-varying multi-sensor nonlinear stochastic systems(MNSSs)with random sensor delays(RSDs).The phenomenon of the RS...
详细信息
This paper is concerned with the distributed resilient fusion filtering(DRFF)problem for a class of time-varying multi-sensor nonlinear stochastic systems(MNSSs)with random sensor delays(RSDs).The phenomenon of the RSDs is modeled by a set of random variables with certain statistical *** addition,the nonlinear function is handled via Taylor expansion in order to deal with the nonlinear fusion filtering *** aim of the addressed issue is to propose a DRFF scheme for MNSSs such that,for both RSDs and estimator gain perturbations,certain upper bounds of estimation error covariance(EEC)are given and locally minimized at every sample *** the light of the obtained local filters,a new DRFF algorithm is developed via the matrix-weighted fusion ***,a sufficient condition is presented,which can guarantee that the local upper bound of the EEC is ***,a numerical example is provided,which can show the usefulness of the developed DRFF approach.
In this work, we propose a new scheme to estimate the algebraic connectivity of the graph describing the network topology of a multi-agent system. We consider network topologies modeled by undirected graphs. The main ...
详细信息
Recently, generative adversarial networks(GANs)have become a research focus of artificial intelligence. Inspired by two-player zero-sum game, GANs comprise a generator and a discriminator, both trained under the adver...
详细信息
Recently, generative adversarial networks(GANs)have become a research focus of artificial intelligence. Inspired by two-player zero-sum game, GANs comprise a generator and a discriminator, both trained under the adversarial learning *** goal of GANs is to estimate the potential distribution of real data samples and generate new samples from that *** their initiation, GANs have been widely studied due to their enormous prospect for applications, including image and vision computing, speech and language processing, etc. In this review paper, we summarize the state of the art of GANs and look into the future. Firstly, we survey GANs' proposal background,theoretic and implementation models, and application ***, we discuss GANs' advantages and disadvantages, and their development trends. In particular, we investigate the relation between GANs and parallel intelligence,with the conclusion that GANs have a great potential in parallel systems research in terms of virtual-real interaction and integration. Clearly, GANs can provide substantial algorithmic support for parallel intelligence.
A fault-tolerant control (FTC) scheme is proposed based on integral sliding mode(ISM) for attitude control of hypersonic re-entry vehicle (HRV) under partial loss of actuator effectiveness. First, the inner/outer loop...
详细信息
At present, the studies on multi-team antagonistic games (MTAGs) are still in the early stage, because this complicated problem involves not only incompleteness of information and conflict of interests, but also selec...
详细信息
To diagnose the specific reasons that lead to deterioration of controller performance and improve the diagnostic accuracy,a performance diagnosis method based on eigenvector subspace K-mean clustering is ***,the numbe...
详细信息
ISBN:
(纸本)9781538629185
To diagnose the specific reasons that lead to deterioration of controller performance and improve the diagnostic accuracy,a performance diagnosis method based on eigenvector subspace K-mean clustering is ***,the number of standard deterioration performance subspace with different degrees of deterioration information is increased on the basis of the eigenvector subspace distance diagnosis method,in which multiple distance values between eigenvector subspaces are ***,K-mean clustering is used to divide these distance values into two classes,and the clustering center with a maximum number of points is selected as the representative ***,current performance degradation factor is attributed to the category that represented by the nearest standard performance *** simulation,a double-tank model is established,and simulation result shows that average accuracy of controller performance diagnosis reaches 99.4%approximately.
This paper presents a hybrid diagnosis and tuning method of coaxial cavity filter based on experience and *** method is based on the experience of skilled staff at the initial stage of tuning,and put the bandpass and ...
详细信息
ISBN:
(纸本)9781538629185
This paper presents a hybrid diagnosis and tuning method of coaxial cavity filter based on experience and *** method is based on the experience of skilled staff at the initial stage of tuning,and put the bandpass and echo curve of the filter to the frequency *** the second stages of the tuning,the phase shift is removed,which is caused by the transmission line and the higher order mode at first,then the loss factor of the filter is ***,we use the improved Cauchy method and filter synthesis knowledge to realize the coupling matrix ***,the implicit space mapping algorithm is used to establish the mapping relationship between the coupling matrix variation and the screw variation,in order to guide the tuning amplitude and direction by the coupling *** show that this method has better effects on saving tuning time and reducing tuning difficulties,and it has certain popularization value for the batch production of the filter.
Adaptive Dynamic Programming(ADP) with critic-actor architecture is a useful way to achieve online learning *** algorithm Gaussian-Kernel Adaptive Dynamic Programming(GK-ADP) that has been developed before has a k...
详细信息
ISBN:
(纸本)9781538629185
Adaptive Dynamic Programming(ADP) with critic-actor architecture is a useful way to achieve online learning *** algorithm Gaussian-Kernel Adaptive Dynamic Programming(GK-ADP) that has been developed before has a kind of two-phase iteration,which not only approximates value function,but also optimizes hyper-parameters ***,just like most iteration algorithms are applied in practice,the scale of sample set will increase as the complexity of the system increases,and it will induce a high computation *** order to speed up computation,a practical acceleration method using parallel computation for GK-ADP is presented in this *** realize parallel computation,a high efficient configuration based on CUDA is designed,in which a group of GPUs work in parallel to compute the most complex part of *** comparison test illustrates that the computation burden which hinders GK-ADP’s application is reduced to a large extent when the parallel computing is introduced.
In this paper,a stochastic linear quadratic optimal tracking scheme is proposed for unknown linear discrete-time(DT)systems based on adaptive dynamic programming(ADP)***,an augmented system composed of the original sy...
详细信息
In this paper,a stochastic linear quadratic optimal tracking scheme is proposed for unknown linear discrete-time(DT)systems based on adaptive dynamic programming(ADP)***,an augmented system composed of the original system and the command generator is constructed and then an augmented stochastic algebraic equation is derived based on the augmented ***,to obtain the optimal control strategy,the stochastic case is converted into the deterministic one by system transformation,and then an ADP algorithm is proposed with convergence *** the purpose of realizing the ADP algorithm,three back propagation neural networks including model network,critic network and action network are devised to guarantee unknown system model,optimal value function and optimal control strategy,***,the obtained optimal control strategy is applied to the original stochastic system,and two simulations are provided to demonstrate the effectiveness of the proposed algorithm.
In order to improve the efficiency of tea picking,a scheme combining ant colony algorithm and tea picking technology is proposed to plan the picking *** this scheme,k-means clustering algorithm is used to divide the t...
详细信息
ISBN:
(数字)9789887581536
ISBN:
(纸本)9781665482561
In order to improve the efficiency of tea picking,a scheme combining ant colony algorithm and tea picking technology is proposed to plan the picking *** this scheme,k-means clustering algorithm is used to divide the tea picking regions with irregular *** ant colony algorithm is used to carry out path planning for tea in different picking areas,and the best picking effect is selected according to the simulation *** solve the problem of long searching time of ant colony algorithm,the condition of iteration termination is changed to adaptive value,and the optimal route after the last iteration is recorded as the initial value of the next *** simulation results show that the best effect is to divide two picking *** improved ant colony algorithm reduces the operation time and the planned picking path is shorter,which can enhance the real-time tea picking and improve the efficiency of tea picking.
暂无评论