Xing Fu
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Xing Fu has a total of 5 co-authors. Here are the top co-authors by number of shared publications:
- Gongxue Zhang
Shaanxi University of Science and Technology
1 shared publication - Hai Yuan
Guangzhou Institute of Advanced Technology, Guangzhou 511458, China
1 shared publication - Jian Wang
Robotics & Intelligent Equipment Center, Guangzhou Institute of Advanced Technology, Guangzhou 511458, China
1 shared publication - Weijun Wang
Shenzhen Institute of Advanced Technology, Chinese Academy of Sciences
1 shared publication - Zucheng Huang
Guangzhou Institute of Advanced Technology, Guangzhou 511458, China
1 shared publication
Latest Publications
- Open Access
- 9 June 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (12) , 5029
Swiss Round Selection Algorithm for Multi-Robot Task Scheduling
Efficient and stable control and task assignment optimization in electronic commerce logistics and warehousing systems involving multiple robots executing multiple tasks is highly challenging. Hence, this paper proposes a Swiss round selection algorithm for multi-robot task allocation to address the challenges mentioned. Firstly, based on the shipping process of electronic commerce logistics and warehousing systems, the tasks are divided into packaging and sorting stages, and a grid model for the electronic commerce warehousing system is established. Secondly, by increasing the probabilities of crossover and mutation in the population and adopting a full crossover and full mutation approach, the search scope of the population is expanded. Then, a Swiss round selection mechanism with burst probability is proposed, which ensures the smooth inheritance of high-quality individuals while improving the diversity of the population. Finally, 12 comparative experiments are designed with different numbers of robots and tasks. The experimental results demonstrate that the Swiss round selection algorithm outperforms the genetic algorithm in terms of maximum task completion time and convergence time to reach the optimal value. Thus, the effectiveness of the Swiss round selection algorithm in solving the multi-robot task allocation problem is verified.
- 9 June 2024
- Published by MDPI AG in Applied Sciences
- Vol. 14 (12) , 5029
Open AccessSwiss Round Selection Algorithm for Multi-Robot Task Scheduling
Efficient and stable control and task assignment optimization in electronic commerce logistics and warehousing systems involving multiple robots executing multiple tasks is highly challenging. Hence, this paper proposes a Swiss round selection algorithm for multi-robot task allocation to address the challenges mentioned. Firstly, based on the shipping process of electronic commerce logistics and warehousing systems, the tasks are divided into packaging and sorting stages, and a grid model for the electronic commerce warehousing system is established. Secondly, by increasing the probabilities of crossover and mutation in the population and adopting a full crossover and full mutation approach, the search scope of the population is expanded. Then, a Swiss round selection mechanism with burst probability is proposed, which ensures the smooth inheritance of high-quality individuals while improving the diversity of the population. Finally, 12 comparative experiments are designed with different numbers of robots and tasks. The experimental results demonstrate that the Swiss round selection algorithm outperforms the genetic algorithm in terms of maximum task completion time and convergence time to reach the optimal value. Thus, the effectiveness of the Swiss round selection algorithm in solving the multi-robot task allocation problem is verified.