Shigang Wang
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Shigang Wang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:
- Xueshan Gao
College of Mechanical and Marine Engineering, Beibu Gulf University, Qinzhou 535011, China
2 shared publications Yunqi Ran
School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China
2 shared publicationsBohua Qian
School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China
1 shared publication- Bohua Qian
School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China
1 shared publication Chengbin Wu
Guangxi University of Science and Technology
1 shared publication- Debing Xie
School of Automation, Guangxi University of Science and Technology, Liuzhou 545006, China
1 shared publication
Latest Publications
- Open Access
CLI-PPO: A Memory-Augmented PPO Framework with Intrinsic Curiosity and Curriculum Learning for Mapless Multi-Obstacle Navigation
Mapless autonomous navigation in unknown multi-obstacle environments remains challenging for deep reinforcement learning due to limited perception, sparse rewards, and distribution shifts between training and deployment scenarios. Existing methods mainly rely on instantaneous observations or individual enhancement strategies, which often struggle to balance exploration robustness and navigation efficiency. This paper proposes a Curriculum Learning and Intrinsic Curiosity-enhanced Temporal Proximal Policy Optimization framework, referred to as CLI-PPO, for end-to-end autonomous navigation. The framework integrates temporal state representation, intrinsic exploration, and progressive task scheduling into PPO, where an LSTM network improves sequential decision-making under partial observability, an Intrinsic Curiosity Module enhances exploration in unfamiliar regions, and Curriculum Learning stabilizes policy optimization by gradually increasing task difficulty. A hybrid reward function combining target guidance, obstacle avoidance, and exploration incentives is designed for policy training. Experiments were conducted using ablation configurations, three independent training seeds, and an evaluation of one SAC policy under the corresponding task protocol, with 5000 randomized episodes considered at each obstacle-density level. CLI-PPO achieved a success rate of 66.24%, a collision rate of 33.58%, and an average return of 3433.14, compared with 46.06%, 53.94%, and 2083.21 for PPO, respectively. In the 10-obstacle setting, the three training seeds produced a CLI-PPO success rate of and an average return of , while PPO+ICM+Curriculum achieved success and a slightly higher Euclidean-reference SPL. As obstacle density increased, PPO+ICM+Curriculum maintained higher success and SPL, whereas CLI-PPO yielded higher returns and more consistent performance across training runs.Open AccessCLI-PPO: A Memory-Augmented PPO Framework with Intrinsic Curiosity and Curriculum Learning for Mapless Multi-Obstacle Navigation
Mapless autonomous navigation in unknown multi-obstacle environments remains challenging for deep reinforcement learning due to limited perception, sparse rewards, and distribution shifts between training and deployment scenarios. Existing methods mainly rely on instantaneous observations or individual enhancement strategies, which often struggle to balance exploration robustness and navigation efficiency. This paper proposes a Curriculum Learning and Intrinsic Curiosity-enhanced Temporal Proximal Policy Optimization framework, referred to as CLI-PPO, for end-to-end autonomous navigation. The framework integrates temporal state representation, intrinsic exploration, and progressive task scheduling into PPO, where an LSTM network improves sequential decision-making under partial observability, an Intrinsic Curiosity Module enhances exploration in unfamiliar regions, and Curriculum Learning stabilizes policy optimization by gradually increasing task difficulty. A hybrid reward function combining target guidance, obstacle avoidance, and exploration incentives is designed for policy training. Experiments were conducted using ablation configurations, three independent training seeds, and an evaluation of one SAC policy under the corresponding task protocol, with 5000 randomized episodes considered at each obstacle-density level. CLI-PPO achieved a success rate of 66.24%, a collision rate of 33.58%, and an average return of 3433.14, compared with 46.06%, 53.94%, and 2083.21 for PPO, respectively. In the 10-obstacle setting, the three training seeds produced a CLI-PPO success rate of and an average return of , while PPO+ICM+Curriculum achieved success and a slightly higher Euclidean-reference SPL. As obstacle density increased, PPO+ICM+Curriculum maintained higher success and SPL, whereas CLI-PPO yielded higher returns and more consistent performance across training runs. - Open Access
RESC: A Rubric-Guided Error–Score Consistency Framework for Action Quality Assessment in Vocational Fitter Training
Action quality assessment in vocational fitter training is constrained by limited expert-annotated data and insufficiently interpretable predictions. To achieve accurate scoring and rubric-aligned, auditable explanations with limited data, this study proposes RESC, a rubric-guided error–score consistency framework. RESC uses human pose as its primary visual evidence and converts an instructor rubric into error semantics and scoring constraints. It therefore predicts an overall score while producing rubric-aligned error diagnoses and model-derived itemized deduction contributions. We constructed Fitter-AQA, a dataset of 134 filing videos from 25 participants, and evaluated the framework using strict leave-one-subject-out cross-validation. RESC achieved a mean absolute error of 4.450, a Pearson linear correlation coefficient of 0.902, and a Spearman rank correlation coefficient of 0.852, corresponding to the lowest pooled scoring errors and highest pooled correlations among the evaluated methods. Error diagnosis reached a Macro-F1 of 0.770 and a macro-average balanced accuracy of 0.824. These results indicate stable cross-subject scoring under limited-data conditions and transform model predictions into an auditable score decomposition aligned with rubric semantics. RESC thus provides an accurate and interpretable approach to automated assessment in vocational skills training.
Open AccessRESC: A Rubric-Guided Error–Score Consistency Framework for Action Quality Assessment in Vocational Fitter Training
Action quality assessment in vocational fitter training is constrained by limited expert-annotated data and insufficiently interpretable predictions. To achieve accurate scoring and rubric-aligned, auditable explanations with limited data, this study proposes RESC, a rubric-guided error–score consistency framework. RESC uses human pose as its primary visual evidence and converts an instructor rubric into error semantics and scoring constraints. It therefore predicts an overall score while producing rubric-aligned error diagnoses and model-derived itemized deduction contributions. We constructed Fitter-AQA, a dataset of 134 filing videos from 25 participants, and evaluated the framework using strict leave-one-subject-out cross-validation. RESC achieved a mean absolute error of 4.450, a Pearson linear correlation coefficient of 0.902, and a Spearman rank correlation coefficient of 0.852, corresponding to the lowest pooled scoring errors and highest pooled correlations among the evaluated methods. Error diagnosis reached a Macro-F1 of 0.770 and a macro-average balanced accuracy of 0.824. These results indicate stable cross-subject scoring under limited-data conditions and transform model predictions into an auditable score decomposition aligned with rubric semantics. RESC thus provides an accurate and interpretable approach to automated assessment in vocational skills training.
- Open Access
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 152544-152564
ELC-YOLO: An Edge-Oriented Lightweight Detector With Scale-Adaptive Regression for Classroom Behavior Detection
- 1 January 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 152544-152564
Open AccessELC-YOLO: An Edge-Oriented Lightweight Detector With Scale-Adaptive Regression for Classroom Behavior Detection
- Open Access
ToggleMimic: A Two-Stage Policy for Text-Driven Humanoid Whole-Body Control
For humanoid robots to interact naturally with humans and seamlessly integrate into daily life, natural language serves as an essential communication medium. While recent advances in imitation learning have enabled robots to acquire complex motions through expert demonstration, traditional approaches often rely on rigid task specifications or single-modal inputs, limiting their ability to interpret high-level semantic instructions (e.g., natural language commands) or dynamically switch between actions. Directly translating natural language into executable control commands remains a significant challenge. To address this, we propose ToggleMimic, an end-to-end imitation learning framework that generates robotic motions from textual instructions, enabling language-driven multi-task control. In contrast to end-to-end methods that struggle with generalization or single-action models that lack flexibility, our ToggleMimic framework uniquely combines the following: (1) a two-stage policy distillation that efficiently bridges the sim-to-real gap, (2) a lightweight cross-attention mechanism for interpretable text-to-action mapping, and (3) a gating network that enhances robustness to linguistic variations. Extensive simulation and real-world experiments demonstrate the framework’s effectiveness, generalization capability, and robust text-guided control performance. This work establishes an efficient, interpretable, and scalable learning paradigm for cross-modal semantic-driven autonomous robot control.
Open AccessToggleMimic: A Two-Stage Policy for Text-Driven Humanoid Whole-Body Control
For humanoid robots to interact naturally with humans and seamlessly integrate into daily life, natural language serves as an essential communication medium. While recent advances in imitation learning have enabled robots to acquire complex motions through expert demonstration, traditional approaches often rely on rigid task specifications or single-modal inputs, limiting their ability to interpret high-level semantic instructions (e.g., natural language commands) or dynamically switch between actions. Directly translating natural language into executable control commands remains a significant challenge. To address this, we propose ToggleMimic, an end-to-end imitation learning framework that generates robotic motions from textual instructions, enabling language-driven multi-task control. In contrast to end-to-end methods that struggle with generalization or single-action models that lack flexibility, our ToggleMimic framework uniquely combines the following: (1) a two-stage policy distillation that efficiently bridges the sim-to-real gap, (2) a lightweight cross-attention mechanism for interpretable text-to-action mapping, and (3) a gating network that enhances robustness to linguistic variations. Extensive simulation and real-world experiments demonstrate the framework’s effectiveness, generalization capability, and robust text-guided control performance. This work establishes an efficient, interpretable, and scalable learning paradigm for cross-modal semantic-driven autonomous robot control.
- Open Access
- 4 November 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (11) , 702
An Improved Bi-RRT Algorithm for Optimal Puncture Path Planning
Percutaneous puncture has become one of the most widely used minimally invasive techniques in clinical practice due to its advantages of low trauma, quick recovery and easy operation. However, incomplete needle tip movement, tissue barriers and complex distribution of sensitive organs make it difficult to balance puncture accuracy and safety. To this end, this paper proposes a new puncture path planning algorithm for flexible needles, which integrates gravitational guidance, bi-directional adaptive expansion, optimal node selection based on the A* algorithm, and path optimization strategies, with Bi-Rapid-Research Random Trees (Bi-RRTs) at its core, to significantly improve obstacle avoidance capability and computational efficiency. The simulation results of 2D and 3D complex scenes in MATLAB show that compared with the traditional RRT algorithm and Bi-RRT algorithm, the GBOPBi-RRT algorithm achieves significant advantages in terms of path length, computation time and node size. In particular, in the 3D environment, the GBOPBi-RRT algorithm shortens the planning path by 43.21% compared with RRT, 27.47% compared with RRT* and 30.33% compared with Bi-RRT, which provides a reliable solution for efficient planning of percutaneous puncture with flexible needles.
- 4 November 2025
- Published by MDPI AG in Algorithms
- Vol. 18 (11) , 702
Open AccessAn Improved Bi-RRT Algorithm for Optimal Puncture Path Planning
Percutaneous puncture has become one of the most widely used minimally invasive techniques in clinical practice due to its advantages of low trauma, quick recovery and easy operation. However, incomplete needle tip movement, tissue barriers and complex distribution of sensitive organs make it difficult to balance puncture accuracy and safety. To this end, this paper proposes a new puncture path planning algorithm for flexible needles, which integrates gravitational guidance, bi-directional adaptive expansion, optimal node selection based on the A* algorithm, and path optimization strategies, with Bi-Rapid-Research Random Trees (Bi-RRTs) at its core, to significantly improve obstacle avoidance capability and computational efficiency. The simulation results of 2D and 3D complex scenes in MATLAB show that compared with the traditional RRT algorithm and Bi-RRT algorithm, the GBOPBi-RRT algorithm achieves significant advantages in terms of path length, computation time and node size. In particular, in the 3D environment, the GBOPBi-RRT algorithm shortens the planning path by 43.21% compared with RRT, 27.47% compared with RRT* and 30.33% compared with Bi-RRT, which provides a reliable solution for efficient planning of percutaneous puncture with flexible needles.
- Open Access
- 1 October 2025
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 3133 (1)
Study of robot path planning based on an improved Bi-RRT algorithm
For the path planning of robots, a new robot path planning algorithm has been proposed. This algorithm is centered on the Bidirectional Rapidly-exploring Random Tree (Bi-RRT), integrating the gravitational guidance strategy and the optimal node selection strategy based on the A* algorithm. This significantly enhances the obstacle avoidance capability and computational efficiency. The simulation results in a twodimensional scenario using MATLAB show that, compared to the RRT, RRT*, and Bi-RRT, the GOBi-RRT achieves significant advantages in terms of path length, computational time, and node scale. It provides a reliable solution for the efficient planning of robot paths.
- 1 October 2025
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 3133 (1)
Open AccessStudy of robot path planning based on an improved Bi-RRT algorithm
For the path planning of robots, a new robot path planning algorithm has been proposed. This algorithm is centered on the Bidirectional Rapidly-exploring Random Tree (Bi-RRT), integrating the gravitational guidance strategy and the optimal node selection strategy based on the A* algorithm. This significantly enhances the obstacle avoidance capability and computational efficiency. The simulation results in a twodimensional scenario using MATLAB show that, compared to the RRT, RRT*, and Bi-RRT, the GOBi-RRT achieves significant advantages in terms of path length, computational time, and node scale. It provides a reliable solution for the efficient planning of robot paths.
- Open Access
- 1 October 2025
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 3133 (1)
MSD: Learning general and agile locomotion using multi-skill distillation
Legged robots are particularly well-suited for navigating terrains that are inaccessible to wheeled robots, which has led to a significant increase in their applications in recent years. However, many existing control approaches still struggle to achieve generalization in diverse and unstructured environments. In this work, we introduce the MSD training framework for general and agile locomotion of legged robots through a multi-skill distillation approach. First, expert policies are trained for different terrains. Then, using the DAgger algorithm, these expert skills are distilled into a single deployable policy. The proposed policy integrates depth images as exteroceptive observations, enabling agile navigation across diverse and unstructured terrains. Finally, deployment on the MagicDog-W robot validates the policy’s capability to achieve robust and flexible locomotion in challenging environments.
- 1 October 2025
- Published by IOP Publishing in Journal of Physics: Conference Series
- Vol. 3133 (1)
Open AccessMSD: Learning general and agile locomotion using multi-skill distillation
Legged robots are particularly well-suited for navigating terrains that are inaccessible to wheeled robots, which has led to a significant increase in their applications in recent years. However, many existing control approaches still struggle to achieve generalization in diverse and unstructured environments. In this work, we introduce the MSD training framework for general and agile locomotion of legged robots through a multi-skill distillation approach. First, expert policies are trained for different terrains. Then, using the DAgger algorithm, these expert skills are distilled into a single deployable policy. The proposed policy integrates depth images as exteroceptive observations, enabling agile navigation across diverse and unstructured terrains. Finally, deployment on the MagicDog-W robot validates the policy’s capability to achieve robust and flexible locomotion in challenging environments.
- 1 April 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (8) , 6543-6557
TransDiff: medical image segmentation method based on Swin Transformer with diffusion probabilistic model
- 1 April 2024
- Published by Springer Nature in Applied Intelligence
- Vol. 54 (8) , 6543-6557
TransDiff: medical image segmentation method based on Swin Transformer with diffusion probabilistic model
- Open Access
An H-GrabCut Image Segmentation Algorithm for Indoor Pedestrian Background Removal
In the context of predicting pedestrian trajectories for indoor mobile robots, it is crucial to accurately measure the distance between indoor pedestrians and robots. This study aims to address this requirement by extracting pedestrians as regions of interest and mitigating issues related to inaccurate depth camera distance measurements and illumination conditions. To tackle these challenges, we focus on an improved version of the H-GrabCut image segmentation algorithm, which involves four steps for segmenting indoor pedestrians. Firstly, we leverage the YOLO-V5 object recognition algorithm to construct detection nodes. Next, we propose an enhanced BIL-MSRCR algorithm to enhance the edge details of pedestrians. Finally, we optimize the clustering features of the GrabCut algorithm by incorporating two-dimensional entropy, UV component distance, and LBP texture feature values. The experimental results demonstrate that our algorithm achieves a segmentation accuracy of 97.13% in both the INRIA dataset and real-world tests, outperforming alternative methods in terms of sensitivity, missegmentation rate, and intersection-over-union metrics. These experiments confirm the feasibility and practicality of our approach. The aforementioned findings will be utilized in the preliminary processing of indoor mobile robot pedestrian trajectory prediction and enable path planning based on the predicted results.
Open AccessAn H-GrabCut Image Segmentation Algorithm for Indoor Pedestrian Background Removal
In the context of predicting pedestrian trajectories for indoor mobile robots, it is crucial to accurately measure the distance between indoor pedestrians and robots. This study aims to address this requirement by extracting pedestrians as regions of interest and mitigating issues related to inaccurate depth camera distance measurements and illumination conditions. To tackle these challenges, we focus on an improved version of the H-GrabCut image segmentation algorithm, which involves four steps for segmenting indoor pedestrians. Firstly, we leverage the YOLO-V5 object recognition algorithm to construct detection nodes. Next, we propose an enhanced BIL-MSRCR algorithm to enhance the edge details of pedestrians. Finally, we optimize the clustering features of the GrabCut algorithm by incorporating two-dimensional entropy, UV component distance, and LBP texture feature values. The experimental results demonstrate that our algorithm achieves a segmentation accuracy of 97.13% in both the INRIA dataset and real-world tests, outperforming alternative methods in terms of sensitivity, missegmentation rate, and intersection-over-union metrics. These experiments confirm the feasibility and practicality of our approach. The aforementioned findings will be utilized in the preliminary processing of indoor mobile robot pedestrian trajectory prediction and enable path planning based on the predicted results.
- Open Access
Planning of Medical Flexible Needle Motion in Effective Area of Clinical Puncture
Lung cancer is the leading cause of cancer deaths worldwide. Although several lung cancer diagnostic methods are available for lung nodule biopsy, there are limitations in terms of accuracy, safety, and invasiveness. Transbronchial needle aspiration (TBNA) is a common method for diagnosing and treating lung cancer that involves a robot-assisted medical flexible needle moving along a curved three-dimensional trajectory, avoiding anatomical barriers to achieve clinically meaningful goals in humans. Inspired by the puncture angle between the needle tip and the vessel in venipuncture, we suggest that different orientations of the medical flexible needle puncture path affect the cost of the puncture trajectory and propose an effective puncture region based on the optimal puncture direction, which is a strategy based on imposing geometric constraints on the search space of the puncture direction, and based on this, we focused on the improved implementation of RCS*. Planning within the TBNA-based lung environment was performed using the rapidly exploring random tree (RRT), resolution-complete search (RCS), and RCS* (a resolution-optimal version of RCS) within an effective puncture region. The experimental results show that the optimal puncture direction corresponding to the lowest cost puncture trajectory is consistent among the three algorithms and RCS* is more efficient for planning. The experiments verified the feasibility and practicality of our proposed minimum puncture angle and puncture effective region and facilitated the study of the puncture direction of flexible needle puncture.
Open AccessPlanning of Medical Flexible Needle Motion in Effective Area of Clinical Puncture
Lung cancer is the leading cause of cancer deaths worldwide. Although several lung cancer diagnostic methods are available for lung nodule biopsy, there are limitations in terms of accuracy, safety, and invasiveness. Transbronchial needle aspiration (TBNA) is a common method for diagnosing and treating lung cancer that involves a robot-assisted medical flexible needle moving along a curved three-dimensional trajectory, avoiding anatomical barriers to achieve clinically meaningful goals in humans. Inspired by the puncture angle between the needle tip and the vessel in venipuncture, we suggest that different orientations of the medical flexible needle puncture path affect the cost of the puncture trajectory and propose an effective puncture region based on the optimal puncture direction, which is a strategy based on imposing geometric constraints on the search space of the puncture direction, and based on this, we focused on the improved implementation of RCS*. Planning within the TBNA-based lung environment was performed using the rapidly exploring random tree (RRT), resolution-complete search (RCS), and RCS* (a resolution-optimal version of RCS) within an effective puncture region. The experimental results show that the optimal puncture direction corresponding to the lowest cost puncture trajectory is consistent among the three algorithms and RCS* is more efficient for planning. The experiments verified the feasibility and practicality of our proposed minimum puncture angle and puncture effective region and facilitated the study of the puncture direction of flexible needle puncture.