Qi Zhang

Qi Zhang

Auto-generated profile, based on publicly available information

Qi Zhang

Southeast University, Nanjing, China

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
10 August 2022 in IEEE Transactions on Services Computing
Verified
Journal Article
Closed access
QZQi Zhang
Qi Zhang
YWYingjie Wang
Yingjie Wang
GYGuisheng Yin
Guisheng Yin
XTXiangrong Tong
Xiangrong Tong
ASAkshita Maradapu Vera Venkata Sai
Akshita Maradapu Vera Venkata Sai
ZCZhipeng Cai
Zhipeng Cai
With the advent of intelligent technology, the users of spatio-temporal crowdsourcing and their participation in the crowdsourcing tasks continue to increase exponentially. This poses new challenges to the crowdsourcing field. One of the core research areas of spatio-temporal crowdsourcing is task assignment. Most of the existing research on task assignment is focused on offline optimal task assignment, where, the platform has already learned all the information about workers and tasks beforehand. However, these studies cannot obtain good results in real-world situations. At the same time, online task assignment problems often result in local optimal assignment. To solve these problems, more attention needs to be paid to online task assignments and the arrival time of workers. This paper proposes an Online Bilateral Assignment (OBA) problem based on the online assignment model. The competitive ratio of the Greedy algorithm is analyzed according to the OBA problem model. Also, another solution to the OBA problem according to the Greedy algorithm, the Improved-Baseline algorithm, is proposed. Additionally, a Bilateral Online Priority Reassignment algorithm (BOPR) is proposed. The BOPR algorithm realizes real-time task/worker assignment through the bilateral assignment as a solution for online task assignment. In order to guarantee the number of matching tasks, a priority queue is designed in the BOPR algorithm. Considering the waiting time deadlines of tasks and workers and the error rate for priority ranking, it avoids tasks and workers waiting too long and assigns each task to the best possible extent. On this basis, a two-stage assignment strategy is designed for unsuccessful tasks, which could minimize the error rate of the task and significantly improve the efficiency of task assignment. Finally, through experiments on real data sets, the algorithm's performance in terms of global utility value and the number of matches is evaluated.

1 August 2022 in Digital Communications and Networks
Verified
Journal Article
Open access
QZQi Zhang
Qi Zhang
YWYingjie Wang
Yingjie Wang
ZCZhipeng Cai
Zhipeng Cai
XTXiangrong Tong
Xiangrong Tong


1 January 2026 in IEEE Transactions on Industrial Informatics
Verified
Journal Article
Closed access
QZQi Zhang
Qi Zhang
KXKaiwen Xia
Kaiwen Xia
XZXinrui Zhang
Xinrui Zhang
CWChuxian Wang
Chuxian Wang
LLLi Lin
Li Lin
THTian He
Tian He

20 April 2026
Verified
Conference Paper
Open access
KXKaiwen Xia
Kaiwen Xia
LLLi Lin
Li Lin
QZQi Zhang
Qi Zhang
XZXinrui Zhang
Xinrui Zhang
SWShuai Wang
Shuai Wang
PYPhilip S. Yu
Philip S. Yu
Spatio-temporal data is extensively collected in ubiquitous cyber-physical systems, where modeling complex spatio-temporal dependencies using Spatio-Temporal Graph (STG) is crucial for downstream decision-making tasks. However, these tasks often necessitate that STG methods adapt to the coupling between varying spatial granularity and continuous temporal evolution, leading to certain limitations in the scalability and dynamic continuous-time modeling capabilities of existing methods. To this end, we propose a C ontinuous spatio-temporal graph learning framework with S calable S patial G ranularity (CSSG). This framework establishes the coupling between scalable spatial granularity and continuous temporal evolution through anchor set-based spatial modeling and local conservation-based temporal modeling. Specifically, CSSG first derives the initial node spatio-temporal embeddings using a spatio-temporal encoding module that takes scalable spatial embeddings based on anchor sets as input. Then, a bidirectional differential edge aggregation module dynamically updates the continuous interaction weights of edges based on local conservation. Finally, a spatio-temporal adaptive fusion module integrates continuous change patterns of bidirectional edges into a unified node representation, generating initial node states for the decoder to infer future states. Extensive experiments on various real-world datasets verify the scalability and effectiveness of CSSG in continuous spatio-temporal prediction for varying spatial granularities, while also demonstrating greater efficiency compared to state-of-the-art solutions with comparable performance. The source code, data have been made available at https://github.com/kaiwxai/CSSG.