The paper proposes a fuzzy proportion integral differential (PID) control strategy based on road estimation to meet the different performance requirements of active suspension for comfort and safety under different road conditions in view of the uncertainty of vehicle suspension parameters and random road perturbations. First, flexible neural tree (FNT) is used to estimate the vertical disturbance of road within uncertain vehicle parameters in which the Fourier transform of the autocorrelation function is used to fit the road power spectrum density (PSD). In order to compensate for the delay and realize the real-time estimate of road conditions, an online fuzzy evaluation strategy for road condition is developed by integrating the fitted road PSD and the real-time suspension performance. After that, an adaptive fuzzy PID control strategy is developed based on the adaptive suspension control performance, which is supposed to realize the adaptive adjustment of control parameters for different road conditions. The simulation experimental results show that the online fuzzy evaluation strategy can effectively reflect the change in road condition, and the proposed adaptive fuzzy PID control strategy can work for adjusting the parameters adaptively, according to the changes in road conditions and therefore meet the control performance requirements under different road conditions.

In this article, the fault-tolerant control (FTC) problem of vehicle active suspension is concerned in the discrete-time domain, in which the road disturbances and faults in actuator and measurement are considered. The main contribution consists of proposing an active physically realizable fault-tolerant controller based on a reduced-order observer, which makes up an optimal vibration control component and an event-triggered FTC component. More specifically, by discussing a discrete vehicle active suspension subject to road disturbances generated from the output of a designed exosystem, the optimal vibration control component is derived from maximum principle to offset the inevitable vibrations. Meanwhile, based on the real-time system output of vehicle suspension rather than residual error, a reduced-order observer is proposed to cover the physically unrealizable problem for the designed optimal vibration control component. After that, an event-triggered FTC component and an event-triggered restructured system output are designed to compensate the faults in actuator and measurement, respectively. Finally, extensive experiments are conduced to the control performance of vehicle active suspension under the proposed controller, and confirm its effectiveness and superiority over other control schemes.

Tensor-based robust principal component analysis (PCA) methods are efficient to discover the low-rank part of a hyperspectral image for reducing redundant information and guarantee good classification results. However, current methods cannot remove noise adequately, and the residual noise remaining in the low-rank image limits the further improvement of classification performance. Thus, enhancing the robustness to noise is important and helpful for tensor-based robust PCA (RPCA) methods to process hyperspectral images. To this end, we propose a tensor-based RPCA method with a locality preserving graph and frontal slice sparsity (LPGTRPCA) for hyperspectral image classification. Specifically, a tensor $l_{2,2,1}$ norm that requires the frontal slice sparsity of a tensor is defined to extract the noise in the hyperspectral image from the frontal direction. What is more, a position-based Laplacian graph that preserves the local structures of a tensor according to the spatial position is designed for relieving the impact of the residual noise remaining in the low-rank image. Based on the tensor nuclear norm, the tensor $l_{2,2,1}$ norm, and the position-based Laplacian graph, LPGTRPCA efficiently separates the low-rank part with little noise from a raw hyperspectral image and achieves more robust classification results than current methods. LPGTRPCA is optimized by the alternative direction multiplier method (ADMM), and the convergence of solutions is experimentally demonstrated. In the experiments conducted on Indian Pines, Pavia University, and Salinas datasets, LPGTRPCA outperformed various state-of-the-art and classical tensor-based RPCA methods in terms of average class classification accuracy (AA), overall classification accuracy (OA), and kappa coefficient (KC).

Distributed clustering based on the Gaussian mixture model (GMM) has exhibited excellent clustering capabilities in peer-to-peer (P2P) networks. However, more iterative numbers and communication overhead are required to achieve the consensus in existing distributed GMM clustering algorithms. In addition, the truth that it cannot find a closed form for the update of parameters in GMM causes the imprecise clustering accuracy. To solve these issues, by utilizing the transfer learning technique, a general transfer distributed GMM clustering framework is exploited to promote the clustering performance and accelerate the clustering convergence. In this work, each node is treated as both the source domain and the target domain, and these nodes can learn from each other to complete the clustering task in distributed P2P networks. Based on this framework, the transfer distributed expectation–maximization algorithm with the fixed learning rate is first presented for data clustering. Then, an improved version is designed to obtain the stable clustering accuracy, in which an adaptive transfer learning strategy is adopted to adjust the learning rate automatically instead of a fixed value. To demonstrate the extensibility of the proposed framework, a representative GMM clustering method, the entropy-type classification maximum-likelihood algorithm, is further extended to the transfer distributed counterpart. Experimental results verify the effectiveness of the presented algorithms in contrast with the existing GMM clustering approaches.

Collaborative multi-view clustering methods can efficiently realize the view fusion by exploring complementary and consistent information among multiple views. However, these studies all ignore the differences between multiple views in fusion. In fact, in the multi-view clustering, the data is diverse from view to view. The larger the difference between any two views is, the more the fusion of these views is required. Moreover, a global trade-off parameter is generally adopted to restrain the penalty related to the disagreement of all views, which is often defined empirically. Inspired by the idea of transfer learning, a series of novel collaborative multi-view clustering algorithms are proposed to tackle these challenges. In the most basic one, each view performs clustering independently and learns from others to improve its own clustering performance, in which a global learning factor is defined to control the interaction between multiple views. The fuzzy memberships are regarded as the important knowledge to provide guidance between views, and the consensus constraint is defined to ensure the consistent partitions of all views. In addition, the local adaptive learning factors between any two views instead of a global fixed one are adopted in an improved version to emphasize the difference between views, and the adjustment strategy for the learning factor is further designed to guarantee the stability of multi-view clustering without the influence of initial values. Finally, to identify the significance of different views to the clustering, the extended versions are excavated with the assignment of view weights and the maximum entropy regularization technique is employed to optimize the weights. Experiments on various real-world multi-view datasets verify the superiority of the presented approaches.