Task allocation plays a vital role in multi-robot autonomous cleaning systems, where multiple robots work together to clean a large area. However, most current studies mainly focus on deterministic, single-task allocation for cleaning robots, without considering hybrid tasks in uncertain working environments. Moreover, there is a lack of datasets and benchmarks for relevant research. In this paper, to address these problems, we formulate multi-robot hybrid-task allocation under the uncertain cleaning environment as a robust optimization problem. Firstly, we propose a novel robust mixed-integer linear programming model with practical constraints including the task order constraint for different tasks and the ability constraints of hybrid robots. Secondly, we establish a dataset of \emph{100} instances made from floor plans, each of which has 2D manually-labeled images and a 3D model. Thirdly, we provide comprehensive results on the collected dataset using three traditional optimization approaches and a deep reinforcement learning-based solver. The evaluation results show that our solution meets the needs of multi-robot cleaning task allocation and the robust solver can protect the system from worst-case scenarios with little additional cost. The benchmark will be available at {https://github.com/iamwangyabin/Multi-robot-Cleaning-Task-Allocation}.
翻译:任务分配在多机器人自主清洁系统中非常重要,多个机器人一起清理大面积区域。然而,大多数当前研究主要关注确定性的单一任务分配,而不考虑在不确定的工作环境下进行混合任务。此外,相关研究缺乏相关数据集和基准。为了解决这些问题,本文将多机器人混合任务分配在不确定的清洁环境下作为鲁棒优化问题进行了建模,提出了一种新的鲁棒混合整数线性规划模型,考虑了不同任务的任务顺序约束和混合机器人的能力约束等实际限制条件,在此基础上建立了一个包含100个场景的数据集,每个场景都有2D手动标记的图像和3D模型。我们使用三种传统的优化方法和一个基于深度强化学习的求解器对收集到的数据集进行了全面的结果评估。评估结果表明,我们的解决方案满足多机器人清洁任务分配的需求,鲁棒求解器可以保护系统免受最坏情况的影响,而成本很小。基准将在 {https://github.com/iamwangyabin/Multi-robot-Cleaning-Task-Allocation} 上公布。