Qiuyang Fang

Qiuyang Fang

Auto-generated profile, based on publicly available information

Qiuyang Fang

College of Artificial Intelligence, Nankai University, Tianjin, China

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
1 July 2021 in IEEE Transactions on Instrumentation and Measurement
Verified
Journal Article
Closed access
SGShouping Guan
Shouping Guan
QFQiuyang Fang
Qiuyang Fang
TGTianyi Guan
Tianyi Guan
Evaluating the quality of environments within greenhouses has been an important aspect of greenhouse agriculture. However, the existing greenhouse monitoring systems are generally unable to evaluate the quality of greenhouse environments, and at present, it is evaluated manually, which leads to the failure of timely and effective evaluation. Therefore, how to evaluate the greenhouse environment quality accurately, quickly, and automatically is an urgent issue to be tackled. Inspired by the optimization algorithm, clustering algorithm, and probabilistic neural network (PNN), this article proposes the application of a novel PNN evaluation algorithm to a decentralized greenhouse monitoring system to evaluate the environment quality in real time. First, the original training samples are clustered by an improved K-means clustering algorithm (called K-means- α), and the training samples near the cluster centroids are used as new ones to establish the PNN structure. Then, the particle swarm optimization (PSO) algorithm (whereby the fitness function is defined as the PNN's classification error rate on the test samples) is used to iteratively optimize smoothing factors adopted by different classes of pattern units in the PNN. The optimized PNN is finally obtained (called α-PSO-M-PNN). The experimental results demonstrate that compared with conventional PNN-based algorithms, the optimized PNN algorithm has the advantages of a simpler network structure, higher classification accuracy, and requiring fewer training samples. In addition, it is more suitable for the microprocessor-based monitoring system because its computational and storage requirements are within the limits of the microprocessor.

26 June 2024 in IEEE Transactions on Intelligent Vehicles
Verified
Journal Article
Closed access
QFQiuyang Fang
Qiuyang Fang
JZJianlei Zhang
Jianlei Zhang
Chen WangChen Wang
Chen Wang
And Guangming XieAnd Guangming Xie
And Guangming Xie
CZChunyan Zhang
Chunyan Zhang
In this study, we introduce a novel auction-based algorithm modeled as a decentralized coalition formation game, designed for the complex requirements of large-scale multi-robot task allocation under uncertain demand. This context is particularly illustrative in scenarios where robots are tasked to charge electric vehicles. The algorithm begins by partitioning a composite task sequence into distinct subsets based on spatial similarity principles. Subsequently, we employ a coalition formation game paradigm to coordinate the assembly of robots into cooperative coalitions focused on these distinct subsets. To mitigate the impact of unpredictable task demands on allocations, our approach utilizes the conditional value-at-risk to assess the risk associated with task execution, along with computing the potential revenue of the coalition with an emphasis on risk-related outcomes. Additionally, integrating consensus auctions into the coalition formation framework allows our approach to accommodate assignments for individual robot-task pairings, thus preserving the stability of individual robotic decision autonomy within the coalition structure and assignment distribution. Simulative analyses on a prototypical parking facility layout confirm that our algorithm achieves Nash equilibrium within the coalition structure in polynomial time and demonstrates significant scalability. Compared to competing algorithms, our proposal exhibits superior performance in resilience, task execution efficiency, and reduced overall task completion times. The results demonstrate that our approach is an effective strategy for solving the scheduling challenges encountered by multi-robot systems operating in complex environments.

5 November 2025 in Applied Energy
Verified
Journal Article
Closed access
QFQiuyang Fang
Qiuyang Fang
CZChunyan Zhang
Chunyan Zhang
Chen WangChen Wang
Chen Wang
And Guangming XieAnd Guangming Xie
And Guangming Xie
JZJianlei Zhang
Jianlei Zhang

23 October 2025 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
YLYulin Li
Yulin Li
CZChunyan Zhang
Chunyan Zhang
QFQiuyang Fang
Qiuyang Fang
Xudong ZhaoXudong Zhao
Xudong Zhao
JZJianlei Zhang
Jianlei Zhang
Multi-robot systems provide an effective solution for executing complex tasks in dynamic environments; however, achieving efficient task allocation–optimizing the division of labor among robots for satisfactory performance–poses a significant challenge. This study introduces a prediction-based dual-stage distributed task allocation (PDTA) method for distributed multi-robot systems, with a particular focus on search and rescue (SAR) scenarios. In the first stage, the method utilizes a performance impact algorithm framework to generate an initial solution. It incorporates a task bid prediction mechanism during the task removal process to reduce invalid bids and expedite the convergence rate of the algorithm. The cost function also integrates task deadlines, enabling robots to allocate time more effectively and complete additional tasks within fuel constraints. In the second stage, a local search mechanism refines the initial solution to improve the quality of task allocation and the number of completed tasks. Monte Carlo simulations in SAR scenarios, considering task deadlines and fuel limitations, validate the effectiveness of this approach. The results demonstrate significant advantages over existing distributed task allocation methods, particularly in iteration efficiency and the number of rescued survivors.

20 January 2026 in Neural Computing and Applications
Verified
Journal Article
Closed access
PDF file
HHHaohong Huang
Haohong Huang
SGShouping Guan
Shouping Guan
QFQiuyang Fang
Qiuyang Fang