Stochastic configuration network (SCN) is a mathematical model of incremental generation under a supervision mechanism, which has universal approximation property and advantages in data modeling. However, the efficiency of SCN is affected by some network parameters. An optimized searching algorithm for the input weights and biases is proposed in this paper. An optimization model with constraints is first established based on the convergence theory and inequality supervision mechanism of SCN; Then, a hybrid bat-particle swarm optimization algorithm (G-BAPSO) based on gradient information is proposed under the framework of PSO algorithm, which mainly uses gradient information and local adaptive adjustment mechanism characterized by pulse emission frequency to improve the searching ability. The algorithm optimizes the input weights and biases to improve the convergence rate of the network. Simulation results over some datasets demonstrate the feasibility and validity of the proposed algorithm. The training RMSE of G-BAPSO-SCN increased by and compared with that of SCN in the two regression experiments, and the recognition accuracy of G-BAPSO-SCN increased by 0.07% on average in the classification experiments.
In classification tasks, the algorithms heavily depend on big data, yet data category imbalance hinders the model’s ability to adequately learn from scarce class samples, impacting its overall learning capacity. This paper addresses the challenge of data imbalance in data-driven classification problems, which introduce an Improved Finite Elements-Synthetic Minority Oversampling Technique (IFE-SMOTE) for data balancing. This method triangulates the sample space leveraging FE-SMOTE, designates three strategic points within each split element based on defined rules, and synthetically generates samples within the linear vicinity of these points. The mathematical expectation of generated samples aligns with the triangle center of the original minority samples, while their variance closely mirrors that of the triangle center, ensuring statistical consistency with the original data. The corresponding theorem is provided and its validity is proved. Numerical experiments confirm the effectiveness of the proposed IFE-SMOTE method. The IFE-SMOTE algorithm classified eight datasets and compared them with other oversampling algorithms using G-mean, F-measure, and AUC. IFE-SMOTE’s average scores were 0.9273, 0.9754, and 0.9309, respectively, outperforming FE-SMOTE by 0.0268, 0.0059, and 0.0253, and other algorithms’ averages by 0.0493, 0.0169, and 0.0402.
20 March 2026 in IEEE Transactions on Consumer Electronics
This paper addresses real-time task allocation and path conflict resolution for heterogeneous agents in large-scale automated guided vehicle (AGV) systems within smart manufacturing. To overcome limitations of existing methods in dynamic and high-density environments, we propose a distributed market-based task allocation algorithm integrated with a cooperative multi-AGV obstacle avoidance strategy to ensure coordinated motion planning. A dynamic task buffer pool suppress system oscillations caused by frequent task arrivals. In addition, an incremental path caching mechanism is developed to reduce redundant computations during the 2-opt optimization process. The proposed Two-level priority mechanism effectively resolves multi-AGV collaborative obstacle avoidance and path conflict issues. Compared with existing approaches, the proposed method maintains robust conflict resolution among multiple AGVs while reducing task replanning frequency and computational cost. A standardized task allocation comparison framework is constructed to evaluate system performance under varying task scales. Simulation results based on real manufacturing layouts validate the feasibility and effectiveness of the proposed hybrid algorithm. The results provide practical guidance for efficient task scheduling and collaborative obstacle avoidance in industrial AGV systems.
A key part of CNC machine tools is the rolling bearing, and thus, it is vital to employ a data-driven approach for fault diagnosis. This paper proposes a two-stage fusion sparse learning algorithm for fault data processing that can identify and diagnose the fault types of rolling bearings based on sensor measurement data. During the feature extraction phase, temporal features of sequential data within the big data are extracted using a Long Short - Term Memory (LSTM) network. Moreover, the classification learning stage contains a new sparse learning algorithm, which applies regularization on stochastic configuration networks (SCN). The iterative learning formula combines the alternating direction method of multipliers (ADMM) with the analysis of the quadratic equations theory. Simultaneously, the model’s inequality supervision mechanism is updated based on convergence analysis. This developed algorithm incorporates the benefits of LSTM in extracting temporal data characteristics, along with the sparsity, ease of convergence, and lightweight nature of SCN. Consequently, it mitigates the shortcomings of deep models in end-to-end applications, particularly in terms of interpretability and structural redundancy, thus making it suitable for deployment on edge devices. Finally, a fusion sparse learning model (LSTM- -SCN) is introduced based on the two-stage learning algorithm for rolling bearing fault diagnosis. In the experiments on the benchmark dataset, the optimal sparsity degree of this algorithm for the Sparse Coding Network (SCN) reached 76.66%, which was 30% higher than that of the Pooling-based Sparse Coding Network (PSCN). Moreover, in the experiments based on the dataset of Case Western Reserve University (CWRU), the optimal test classification accuracy achieved was 97.51%, and the optimal sparsity degree for SCN reached 29.39%. These results verify that the proposed algorithm exhibits sparsity, demonstrates effectiveness, and is capable of identifying faults in rolling bearings.
3 August 2026 in Engineering Applications of Artificial Intelligence