Yongkui Sun

Yongkui Sun

Auto-generated profile, based on publicly available information

Yongkui Sun

School of Electrical Engineering, Southwest Jiaotong University, Chengdu, China

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
8 January 2020 in IEEE Journal of Emerging and Selected Topics in Power Electronics
Verified
Journal Article
Closed access
XLXuan Li
Xuan Li
XTXing Tong
Xing Tong
RHRui Hu
Rui Hu
YWYi Wen
Yi Wen
HZHao Zhu
Hao Zhu
BZBo Zhang
Bo Zhang
Due to superior properties of silicon carbide (SiC), the unipolar conduction mechanism of metal-oxide-semiconductor-field-effect transistor (MOSFET), and the structural feature, double trench SiC MOSFETs have great potential to be one of the next-generation power switches. In this article, an avalanche safe operation area (SOA) is established, and a new failure behavior of 1200-V double trench SiC MOSFET is revealed timely through unclamped inductive switching (UIS) test (300 K of initial temperature). With comprehensive analyses involving terminal impedance measurement, monitoring of V th and I gss before and after each avalanche test, inner electric field comparison by physics-based device modeling, maximum die temperature estimation, and decapsulation validation, the predominant failure mechanism (fracture of trench gate oxide) is identified for double trench SiC MOSFET under UIS test. Before the maximum die temperature approaches the melting point of source metal, the fracture of the SiO 2 layer located at gate trench bottom and corner occurs, which is degraded by duration, excessive electric field, and elevated temperature. Accordingly, we propose I gss as a predicting indicator of avalanche failure, which should be a key monitoring scheme in particular for trench type SiC MOSFET.

7 May 2025 in IEEE Sensors Journal
Verified
Journal Article
Closed access
MZMuhua Zhang
Muhua Zhang
LMLei Ma
Lei Ma
YWYing Wu
Ying Wu
KSKai Shen
Kai Shen
YSYongkui Sun
Yongkui Sun
Henry LeungHenry Leung
Henry Leung
This paper presents an integrated sensing-planning navigation system for mobile robots used in industrial inspection. The system can be directly integrated with real robots. It enables the robot to pass through tight spaces, circumvent unexpected obstacles, and accurately reach the goal pose. This improves the robot’s adaptability to inspection tasks. For obstacle sensing, the system includes an obstacle parameterizer. Static obstacles in global grid map occupancy clusters are convexified. To improve the representation accuracy of the tight space, continuous and angled obstacles are automatically segmented into multiple convex polygons. This avoids inappropriate convex shapes. Unexpected obstacles in local grid maps are first represented by minimum bounding circles (MBCs) to simplify data association. They are then converted into inscribed convex polygons to ensure consistency with static obstacle descriptions. For motion planning, the system utilizes a two-stage planner operating on obstacle convex sets. When the robot is distant from the goal, the nonlinear model predictive control (NMPC) is constrained by inter-convex set discrete-time control barrier functions (DCBF-Convex), termed NMPC-DCBF-Convex, enabling effective navigation in tight spaces and around unexpected obstacles. As the robot nears the goal pose, DCBF-Convex conditions prune the sampling space of dynamic window approach (DWA), termed DWA-DCBF-Convex. It ensures high-frequency control and enables safe and precise arrival at the goal in constrained environments. Experiments in constrained scenarios validate the system’s real-world effectiveness. An inspection robot weighing over 70kg completes challenging navigation tasks at a maximum velocity of 0.5m/s, achieving an empirical terminal positional error of ±0.017m.

5 August 2025 in IEEE Transactions on Industrial Electronics
Verified
Journal Article
Closed access
JLJianfei Lin
Jianfei Lin
LMLei Ma
Lei Ma
DHDeqing Huang
Deqing Huang
YWYanzhi Wu
Yanzhi Wu
YSYongkui Sun
Yongkui Sun
HHHaonan Hao
Haonan Hao
Visual features are often lost during fast servoing due to the limited field of view (FOV) of the camera. In this article, a method for robust fixed-time image-based visual servoing (IBVS) with prescribed performance is proposed to tackle the aforementioned problems. First, a performance function is introduced to preset performance specifications of the image feature errors. This way, the image feature points are kept in the FOV of the camera during the visual servoing process. Next, the implementation of performance constraints on image feature point errors is accomplished using a barrier Lyapunov function (BLF) to improve the steady-state accuracy. Finally, fast stabilization of the system is ensured by the fixed-time Lyapunov stability theorem. The proposed method is implemented for visual servoing of a robotic arm. The experimental results show that the convergence rate is significantly improved compared to the existing methods. The image feature points remain in the FOV of the camera during the fast servoing process, too. Additionally, a bolt visual servoing alignment example study is carried out to demonstrate the applicability of the proposed method in practice.

31 March 2020 in IEEE Access
Verified
Journal Article
Open access
MMMohamed Ahmed Eshag Mohamed
Mohamed Ahmed Eshag Mohamed
LMLei Ma
Lei Ma
YSYongkui Sun
Yongkui Sun
KZKai Zhang
Kai Zhang
YKYong Kui
Yong Kui
In this paper, the dynamics solution problem and the boundary control problem for the Timoshenko beam under uncertainties and exogenous disturbances are addressed. The dynamics of the Timoshenko beam are represented by one non-homogenous hyperbolic partial differential equation (PDE), one homogenous hyperbolic PDE, and three ordinary differential equations (ODEs). The authors suggest a method of lines (MOL) for obtaining the dynamics of the Timoshenko beam in the form of the ODE formula instead of the PDE formula. A global sliding mode boundary control (GSMBC) is designed for vibration reduction of the Timoshenko beam influenced by uncertainties, distributed disturbance, displacement boundary disturbance, and rotation boundary disturbance. Chattering phenomena is avoided by using exponential reaching law reinforced by a relay function. Along the time and position axis: a) the boundary displacements and rotation of the Timoshenko beam converge asymptotically to equilibrium; b) the distributed vibrations on both displacements and rotation axis of the Timoshenko are attenuated; c) influence of the exogenous disturbances and system parameters uncertainties are compensated. By using the Lyapunov direct approach, exponential convergence and robustness of the closed-loop system are guaranteed. Finally, simulations are carried out to show that the proposed GSMBC-based MOL scheme is effective for vanishing the vibrations of the Timoshenko beam under uncertainties and external disturbances.

3 August 2022
Verified
Conference Paper
Closed access
TLTengqian Liu
Tengqian Liu
YSYongkui Sun
Yongkui Sun
WSWeihong Song
Weihong Song
LMLei Ma
Lei Ma
Multi-mowing robots have an advantage over a single robot for a large mowing task. The task allocation of the multi-mowing robots' system needs to solve several problems, such as minimizing mowing time, minimizing duplicate areas, etc. In particular, when one or more mowing robots break down in the multi-mowing robots' system, the uncompleted tasks need to be allocated again. There are two algorithms to accomplish the multi-robot mowing in this paper. One is the multi-mowing robots task allocation(MMRTA) algorithm based on the modified genetic algorithm, the other is the filling rescue algorithm. The task allocation was simulated with 4–32 robots to mow the grass field divided into 64 task blocks. The simulation result shows that the tasks and paths of each mowing robot are approximately equal, and proves that the task allocation algorithm proposed in this paper is feasible and effective. The filling rescue algorithm is simulated with 4 or 8 robots that surround the breakdown robot to complete the unfinished tasks of the breakdown robot. The simulation result testifies that the remaining tasks of the breakdown robot are reasonably and efficiently allocated.