Zhong-Hou Cai

Zhong-Hou Cai

Auto-generated profile, based on publicly available information

Zhong-Hou Cai

Zhejiang University

Research Focus & Metrics

Academic Career Length

6Years (2021-Present)

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

Representative Publications

View All Publications
22 April 2021 in Mathematical Problems in Engineering
Verified
Journal Article
Open access
PDF file
ZZZhiXian Zhong
ZhiXian Zhong
YDYijian Duan
Yijian Duan
ZCZhonghou Cai
Zhonghou Cai
ZZZhiXian Zhong
ZhiXian Zhong
This paper presents a twelve-pole heteropolar radial hybrid magnetic bearing (HRHMB) structure. Firstly, the structure and equivalent magnetic circuit (EMC) are designed. And the radial electromagnetic force characteristics are calculated by the EMC model. At the same time, the rationality of EMC model is verified by the finite-element method (FEM) of Magnet software. Then, the 2-D model of the twelve-pole HRHMB is established in Magnet software. The flux density variations of twelve-pole HRHMB and eight-pole HRHMB under different currents are compared by using the FEM. Finally, a method of Magnet-Simulink cosimulation is proposed to analyze the suspension characteristics of the twelve-pole HRHMB and compared with the eight-pole HRHMB. Thus, the effective combination of theoretical analysis, FEM analysis, and Magnet-Simulink cosimulation analysis is realized in the design of HRHMB. The results of Magnet-Simulink cosimulation show that the twelve-pole HRHMB has the advantages of low power consumption, small coupling, large construction dynamic stiffness, and better suspension characteristics than the eight-pole HRHMB.

1 October 2026 in IEEE Transactions on Vehicular Technology
Verified
Journal Article
Closed access
ZCZhonghou Cai
Zhonghou Cai
JYJiaqiang Yang
Jiaqiang Yang
YJYunHao Jin
YunHao Jin
WWWeiang Wang
Weiang Wang
Existing path planning methods often prioritize geometric shortest paths while lacking explicit control over safety margins, which may lead to unreliable navigation in complex environments. To address this issue, this paper proposes a Safety Margin Controllable Path Planning (SMCPP) framework. The key idea of SMCPP is to propagate safety constraints throughout the entire planning pipeline, ensuring that safety requirements are consistently maintained during search, path point filtering, and path smoothing. Unlike conventional planners that enforce safety through obstacle inflation after path generation, SMCPP integrates safety awareness directly into all planning stages and preserves it throughout the pipeline, rather than treating planning stages as independent modules. Extensive experiments demonstrate that SMCPP produces paths with larger obstacle clearance and smoother paths while achieving reliable navigation performance, particularly in narrow and cluttered environments. These results indicate that maintaining consistent safety constraints during planning significantly improves navigation robustness. Overall, SMCPP provides a practical and effective framework for safe and smooth autonomous navigation in complex environments.

1 September 2025 in IAES International Journal of Robotics and Automation (IJRA)
Verified
Journal Article
Open access
PDF file
YSYe-Ming Shen
Ye-Ming Shen
MKMin Kang
Min Kang
JYJiaqiang Yang
Jiaqiang Yang
ZCZhong-Hou Cai
Zhong-Hou Cai
Robot localization is a foundational technology for autonomous navigation, enabling task execution and adaptation to dynamic environments. However, failure to return to the correct pose after power loss or sudden displacement (the “kidnapping” problem) can lead to critical system failures. Existing methods often suffer from slow relocalization, high computational cost, and poor robustness to dynamic obstacles. We propose a novel inertial measurement unit (IMU)-LiDAR fusion relocalization framework based on Gaussian historical constraints and adaptive likelihood field matching. By incorporating IMU-derived yaw constraints and modeling historical poses within a 3σ Gaussian region, our method effectively narrows the LiDAR search space. Curvature and normal vector-based feature extraction reduces point cloud volume by 50–70%, while dynamic obstacle filtering via multi-frame differencing and neighborhood validation enhances robustness. An adaptive spiral search strategy further refines pose estimation. Compared to ORB-SLAM3 and adaptive Monte Carlo localization (AMCL), our method maintains comparable accuracy while significantly reducing relocalization time and CPU usage. Experimental results show a relocalization success rate of 84%, average time of 1.68 seconds, and CPU usage of 38.4%, demonstrating high efficiency and robustness in dynamic environments.