Sparse Wasserstein stationary subspace analysis for fault detection and diagnosis of nonstationary industrial processes.

Fault detection and diagnosis of nonstationary processes are crucial for ensuring the safety of industrial production systems. However, the nonstationarity of process data poses multifaceted challenges to them. First, conventional stationary fault detection methods encounter difficulties in discerning evolving trends within nonstationary data. Secondly, the majority of current nonstationary fault detection methods directly extract features from all variables, rendering them susceptible to redundant interference. Moreover, nonstationary trends possess the capacity to conceal and modify the correlations among variables. Coupled with the smearing effect of faults, it is challenging to achieve accurate fault diagnosis. To address these challenges, this paper proposes sparse Wasserstein stationary subspace analysis (SWSSA). Specifically, a ℓ2,p-norm constraint is introduced to endow the stationary subspace model with excellent sparse representation capability. Furthermore, recognizing that fault variables within the sparse stationary subspace influence only a limited subset of stationary sources, this paper proposes a novel contribution analysis method based on local dynamic preserving projection (LDPP), termed LDPPBC, which can effectively mitigate the smearing effect on nonstationary fault diagnosis. LDPPBC establishes a LDPP matrix by extracting the latent positional information of fault variables within the stationary subspace. This allows LDPPBC to selectively analyze the contributions of variables within the latent fault subspace to achieve precise fault diagnosis while avoiding the interference of variable contributions from the fault-free subspace. Finally, the superiority of the proposed method is thoroughly validated through a numerical simulation, a continuous stirred tank reactor, and a real industrial roaster.

Error-Triggered Adaptive Sparse Identification for Predictive Control and Its Application to Multiple Operating Conditions Processes.

With the digital transformation of process manufacturing, identifying the system model from process data and then applying to predictive control has become the most dominant approach in process control. However, the controlled plant often operates under changing operating conditions. What is more, there are often unknown operating conditions such as first appearance operating conditions, which make traditional predictive control methods based on identified model difficult to adapt to changing operating conditions. Moreover, the control accuracy is low during operating condition switching. To solve these problems, this article proposes an error-triggered adaptive sparse identification for predictive control (ETASI4PC) method. Specifically, an initial model is established based on sparse identification. Then, a prediction error-triggered mechanism is proposed to monitor operating condition changes in real time. Next, the previously identified model is updated with the fewest modifications by identifying parameter change, structural change, and combination of changes in the dynamical equations, thus achieving precise control to multiple operating conditions. Considering the problem of low control accuracy during the operating condition switching, a novel elastic feedback correction strategy is proposed to significantly improve the control accuracy in the transition period and ensure accurate control under full operating conditions. To verify the superiority of the proposed method, a numerical simulation case and a continuous stirred tank reactor (CSTR) case are designed. Compared with some state-of-the-art methods, the proposed method can rapidly adapt to frequent changes in operating conditions, and it can achieve real-time control effects even for unknown operating conditions such as first appearance operating conditions.

Adaptive Multimode Process Monitoring Based on Mode-Matching and Similarity-Preserving Dictionary Learning.

In real industrial processes, factors, such as the change in manufacturing strategy and production technology lead to the creation of multimode industrial processes and the continuous emergence of new modes. Although the industrial SCADA system has accumulated a large amount of historical data, which can be used for modeling and monitoring multimode processes to a certain extent, it is difficult for the model learned from historical data to adapt to emerging modes, resulting in the model mismatch. On the other hand, updating the model with data from new modes allows the model to continuously match the new modes, but it may cause the model to lose the ability to represent the historical modes, resulting in "catastrophic forgetting." To address these problems, this article proposed a jointly mode-matching and similarity-preserving dictionary learning (JMSDL) method, which updated the model by learning the data of new modes, so that the model can adaptively match the newly emerged modes. At the same time, a similarity metric was put forward to guarantee the representation ability of the proposed method for historical data. A numerical simulation experiment, the CSTH process experiment, and an industrial roasting process experiment indicated that the proposed JMSDL method can match new modes while maintaining its performance on the historical modes accurately. In addition, the proposed method significantly outperforms the state-of-the-art methods in terms of fault detection and false alarm rate.

Swarm intelligence inspired cooperation promotion and symmetry breaking in interdependent networked game.

The evolution of a cooperative strategy on multilayer networks is arousing increasing concern. Most of the previous studies assumed that agents can only choose cooperation or defection when interacting with their partners, whereas the actual provisions in real world scenarios might not be discrete, but rather continuous. Furthermore, in evolutionary game, agents often make use of their memory which keeps the most successful strategy in the past, as well as the best current strategy gained by their directed neighbors, to find the best available strategies. Inspired by these observations, we study the impact of the particle swarm optimization (PSO) algorithm on the evolution of cooperation on interdependent networks in the continuous version of spatial prisoner's dilemma games. Following extensive simulations of this setup, we can observe that the introduction of the PSO mechanism on the interdependent networks can promote cooperation strongly, regardless of the network coupling strength. In addition, we find that the increment of coupling strength is more suitable for the propagation of cooperation. More interestingly, we find that when the coupling strength is relatively large, a spontaneous symmetry breaking phenomenon of cooperation occurs between the interdependent networks. To interpret the symmetry breaking phenomenon, we investigate the asynchronous expansion of heterogeneous strategy couples between different networks. Since this work takes cooperation from a more elaborate perspective, we believe that it may provide a deep understanding of the evolution of cooperation in social networks.