CCCheng Chen

Cheng Chen

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

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Cheng Chen has a total of 2 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    An Enhanced Deep Q Network Algorithm for Localized Obstacle Avoidance in Indoor Robot Path Planning

    by Cheng Chen, Jiantao Yu, Songrong Qian

    Path planning is a key task in mobile robots, and the application of Deep Q Network (DQN) algorithm for mobile robot path planning has become a hotspot and challenge in current research. In order to solve the obstacle avoidance limitations faced by the DQN algorithm in indoor robot path planning, this paper proposes a solution based on an improved DQN algorithm. In view of the low learning efficiency of the DQN algorithm, the Duel DQN structure is introduced to enhance the performance and combined with a Prioritized Experience Replay (PER) mechanism to ensure the stability of the robot during the learning process. In addition, the idea of Munchausen Deep Q Network (M-DQN) is incorporated to guide the robot to learn the optimal policy more effectively. Based on the above improvements, the PER-D2MQN algorithm is proposed in this paper. In order to validate the effectiveness of the proposed algorithm, we conducted multidimensional simulation comparison experiments of the PER-D2MQN algorithm with DQN, Duel DQN, and the existing methodology PMR-DQN in the Gazebo simulation environment and examined the cumulative and average rewards for reaching the goal point, the number of convergent execution steps, and the time consumed by the robot in reaching the goal point. The simulation results show that the PER-D2MQN algorithm obtains the highest reward in both static and complex environments, exhibits the best convergence, and finds the goal point with the lowest average number of steps and the shortest elapsed time.


  • Open Access

    Lightweight Crack Automatic Detection Algorithm Based on TF-MobileNet

    by Jiantao Yu, Songrong Qian, Cheng Chen

    With the progress of social life, the aging of building facilities has become an inevitable phenomenon. The efficiency of manual crack detection is limited, so it is necessary to explore intelligent detection technology. This article proposes a novel crack detection method TF-MobileNet. We took into account the effect of lightweight and crack feature extraction, so we developed a novel crack feature extraction backbone network, which combined Transformer and MobileNetV3. Then we improved the feature fusion network by using the multi-headed attention mechanism of the Bottleneck Transformer, which enables the feature fusion effect to be improved. Then, we integrated SENet and SimAM attention mechanisms into the networks used for feature extraction and feature fusion, thereby further improving the crack detection performance. Finally, we deployed our model in edge devices (NVIDIA Jeston Nano). The findings indicate that our proposed model has achieved 90.8% mAP on the dataset and worked well on the edge device side, which meet the requirements of automatic crack detection. Our model enables real-time monitoring of pavement using edge devices. This approach allows for timely maintenance and repair of the pavement. In the future, we can train the model to recognize more pavement distress features, addressing road safety issues effectively.