【24h】

Dynamic task allocation for multi-robot search and retrieval tasks

机译:动态任务分配,用于多机器人搜索和检索任务

获取原文
获取原文并翻译 | 示例
           

摘要

Many application domains require search and retrieval, which is also known in the robotic domain as foraging. For example, in a search and rescue domain, a disaster area needs to be explored and transportation of survivors to a safe area needs to be arranged. Performing such a search and retrieval task by more than one robot increases performance if they are able to distribute their workload efficiently and evenly. In this work, we study the Multi-Robot Task Allocation (MRTA) problem in the search and retrieval domain, where a team of robots is required to cooperatively search for targets of interest in an environment and also retrieve them back to a home base. In comparison with typical foraging tasks, we look at a more general search and retrieval task in which the targets are distinguished with various types, and task allocation also requires taking into account temporal constraints on the team goal. As usual, robots have no prior knowledge about the location of targets in the environment but in addition they need to deliver targets to the home base in a specific order according to their types, which significantly increases the complexity of a foraging problem. We first use a graph-based model to analyse the search and retrieval problem and the dynamics of exploration and retrieval within a cooperative team. We then proceed to present an extended auction-based approach, as well as a prediction approach. The essential difference between these two approaches is that the task allocation and execution procedures in the auction approach are running in parallel, whereas a robot in the prediction approach only needs to choose a task to perform when it has no thing to do. The auction approach uses a winner determination mechanism to allocate tasks to each robot, whereas the robots in the prediction approach implicitly coordinate their activities by team reasoning that leads to consensuses about task allocation. We use the Blocks World for Teams (BW4T) simulator to evaluate the two approaches in our experimental study.
机译:许多应用程序领域都需要搜索和检索,这在机器人领域也被称为觅食。例如,在搜索和救援领域,需要探索灾区,并安排将幸存者运送到安全区。如果多个机器人能够高效,均匀地分配工作负载,则执行此类搜索和检索任务可以提高性能。在这项工作中,我们研究了搜索和检索领域中的多机器人任务分配(MRTA)问题,在该问题中,需要一个机器人团队来协作搜索环境中感兴趣的目标,并将它们重新返回到本垒。与典型的觅食任务相比,我们着眼于一种更通用的搜索和检索任务,在该任务中,目标具有各种类型,并且任务分配还需要考虑团队目标的时间限制。像往常一样,机器人没有关于目标在环境中的位置的先验知识,但此外,它们还需要根据其类型以特定顺序将目标运送到家庭基地,这大大增加了觅食问题的复杂性。我们首先使用基于图的模型来分析合作团队中的搜索和检索问题以及探索和检索的动力学。然后,我们继续介绍扩展的基于拍卖的方法以及预测方法。这两种方法之间的本质区别是拍卖方法中的任务分配和执行过程是并行运行的,而预测方法中的机器人只需要选择一项任务即可执行。拍卖方法使用获胜者确定机制将任务分配给每个机器人,而预测方法中的机器人通过团队推理隐式地协调其活动,从而导致就任务分配达成共识。我们使用“ Blocks World for Teams”(BW4T)模拟器来评估我们的实验研究中的两种方法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号