Jialiang Hou

Jialiang Hou

Auto-generated profile, based on publicly available information

Jialiang Hou

Zhejiang University

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
15 July 2022 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
JHJialiang Hou
Jialiang Hou
XZXin Zhou
Xin Zhou
ZGZhongxue Gan
Zhongxue Gan
Fei GaoFei Gao
Fei Gao
Designing autonomous aerial robot team systems remains a grand challenge in robotics. Existing works in this field can be categorized as centralized and decentralized. Centralized methods suffer from scale dilemmas, while decentralized ones often lead to poor planning quality. In this paper, we propose an enhanced decentralized autonomous aerial robot team system with group planning. According to the spatial distribution of agents, the system dynamically divides the team into several groups and isolated agents. For conflicts within each group, we propose a novel coordination mechanism named group planning. The group planning consists of efficient multi-agent pathfinding (MAPF) and trajectory joint optimization, which can significantly improve planning quality and success rate. We demonstrate through simulations and real-world experiments that our method not only has applicability for a large-scale team but also has top-level planning quality.

26 May 2025 in IEEE Transactions on Robotics
Verified
Journal Article
Closed access
JHJialiang Hou
Jialiang Hou
XZXin Zhou
Xin Zhou
NPNeng Pan
Neng Pan
ALAng Li
Ang Li
YGYuxiang Guan
Yuxiang Guan
Fei GaoFei Gao
Fei Gao
Achieving large-scale aerial swarms is challenging due to the inherent contradictions in balancing computational efficiency and scalability. This paper introduces Primitive-Swarm, an ultra-lightweight and scalable planner designed specifically for large-scale autonomous aerial swarms. The proposed approach adopts a decentralized and asynchronous replanning strategy. Within it is a novel motion primitive library consisting of time-optimal and dynamically feasible trajectories. They are generated utlizing a novel time-optimial path parameterization algorithm based on reachability analysis (TOPP-RA). Then, a rapid collision checking mechanism is developed by associating the motion primitives with the discrete surrounding space according to conflicts. By considering both spatial and temporal conflicts, the mechanism handles robot-obstacle and robot-robot collisions simultaneously. Then, during a replanning process, each robot selects the safe and minimum cost trajectory from the library based on user-defined requirements. Both the time-optimal motion primitive library and the occupancy information are computed offline, turning a time-consuming optimization problem into a linear-complexity selection problem. This enables the planner to comprehensively explore the non-convex, discontinuous 3-D safe space filled with numerous obstacles and robots, effectively identifying the best hidden path. Benchmark comparisons demonstrate that our method achieves the shortest flight time and traveled distance with a computation time of less than 1 ms in dense environments. Super large-scale swarm simulations, involving up to 1000 robots, running in real-time, verify the scalability of our method. Real-world experiments validate the feasibility and robustness of our approach. The code will be released to foster community collaboration.

8 May 2026 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
RZRuibin Zhang
Ruibin Zhang
JHJialiang Hou
Jialiang Hou
Fei GaoFei Gao
Fei Gao
Accurate and robust environmental perception is crucial for robot autonomous navigation. While current methods typically adopt optical sensors, such as cameras and LiDARs, as primary sensing modalities, their susceptibility to visual occlusion—such as dirt adhering to the lens or physical blockage of the sensor—often leads to degraded performance or complete system failure. In this paper, we focus on agricultural scenarios where robots are exposed to the risk of onboard sensor contamination. Leveraging radar’s strong penetration capability, we introduce a radar-based 3D environmental perception framework as a viable alternative. It comprises three core modules designed for dense and accurate semantic perception: first, parallel frame accumulation to enhance signal-to-noise ratio of raw radar data; second, a diffusion model-based hierarchical learning framework that first filters radar sidelobe artifacts then generates fine-grained 3D semantic point clouds; and third, a specifically designed sparse 3D network optimized for processing large-scale raw radar data. We conducted extensive benchmark comparisons and experimental evaluations on a self-built dataset collected in real-world agricultural field scenes. Results demonstrate that our method achieves superior structural and semantic prediction performance compared to existing methods, while simultaneously reducing computational and memory costs by 44.3% and 27.5%, respectively. Furthermore, our approach achieves complete reconstruction and accurate classification of thin structures such as poles and wires—which existing methods struggle to perceive—highlighting its potential for dense and accurate 3D radar perception.

1 January 2026 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
ZLZhitao Liu
Zhitao Liu
GXGuangtong Xu
Guangtong Xu
ZWZihan Wang
Zihan Wang
JHJialiang Hou
Jialiang Hou
CXChao Xu
Chao Xu
Fei GaoFei Gao
Fei Gao

1 January 2026 in IEEE Transactions on Automation Science and Engineering
Verified
Journal Article
Closed access
YZYuan Zhou
Yuan Zhou
GXGuangtong Xu
Guangtong Xu
XJXiaoqiang Ji
Xiaoqiang Ji
YTYuqing Tang
Yuqing Tang
JHJialiang Hou
Jialiang Hou
Fei GaoFei Gao
Fei Gao

3 November 2026 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
AZAnke Zhao
Anke Zhao
YZYuhang Zhong
Yuhang Zhong
KHKenghou Hoi
Kenghou Hoi
JMJunyu Mou
Junyu Mou
JWJunjie Wang
Junjie Wang
Fei GaoFei Gao
Fei Gao