Haoyu Wang

Haoyu Wang

Auto-generated profile, based on publicly available information

Haoyu Wang

Alibaba Cloud Computing, Hangzhou, 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
25 May 2020 in IEEE Transactions on Mobile Computing
Verified
Journal Article
Closed access
HWHaoyu Wang
Haoyu Wang
wei gongwei gong
wei gong
Wireless tracing technologies have seen great potentials in many applications, including drawing and writing, gesture-based commanding, and gaming. Many state-of-the-art systems have recently been proposed along this line. However, none of them can strike a balance among hardware complexity, time delay, and accuracy in real-world scenarios. In this paper, we propose RF-Pen, a practical and complete RFID tracking system that achieves centimeter-level real-time tracing with 4 antennas. To do so, RF-Pen mainly employs two key designs, namely selective hologram and hybrid voting. Our selective hologram places antennas in large separation, which not only expedites the tracking process by producing a handful of good-quality candidate points but also maximizes tracing resolution. Nevertheless, a big challenge is ambiguity. To address this, we introduce hybrid voting that effectively integrates RSSI and phase measurements to evaluate the likelihood of all candidate points. This way, a precise initial position and fine-resolution tracing beams are located. We implement RF-Pen using off-the-shelf readers and tags and compare it against state-of-the-art systems. Results show that with a single reader of 4 antennas, RF-pen achieves a median trajectory error of 2.15 cm and a median position error of 12.8 cm, which are $3.7\times$ and $4.1\times$ better than RF-IDraw, respectively.

18 January 2024 in IEEE/ACM Transactions on Networking
Verified
Journal Article
Closed access
wei gongwei gong
wei gong
HWHaoyu Wang
Haoyu Wang
SLSiyi Li
Siyi Li
SCSi Chen
Si Chen
This paper presents GLAC, the first 3D localization system that enables millimeter-level object manipulation for robotics using only COTS RFID devices. The key insight of GLAC is that mobility reduces ambiguity (One-to-many mapping relationship between phase and distance) and thus improves accuracy. Unlike state-of-the-art systems that require extra time or hardware to boost performance, it draws the power of modeling mobility in a delicate way. In particular, we build a novel framework for real-time tracking using the Hidden Markov Model (HMM). In our framework, multiple Kalman filters are designed to take a single phase observation for updating mobility states, and a fast inference algorithm is proposed to efficiently process an exponentially large number of candidate trajectories. We prototype GLAC with only UHF tags and a commercial reader of four antennas. Comprehensive experiments show that the median position accuracies of x/y/z dimensions are within 1 cm for both LoS and NLoS cases. The median position accuracy for slow-moving targets is 0.41 cm, which is 2.2 $\times$ , 17.3 $\times$ , and 14.9 $\times$ better than TurboTrack, Tagoram, and RF-IDraw, respectively. Also, its median velocity accuracy is at least 20 $\times$ better than all three competitors for fast-moving targets. Besides accuracy, it achieves more than 4 $\times$ localization time gains over state-of-the-art systems.

3 May 2023 in The VLDB Journal
Verified
Journal Article
Closed access
PDF file
HWHaoyu Wang
Haoyu Wang
AZAoqian Zhang
Aoqian Zhang
SSShaoxu Song
Shaoxu Song
JWJianmin Wang
Jianmin Wang

24 August 2024
Verified
Conference Paper
Open access
HWHaoyu Wang
Haoyu Wang
HGHongke Guo
Hongke Guo
ZZZhaoliang Zhu
Zhaoliang Zhu
YZYou Zhang
You Zhang
YZYu Zhou
Yu Zhou
XZXudong Zheng
Xudong Zheng
Seasonal-trend decomposition (STD) is a crucial task in time series data analysis. Due to the challenges of scalability, there is a pressing need for an ultra-fast online algorithm. However, existing algorithms either fail to handle long-period time series (such as OnlineSTL), or need time-consuming iterative processes (such as OneShotSTL). Therefore, we propose BacktrackSTL, the first non-iterative online STD algorithm with period-independent O(1) update complexity. It is also robust to outlier, seasonality shift and trend jump because of the combination of outlier-resilient smoothing, non-local seasonal filtering and backtrack technique. Experimentally, BacktrackSTL decomposes a value within 1.6 μs, which is 15X faster than the state-of-the-art online algorithm OneShotSTL, while maintaining comparable accuracy to the best offline algorithm RobustSTL. We have also deployed BacktrackSTL on the top of Apache Flink to decompose monitoring metrics in Alibaba Cloud for over a year. Besides, we have open-sourced the artifact of this proposal on GitHub.

8 August 2026
Verified
Conference Paper
Open access
HWHaoyu Wang
Haoyu Wang
WMWenxuan Ma
Wenxuan Ma
BHBing Hu
Bing Hu
HLHaozhe Li
Haozhe Li
QSQingqian Si
Qingqian Si
XZXudong Zheng
Xudong Zheng