Search

Due to the self-affine property of the grinding surface, the sample images with different roughness captured by the micron-scale camera exhibit certain similarities. This similarity affects the prediction accuracy of the deep learning model. In this paper, we propose an illumination method that can mitigate the impact of self-affinity using the two-scale fractal theory as a foundation. This is followed by the establishment of a machine vision detection method that integrates a neural network and correlation function. Initially, a neural network is employed to categorize and forecast the microscopic image of the workpiece surface, thereby determining its roughness category. Subsequently, the corresponding correlation function is determined in accordance with the established roughness category. Finally, the surface roughness of the workpiece was calculated based on the correlation function. The experimental results demonstrate that images obtained using this lighting method exhibit significantly enhanced accuracy in neural network classification. In comparison to traditional lighting methods, the accuracy of this method on the micrometer scale has been found to have significantly increased from approximately 50% to over 95%. Concurrently, the mean squared error (MSE) of the surface roughness calculated by the proposed method does not exceed 0.003, and the mean relative error (MRE) does not exceed 5%. The two-scale fractal geometry offers a novel approach to image processing and machine learning, with significant potential for advancement.

To improve traffic efficiency and utilization of road resources and alleviate traffic congestion caused by imbalance of bidirectional traffic flow, in view of the conversion conditions of reversible lane function, the operating characteristics of associated intersections under dynamic reversible lanes are analysed in terms of capacity, and a reversible lane control model is constructed based on short-term traffic flow prediction. On this basis, the reversible lane segment clearing time and upstream and downstream signal control strategies under different states are studied. The collaborative control model of reversible lane clearing time and signal timing of associated intersections is established to obtain the optimal time for reversible lane function switching. Finally, using Chaoyang Road, Beijing, as an example, the effectiveness of the proposed model is verified by the simulation indexes of average vehicle delay and reversible lane clearing time. The results show that the optimized clearing efficiency exceeds 15% and the optimized average vehicle delay is reduced by more than 10%. Combined with the future traffic state, the traffic capacity and saturation flow are greatly improved, and the intelligent reversible lane control is better achieved., Author(s): Xiaolan Xie [1,2]; Luxi Dong (corresponding author) [3,4]; Huinan Gu [5]; Hailing Li [3]; Lieping Zhang [4] 1. Introduction In the case of limited supply of urban road resources, [...]

Targeting some problems of the RRT_Connect path planning algorithm, such as average search and low efficiency, proposes an improved RRT_Connect algorithm that may optimize the searched nodes and parts of planned paths. Firstly, an improved RRT_Connect algorithm based on destination and searched node bias strategy is proposed. Secondly, an improved RRT_Connect algorithm is put forward for the optimization of the searched nodes and some planned paths to deal with the problem of low quality reflected in the improved RRT_Connect path planning algorithm, and the optimization for the cost of path planning by figuring out valid new nodes and parent nodes of adjacent nodes within a certain range. On this basis, the path planning algorithm is verified by simulation and actual experiments. It is shown by the experimental results that the improved RRT_Connect algorithm proposed in this paper can not only shorten the time and length of path planning but also decrease the number of search iterations and nodes. [ABSTRACT FROM AUTHOR]

A Cuckoo Search (CS) algorithm based on ant colony algorithm is proposed for scheduling problem in permutation flow shop scheduling problem (PFSP). When the raised CS algorithm obtains the position of the bird nest to be updated, it is used as a set of initial solution of the ant colony optimization algorithm (ACO), and ACO algorithm search optimization is performed in a very small range. After that, the solution obtained by the ACO search is taken as a new candidate solution, compared with the candidate bird nest according to the fitness degree. When the candidate solution of the ACO search optimization is better than the one generated by the Lévy flight, the latter is replaced. Finally, the CS algorithm is selected, changing the new bird nest position according to the abandonment probability. The updated position tends to be more optimal, which improves the quality of the solution as well as the convergence speed and accuracy of the algorithm. Comparing the performance of the proposed algorithm with the standard Cuckoo one, by testing function, the optimized performance was verified. Finally, the Car benchmark test served as test data, and the performance in the PFSP was compared. The effectiveness and superiority in the algorithm in solving problem were confirmed. [ABSTRACT FROM AUTHOR]