JHJi Huang

Ji Huang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Ji Huang has a total of 5 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Top Cited Papers
    Open Access

    A comprehensive review of deep learning-based fault diagnosis approaches for rolling bearings: Advancements and challenges

    by Jiangdong Zhao, Wenming Wang, Ji Huang, Xiaolu Ma

    Rolling bearing fault diagnosis is an important technology for health monitoring and pre-maintenance of mechanical equipment, which is of great significance for improving equipment operation reliability and reducing maintenance costs. This article reviews the research progress of fault diagnosis methods for rolling bearings, with a focus on analyzing the applications, advantages, and disadvantages of traditional data-driven methods, deep learning methods, graph embedding methods, and Transformer methods in this field. In addition, further analysis was conducted on the main issues of current research, including complex network structures, insufficient information attention, difficulties in graph data processing, and challenges in long-term dependency modeling. In response to these challenges, future research should focus on designing more lightweight and efficient models, improving computational efficiency, robustness of the models, and strengthening attention and deep mining of fault features.


  • Open Access

    Smooth Path Planning of Mobile Robot Based on Improved Ant Colony Algorithm

    by Wenming Wang, Jiangdong Zhao, Zebin Li, Ji Huang

    Aiming at the problems of slow convergence, easy to fall into local optimum, and poor smoothness of traditional ant colony algorithm in mobile robot path planning, an improved ant colony algorithm based on path smoothing factor was proposed. Firstly, the environment map was constructed based on the grid method, and each grid was marked to make the ant colony move from the initial grid to the target grid for path search. Then, the heuristic information is improved by referring to the direction information of the starting point and the end point and combining with the turning angle. By improving the heuristic information, the direction of the search is increased and the turning angle of the robot is reduced. Finally, the pheromone updating rules were improved, the smoothness of the two-dimensional path was considered, the turning times of the robot were reduced, and a new path evaluation function was introduced to enhance the pheromone differentiation of the effective path. At the same time, the Max-Min Ant System (MMAS) algorithm was used to limit the pheromone concentration to avoid being trapped in the local optimum path. The simulation results show that the improved ant colony algorithm can search the optimal path length and plan a smoother and safer path with fast convergence speed, which effectively solves the global path planning problem of mobile robot.


  • Open Access

    Improved Ant Colony Genetic Algorithm for Solving Traveling Salesman Problem

    by Wenming Wang, Jiangdong Zhao, Ji Huang

    A new improved ant colony genetic algorithm(IACGA) is proposed to solve the problems of the basic ant colony optimization algorithm(ACO), such as the slow convergence rate and the local optimal solution. Based on the ACO model, local pheromone increment is updated differently according to the path quality constructed by ants, the current optimal path pheromone residual factor is adjusted adaptively, pheromone updating rules are improved, genetic operator is embedded and genetic algorithm(GA) is dynamically fused. It makes full use of the positive feedback mechanism of ACO and the searching ability of GA to realize the dynamic fusion of ACO and GA. The experimental results show that compared with the ACO and the GA, the improved algorithm can find the global optimal solution quickly, and the solution quality is relatively good, which improves the efficiency of the ant colony algorithm in solving the traveling salesman problem(TSP).