guangxi wan

Mr. guangxi wan

Key Laboratory of Networked Control Systems, Chinese Academy of Sciences, Shenyang 110016, China
orcid

Research Focus & Metrics

Academic Career Length

7Years (2020-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
17 March 2025 in Complex & Intelligent Systems
Verified
Journal Article
Open access
PDF file
XDXiaoting Dong
Xiaoting Dong
GWguangxi wan
guangxi wan
PZPeng Zeng
Peng Zeng
Automated guided vehicles (AGVs) are widely used for transportation in flexible job shop (FJS) systems, and their transportation task scheduling has the same substantial impact on production efficiency as machine scheduling does. However, traditional FJS scheduling methods often prioritize job sequencing and machine selection while ignoring the impact of AGV transportation, resulting in suboptimal scheduling solutions and even difficulties in implementation. To address this issue, this paper formulates a cooperative scheduling model by introducing the AGV scheduling problem into the classical FJS scheduling problem, abbreviated as the FJS-AGV problem, with the objective of minimizing the makespan. With respect to the FJS-AGV problem, a heuristic-assisted deep Q-network (HA-DQN) algorithm is proposed, which leverages heuristic rules to enable the decision agent to perform multiple actions at each decision point, which includes determining the responses to the following questions: Which operation should be processed next? On which machine? By which AGV? This decision mechanism enables the agent to make more informed decisions, leading to improved performance and resource allocation in the FJS-AGV system. The practicability of the proposed FJS-AGV model and the efficiency of the HA-DQN algorithm in solving the FJS-AGV problem are verified through various international benchmarks. Specifically, when solving instances in a large benchmark, the HA-DQN algorithm yields a significant 12.63% reduction in makespan compared with that when traditional heuristics are employed.

29 March 2022 in Robotics and Computer-Integrated Manufacturing
Verified
Journal Article
Closed access
GWguangxi wan
guangxi wan
XDXiaoting Dong
Xiaoting Dong
QDQingwei Dong
Qingwei Dong
YHYunpeng He
Yunpeng He
PZPeng Zeng
Peng Zeng

1 January 2024 in Mathematical Biosciences and Engineering
Verified
Journal Article
Open access
PDF file
LWLili Wang
Lili Wang
CSChunhe Song
Chunhe Song
GWguangxi wan
guangxi wan
SCShijie Cui
Shijie Cui
Surface defect detection is of great significance as a tool to ensure the quality of steel pipes. The surface defects of steel pipes are charactered by insufficient texture, high similarity between different types of defects, large size differences, and high proportions of small targets, posing great challenges to defect detection algorithms. To overcome the above issues, we propose a novel steel pipe surface defect detection method based on the YOLO framework. First, for the problem of a low detection rate caused by insufficient texture and high similarity among different types of defects of steel pipes, a new backbone block is proposed. By increasing high-order spatial interaction and enhancing the capture of internal correlations of data features, different feature information for similar defects is extracted, thereby alleviating the false detection rate. Second, to enhance the detection performance for small defects, a new neck block is proposed. By fusing multiple features, the accuracy of steel pipe defect detection is improved. Third, for the problem of a low detection rate causing large size differences in steel pipe surface defects, a novel regression loss function that considers the aspect ratio and scale is proposed, and the focal loss is introduced to further solve the sample imbalance problem in steel pipe defect datasets. The experimental results show that the proposed method can effectively improve the accuracy of steel pipe surface defect detection.

19 July 2021 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
GWguangxi wan
guangxi wan
PZPeng Zeng
Peng Zeng
Design space exploration (DSE) of cyber-physical production systems (CPPS) is a search problem in the space of potential compositional configurations. Current design methodologies follow the separated design paradigm in which the architecture, control, and scheduling are separately designed. Optimization of each part considers only the corresponding goals of interest and overlooks other aspects by adopting gross assumptions, which makes it difficult to determine the global optimal solution for a given system. To address this problem, in this article, we propose a codesign method that considers the design spaces of architecture, control, and scheduling as monolithic, mixed discrete-continuous spaces. We formulate DSE as an optimization problem and propose a generic iterative algorithm schema involving simulation in the loop to solve the abovementioned new problem. To illustrate the effectiveness of the proposed method, a real single-stage reducer assembly production system is considered. The design results demonstrate that our method provides better solutions than does the separated design method.

27 December 2023 in Biomimetics
Verified
Journal Article
Open access
PDF file
XDXiaoting Dong
Xiaoting Dong
GWguangxi wan
guangxi wan
PZPeng Zeng
Peng Zeng
CSChunhe Song
Chunhe Song
SCShijie Cui
Shijie Cui
The robot task sequencing problem and trajectory planning problem are two important issues in the robotic optimization domain and are solved sequentially in two separate levels in traditional studies. This paradigm disregards the potential synergistic impact between the two problems, resulting in a local optimum solution. To address this problem, this paper formulates a co-optimization model that integrates the task sequencing problem and trajectory planning problem into a holistic problem, abbreviated as the robot TSTP problem. To solve the TSTP problem, we model the optimization process as a Markov decision process and propose a deep reinforcement learning (DRL)-based method to facilitate problem solving. To validate the proposed approach, multiple test cases are used to verify the feasibility of the TSTP model and the solving capability of the DRL method. The real-world experimental results demonstrate that the DRL method can achieve a 30.54% energy savings compared to the traditional evolution algorithm, and the computational time required by the proposed DRL method is much shorter than those of the evolutionary algorithms. In addition, when adopting the TSTP model, a 18.22% energy reduction can be achieved compared to using the sequential optimization model.

16 November 2023 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
QDQingwei Dong
Qingwei Dong
PZPeng Zeng
Peng Zeng
GWguangxi wan
guangxi wan
YHYunpeng He
Yunpeng He
XDXiaoting Dong
Xiaoting Dong
Deepreinforcement learning algorithms offer a promising method for industrial robots to tackle unstructured and complex scenarios that are difficult to model. However, due to constraints related to equipment lifespan and safety requirements, acquiring a number of samples directly from the physical environment is often infeasible. With the development of increasingly realistic simulators, it has become feasible for industrial robots to acquire complex motion skills within simulated environments. Nonetheless, the “reality gap” frequently results in performance degradation when transferring policies trained in simulators to physical systems. In this letter, we treat the reality gap between a physical environment (target domain) and a simulated environment (source domain) as a Gaussian perturbation and utilize Kalman filtering to reduce the discrepancy between source and target domain data. We refine the source domain controller using target domain data to enhance the controller's adaptability to the target domain. The efficacy of the proposed method is demonstrated in reaching tasks and peg-in-hole tasks conducted on PR2 and UR5 robotic platforms.