New optimal method for L2-L∞ state estimation of delayed neural networks

Partial-Neurons-Based Proportional-Integral Observer Design for Artificial Neural Networks: A Multiple Description Encoding Scheme

This article is concerned with a new partial-neurons-based proportional-integral observer (PIO) design problem for a class of artificial neural networks (ANNs) subject to bounded disturbances. For the purpose of improving the reliability of the data transmission, the multiple description encoding mechanisms are exploited to encode the measurement data into two identically important descriptions, and the encoded data are then transmitted to the decoders via two individual communication channels susceptible to packet dropouts, where Bernoulli-distributed stochastic variables are utilized to characterize the random occurrence of the packet dropouts. An explicit relationship is discovered that quantifies the influences of the packet dropouts on the decoding accuracy, and a sufficient condition is provided to assess the boundedness of the estimation error dynamics. Furthermore, the desired PIO parameters are calculated by solving two optimization problems based on two metrics (i.e., the smallest ultimate bound and the fastest decay rate) characterizing the estimation performance. Finally, the applicability and advantage of the proposed PIO design strategy are verified by means of an illustrative example.

State Estimation for Discrete Time-Delayed Impulsive Neural Networks Under Communication Constraints: A Delay-Range-Dependent Approach

In this article, a delay-range-dependent approach is put forward to tackle the state estimation problem for delayed impulsive neural networks. A new type of nonlinear function, which is more general than the normal sigmoid function and functions constrained by the Lipschitz condition, is adopted as the neuron activation function. To effectively alleviate data collisions and save energy, the round-robin protocol is utilized to mitigate the occurrence of unnecessary network congestion in communication channels from sensors to the estimator. With the aid of the Lyapunov stability theory, a state observer is constructed such that the estimation error dynamics are asymptotically stable. The observer existence is ensured by resorting to a set of delay-range-dependent criteria which is dependent on both the impulsive time instant and a coefficient matrix. In addition, the synthesis of the observer is discussed by using linear matrix inequalities. Simulations are provided to illustrate the reasonability of our delay-range-dependent estimation approach.

H∞ Proportional-Integral State Estimation for T-S Fuzzy Systems Over Randomly Delayed Redundant Channels With Partly Known Probabilities

In this article, we consider the H_∞ proportional-integral (PI) state estimation (SE) problem for discrete-time T-S fuzzy systems subject to transmission delays, external disturbances, and redundant channels. Multiple redundant communication channels are utilized between the sensors and the remote estimator to enhance the reliability of data transmissions. In order to characterize the transmission delays in network-based communication, a family of random variables with partly known probabilities, which are independent and identically distributed, is adopted to describe the random behavior of the transmission delays with the redundant channels. The objective of this work is to put forward a PI state estimator such that the dynamics of the estimation error is exponentially mean-square stable and satisfies the prescribed H_∞ performance index of the disturbance attenuation/rejection. By employing the stochastic analysis approach, the error dynamics of the SE under the proposed state estimator is analyzed and sufficient conditions are obtained to ensure the existence of the required PI state estimator. Furthermore, the desired estimator parameters are derived by solving a nonlinear optimization problem. Finally, two simulation examples are exploited to demonstrate the validity of the proposed SE scheme.

Distributed Quasiconsensus Control for Stochastic Multiagent Systems Under Round-Robin Protocol and Uniform Quantization

In this article, the problem of consensus control is investigated for a class of multiagent systems (MASs) with both stochastic noises and nonidentical exogenous disturbances. The signal transmission among agents is implemented through a digital communication network subject to both uniform quantization and round-robin protocol as a reflection of network constraints. The consensus strategy is designed by adopting the estimates of the relative states of the agent to its neighbors, which renders the distributed nature of the controller. A new consensus concept, namely, quasiconsensus in probability, is employed to evaluate the state response of the agents to the stochastic noises, the exogenous disturbances, and the quantization error. An augmented system is first formed that relies on the deviations of the individual state from the average state, the observer error of the relative state, as well as the relative measurement output. Based on the augmented model, an analysis approach on dynamical behaviors is developed to facilitate the consensus analysis of MASs by means of the switching Lyapunov function technique and the stochastic analysis methods. Then, the existence condition and the explicit expression of the time-varying gain matrices are proposed for the expected controller by resorting to the feasibility of several matrix inequalities. Numerical simulation results are presented to demonstrate the applicability of the theoretical results.

Electric vehicle charging station planning with dynamic prediction of elastic charging demand: a hybrid particle swarm optimization algorithm

This paper is concerned with the electric vehicle (EV) charging station planning problem based on the dynamic charging demand. Considering the dynamic charging behavior of EV users, a dynamic prediction method of EV charging demand is proposed by analyzing EV users’ travel law via the trip chain approach. In addition, a multi-objective charging station planing problem is formulated to achieve three objectives: (1) maximize the captured charging demands; (2) minimize the total cost of electricity and the time consumed for charging; and (3) minimize the load variance of the power grid. To solve such a problem, a novel method is proposed by combining the hybrid particle swarm optimization (HPSO) algorithm with the entropy-based technique for order preference by similarity to ideal solution (ETOPSIS) method. Specifically, the HPSO algorithm is used to obtain the Pareto solutions, and the ETOPSIS method is employed to determine the optimal scheme. Based on the proposed method, the siting and sizing of the EV charging station can be planned in an optimal way. Finally, the effectiveness of the proposed method is verified via the case study based on a test system composed of an IEEE 33-node distribution system and a 33-node traffic network system.

A novel PID-like particle swarm optimizer: on terminal convergence analysis

In this paper, a novel proportion-integral-derivative-like particle swarm optimization (PIDLPSO) algorithm is presented with improved terminal convergence of the particle dynamics. A derivative control term is introduced into the traditional particle swarm optimization (PSO) algorithm so as to alleviate the overshoot problem during the stage of the terminal convergence. The velocity of the particle is updated according to the past momentum, the present positions (including the personal best position and the global best position), and the future trend of the positions, thereby accelerating the terminal convergence and adjusting the search direction to jump out of the area around the local optima. By using a combination of the Routh stability criterion and the final value theorem of the Z-transformation, the convergence conditions are obtained for the developed PIDLPSO algorithm. Finally, the experiment results reveal the superiority of the designed PIDLPSO algorithm over several other state-of-the-art PSO variants in terms of the population diversity, searching ability and convergence rate.

Multi-Agent Reinforcement Learning with Optimal Equivalent Action of Neighborhood

In a multi-agent system, the complex interaction among agents is one of the difficulties in making the optimal decision. This paper proposes a new action value function and a learning mechanism based on the optimal equivalent action of the neighborhood (OEAN) of a multi-agent system, in order to obtain the optimal decision from the agents. In the new Q-value function, the OEAN is used to depict the equivalent interaction between the current agent and the others. To deal with the non-stationary environment when agents act, the OEAN of the current agent is inferred simultaneously by the maximum a posteriori based on the hidden Markov random field model. The convergence property of the proposed methodology proved that the Q-value function can approach the global Nash equilibrium value using the iteration mechanism. The effectiveness of the method is verified by the case study of the top-coal caving. The experiment results show that the OEAN can reduce the complexity of the agents’ interaction description, meanwhile, the top-coal caving performance can be improved significantly.

An improved generative adversarial network with modified loss function for crack detection in electromagnetic nondestructive testing

In this paper, an improved generative adversarial network (GAN) is proposed for the crack detection problem in electromagnetic nondestructive testing (NDT). To enhance the contrast ratio of the generated image, two additional regulation terms are introduced in the loss function of the underlying GAN. By applying an appropriate threshold to the segmentation of the generated image, the real crack areas and the fake crack areas (which are affected by the noises) are accurately distinguished. Experiments are carried out to show the superiority of the improved GAN over the original one on crack detection tasks, where a real-world NDT dataset is exploited that consists of magnetic optical images obtained using the electromagnetic NDT technique.

Empower parameterized generative adversarial networks using a novel particle swarm optimizer: algorithms and applications

In this paper, a novel parameterized generative adversarial network (GAN) is proposed where the parameters are introduced to enhance the performance of image segmentation. The developed algorithm is applied to the image-based crack detection problem on the thermal data obtained through the non-destructive testing process. A new regularization term, which contains three tunable hyperparameters, embedded into the objective function of the GAN in order to improve the contrast ratio of certain areas of the image so as to benefit the crack detection process. To automate the selection of the optimal hyperparameters of the GAN, a new particle swarm optimization (PSO) algorithm is put forward where a neighborhood-based velocity updating strategy is developed for the purpose of thoroughly exploring the problem space. The proposed PSO-based GAN algorithm is shown to 1) work well in detecting cracks on the thermal data generated by the eddy current pulsed thermography technique; and 2) outperforms other conventional GAN algorithms.

A New GAN-Based Approach to Data Augmentation and Image Segmentation for Crack Detection in Thermal Imaging Tests

As a popular nondestructive testing (NDT) technique, thermal imaging test demonstrates competitive performance in crack detection, especially for detecting subsurface cracks. In thermal imaging test, the temperature of the crack area is higher than that of the non-crack area during the NDT process. By extracting the features of the thermal image sequences, the temperature curve of each spatial point is employed for crack detection. Nevertheless, the quality of thermal images is influenced by the noises due to the complex thermal environment in NDT. In this paper, a modified generative adversarial network (GAN) is employed to improve the image segmentation performance. To improve the feature extraction ability and alleviate the influence of noises, a penalty term is put forward in the loss function of the conventional GAN. A data preprocessing method is developed where the principle component analysis algorithm is adopted for feature extraction. The data argumentation technique is utilized to guarantee the quantity of the training samples. To validate its effectiveness in thermal imaging NDT, the modified GAN is applied to detect the cracks on the eddy current pulsed thermography NDT dataset.

Multi-task Pruning via Filter Index Sharing: A Many-Objective Optimization Approach

State-of-the-art deep neural network plays an increasingly important role in artificial intelligence, while the huge number of parameters in networks brings high memory cost and computational complexity. To solve this problem, filter pruning is widely used for neural network compression and acceleration. However, existing algorithms focus mainly on pruning single model, and few results are available to multi-task pruning that is capable of pruning multi-model and promoting the learning performance. By utilizing the filter sharing technique, this paper aimed to establish a multi-task pruning framework for simultaneously pruning and merging filters in multi-task networks. An optimization problem of selecting the important filters is solved by developing a many-objective optimization algorithm where three criteria are adopted as objectives for the many-objective optimization problem. With the purpose of keeping the network structure, an index matrix is introduced to regulate the information sharing during multi-task training. The proposed multi-task pruning algorithm is quite flexible that can be performed with either adaptive or pre-specified pruning rates. Extensive experiments are performed to verify the applicability and superiority of the proposed method on both single-task and multi-task pruning.