The problem of the large-scale interconnected system (LSIS) control is prevalent in practical engineering and is becoming increasingly complex. In this article, we propose a novel decentralized event-triggered tracking control (ETTC) strategy for a class of continuous-time nonlinear LSIS with unmatched interconnected terms and asymmetric input constraints. First, auxiliary subsystems are established to address the unmatched cross-linking terms. Next, the dynamics states of the tracking error and the exosystem are combined to construct a nominal augmented subsystem. By employing a nonquadratic performance function, the input-constrained decentralized tracking control problem is transformed into an optimal control problem for the nominal augmented subsystem. A group of independent parameters and event-triggered conditions are designed to save communication bandwidth and computational resources. Subsequently, the critic-only adaptive dynamic programming (ADP) method is used to solve the Hamilton-Jacobi–Bellman equation (HJBE) associated with the optimal control problem. To improve training success rate, the weights of the critic neural network (NN) are updated by introducing a particle swarm optimization algorithm (PSOA). The tracking error and the NN weights are proved to be uniformly ultimately bounded (UUB) under the proposed ETTC by using the Lyapunov extension theorem. Finally, the simulation example of an unmatched interconnected system is provided to verify the validity of the proposed decentralized method.

The automatic sorting of construction waste (CW) is an essential procedure in the field of CW recycling due to its remarkable efficiency and safety. The classification of CW is the primary task that guides automatic and precise sorting. In our work, a new method of CW classification based on two-level fusion is proposed to promote classification performance. First, statistical histograms are used to obtain global hue information and local oriented gradients, which are called the hue histogram (HH) and histogram of oriented gradients (HOG), respectively. To fuse these visual features, a bag-of-visual-words (BoVW) method is applied to code HOG descriptors in a CW image as a vector, and this process is named B-HOG. Then, based on feature-level fusion, we define a new feature to combine HH and B-HOG, which represent the global and local visual characteristics of an object in a CW image. Furthermore, two base classifiers are used to learn the information from the color feature space and the new feature space. Based on decision-level fusion, we propose a joint decision-making model to combine the decisions from the two base classifiers for the final classification result. Finally, to verify the performance of the proposed method, we collect five types of CW images as the experimental data set and use these images to conduct experiments on three different base classifiers. Moreover, we compare this method with other extant methods. The results demonstrate that our method is effective and feasible.

Hyperspectral images (HSIs) are challenging for hyperspectral object detection (HTD) due to their complex background information and the limited prior knowledge of the target. This article proposes an adaptive background latent space adversarial learning algorithm for hyperspectral target detection (ABLAL). We begin by using a coarse screening method to select pseudobackground and pseudotarget sample sets, addressing the issues caused by insufficient prior target information and complicated background information, which result in low detection accuracy. Next, we utilize an Adversarial Autoencoder (AAE) based backbone network to extract the background latent spatial information of the HSI. It should be noted that we adaptively constrain the accuracy of the extracted information through the pseudotarget dataset, accounting for the impact of potential targets in the pseudobackground dataset. Furthermore, we fully utilize the information extracted by AAE and employ a strategy combining multiple output results of AAE. Specifically, we use the distance between the target latent space vector and the background latent space vector, and the HSI reconstruction difference to suppress the background. Finally, extensive experiments are conducted on real datasets to demonstrate the effectiveness of the proposed method.

In this paper, a method of 3D concrete printing is used to find the optimal path of the nozzle running path. We propose a path optimization algorithm based on graph theory to solve two key problems in 3D concrete printing. The partitioning algorithm based on graph theory was adopted to improve the forming quality of concrete components, and ant colony algorithm was used to reduce printing time. The method was evaluated with 3D concrete printing experiments after introducing the process of implementing the partition algorithm and ant colony algorithm. The experiment results show a significant reduction in the idle strokes and the nozzle head-up times of the running path planned by the method in this paper. This has a direct impact on shortening the printing time and improving the forming quality. Compared with the other three conventional algorithms, the idle strokes of the nozzle planned by the method in this paper are reduced by 18.94%, 37.88%, and 66.67%, and the nozzle head-up times are reduced by 1.59%, 2.15%, and 8.69%. It provides a practical reference for the path optimization of 3D concrete printing.

The clustering of incomplete patterns is a very challenging task because the estimations may negatively affect the distribution of real centers and thus cause uncertainty and imprecision in the results. To address this problem, a new belief-based incomplete pattern unsupervised classification method (BPC) is proposed in this paper. Firstly, the complete patterns are grouped into a few clusters by a classical soft method like fuzzy c-means to obtain the corresponding reliable centers and thereby are partitioned into reliable patterns and unreliable ones by an optimization method. Secondly, a basic classifier trained by reliable patterns is employed to classifies unreliable patterns and the incomplete patterns edited by the neighbors. In this way, most of the edited incomplete patterns can be submitted to specific clusters. Finally, some ambiguous patterns will be carefully repartitioned again by a new distance-based rule depending on the obtained reliable centers and belief functions theory. By doing this, a few patterns that are very difficult to classify between different specific clusters will be reasonably submitted to meta-cluster which can characterize the uncertainty and imprecision of the clusters due to missing values. The simulation results show that the BPC has the potential to deal with real datasets.