版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Tianjin Univ Sch Elect & Informat Engn Tianjin 300072 Peoples R China
出 版 物:《IEEE TRANSACTIONS ON INDUSTRIAL ELECTRONICS》 (IEEE Trans Ind Electron)
年 卷 期:2024年第71卷第12期
页 面:16098-16107页
核心收录:
学科分类:0808[工学-电气工程] 08[工学] 0804[工学-仪器科学与技术] 0811[工学-控制科学与工程]
基 金:National Natural Science Foundation of China [62273249, 62103417, 61903349] Diversified Investment Fund of Tianjin [21JCQNJC00800]
主 题:Distributed task allocation multitask Voronoi partition multirobot systems
摘 要:This article proposes a distributed bundle algorithm for task allocation problems for multirobot systems. Specifically, in the developed formulation of the vehicle routing problem with time windows (VRPTW), the robots are assigned to dispatch necessities for the survivors. The utility of each robot is evaluated by the preference index, composed of the distance cost and the task reward. Considering the requirements of the distributed structure and real-time computing, we propose the weighted buffered Voronoi partition-based bundle algorithm. The proposed algorithm dynamically updates the weighted buffered Voronoi partition (WBVP) and calculates the bundle construction once the subtask set changes. The former divides the task area into several disjoint partitions, and the latter ensures that the robot determines the scheduling for tasks according to its preference. Finally, experiment results are presented to demonstrate the effectiveness and feasibility of the proposed distributed framework.