Huaiyang Huang

Huaiyang Huang

Auto-generated profile, based on publicly available information

Huaiyang Huang

Department of Electronic and Computer Engineering, Robotics and Multi-Perception Laboratory, The Hong Kong University of Science and Technology, Sai Kung, New Territories, Hong Kong

Research Focus & Metrics

Academic Career Length

8Years (2019-Present)

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

Representative Publications

View All Publications
16 July 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
PCPeide Cai
Peide Cai
HWHengli Wang
Hengli Wang
HHHuaiyang Huang
Huaiyang Huang
YLYuxuan Liu
Yuxuan Liu
MLMing Liu
Ming Liu
Autonomous car racing is a challenging task in the robotic control area. Traditional modular methods require accurate mapping, localization and planning, which makes them computationally inefficient and sensitive to environmental changes. Recently, deep-learning-based end-to-end systems have shown promising results for autonomous driving/racing. However, they are commonly implemented by supervised imitation learning (IL), which suffers from the distribution mismatch problem, or by reinforcement learning (RL), which requires a huge amount of risky interaction data. In this work, we present a general deep imitative reinforcement learning approach (DIRL), which successfully achieves agile autonomous racing using visual inputs. The driving knowledge is acquired from both IL and model-based RL, where the agent can learn from human teachers as well as perform self-improvement by safely interacting with an offline world model. We validate our algorithm both in a high-fidelity driving simulation and on a real-world 1/20-scale RC-car with limited onboard computation. The evaluation results demonstrate that our method outperforms previous IL and RL methods in terms of sample efficiency and task performance. Demonstration videos are available at https://caipeide.github.io/autorace-dirl/.

29 January 2021 in IEEE Robotics & Automation Magazine
Verified
Journal Article
Closed access
TLTianyu Liu
Tianyu Liu
QLQing Hai Liao
Qing Hai Liao
LGLu Gan
Lu Gan
FMFulong Ma
Fulong Ma
JCJie Cheng
Jie Cheng
MLMing Liu
Ming Liu

18 March 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
RFRui Fan
Rui Fan
HWHengli Wang
Hengli Wang
BXBohuan Xue
Bohuan Xue
HHHuaiyang Huang
Huaiyang Huang
YWYuan Wang
Yuan Wang
IPIoannis Pitas
Ioannis Pitas
This paper proposes three-filters-to-normal (3F2N), an accurate and ultrafast surface normal estimator (SNE), which is designed for structured range sensor data, e.g., depth/disparity images. 3F2N SNE computes surface normals by simply performing three filtering operations (two image gradient filters in horizontal and vertical directions, respectively, and a mean/median filter) on an inverse depth image or a disparity image (due to that disparity is in inverse proportion to depth). Despite the simplicity of 3F2N SNE, no similar method already exists in the literature. To evaluate the performance of our proposed SNE, we created three large-scale synthetic datasets (easy, medium and hard) using 24 3D mesh models, each of which is used to generate 1800--2500 pairs of depth images (resolution: 480x640 pixels) and the corresponding surface normal ground truth from different views. 3F2N SNE demonstrates the state-of-the-art performance, outperforming all other existing geometry-based SNEs, where the average angular errors with respect to the easy, medium and hard datasets are 1.6 degrees, 5.6 degrees and 15.3 degrees, respectively. Furthermore, our C++ and CUDA implementations achieve a processing speed of over 260 Hz and 21 kHz, respectively. We have also contributed our source code to the OpenCV repository. Our datasets and source code are publicly available at: sites.google.com/view/3f2n.

18 August 2021 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
HHHuaiyang Huang
Huaiyang Huang
YSYuxiang Sun
Yuxiang Sun
Jin WuJin Wu
Jin Wu
JJJianhao Jiao
Jianhao Jiao
XHXiangcheng Hu
Xiangcheng Hu
MLMing Liu
Ming Liu
Multiview registration is used to estimate Rigid Body Transformations (RBTs) from multiple frames and reconstruct a scene with corresponding scans. Despite the success of pairwise registration and pose synchronization, the concept of Bundle Adjustment (BA) has been proven to better maintain global consistency. So in this work, we make the multiview point-cloud registration more tractable from a different perspective in resolving range-based BA. We first analyse the optimal condition of the objective function of BA that unifies some previous approaches. Based on this analysis, we propose an objective function that takes both measurement noises and computational cost into account. For the feature parameter update, instead of calculating the global distribution parameters from the raw measurements, we aggregate the local distributions in a frame-wise fashion at each iteration. The computational cost of feature update is then only dependent on the number of scans. Finally, we develop a multiview registration system using voxel-based quantization that can be applied in real-world scenarios. The experimental results demonstrate our superiority over the baselines in terms of both accuracy and speed. Moreover, the results also show that our average positioning errors achieve the centimeter level. Related materials are available at our project page https://hyhuang1995.github.io/bareg/.

25 June 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
HHHuaiyang Huang
Huaiyang Huang
HYHaoyang Ye
Haoyang Ye
YSYuxiang Sun
Yuxiang Sun
MLMing Liu
Ming Liu
Incorporating prior structure information into the visual state estimation could generally improve the localization performance. In this letter, we aim to address the paradox between accuracy and efficiency in coupling visual factors with structure constraints. To this end, we present a cross-modality method that tracks a camera in a prior map modelled by the Gaussian Mixture Model (GMM). With the pose estimated by the front-end initially, the local visual observations and map components are associated efficiently, and the visual structure from the triangulation is refined simultaneously. By introducing the hybrid structure factors into the joint optimization, the camera poses are bundle-adjusted with the local visual structure. By evaluating our complete system, namely GMMLoc, on the public dataset, we show how our system can provide a centimeter-level localization accuracy with only trivial computational overhead. In addition, the comparative studies with the state-of-the-art vision-dominant state estimators demonstrate the competitive performance of our method.

28 December 2020 in IEEE Robotics and Automation Letters
Verified
Journal Article
Closed access
YSYuxiang Sun
Yuxiang Sun
WZWeixun Zuo
Weixun Zuo
HHHuaiyang Huang
Huaiyang Huang
PCPeide Cai
Peide Cai
MLMing Liu
Ming Liu
Moving-obstacle segmentation is an essential capability for autonomous driving. For example, it can serve as a fundamental component for motion planning in dynamic traffic environments. Most of the current 3-D Lidar-based methods use road segmentation to find obstacles, and then employ ego-motion compensation to distinguish the static or moving states of the obstacles. However, when there is a slope on a road, the widely-used flat-road assumption for road segmentation may be violated. Moreover, due to the signal attenuation, GPS-based ego-motion compensation is often unreliable in urban environments. To provide a solution to these issues, this letter proposes an end-to-end sparse tensor-based deep neural network for moving-obstacle segmentation without using GPS or the planar-road assumption. The input to our network are merely two consecutive (previous and current) point clouds, and the output is directly the point-wise mask for moving obstacles on the current frame. We train and evaluate our network on the public nuScenes dataset. The experimental results confirm the effectiveness of our network and the superiority over the baselines.