通过空间划分、运动规则和自适应集中式冲突解决确保多移动机器人的进度
Ensuring Progress for Multiple Mobile Robots via Space Partitioning, Motion Rules, and Adaptively Centralized Conflict Resolution
摘要:
在多个机器人必须在共享空间中协调的环境中,分散式方法允许以全局保证为代价进行解耦规划,而集中式方法则进行相反的权衡。这些解决方案做出了一系列假设-通常,所有机器人共享相同的规划策略。在这项工作中,我们提出了一个框架,确保所有机器人的进展,而不假设任何机器人的规划策略(1)生成一个分区的环境到“流”,“开放”和“通道”区域和(2)强加一套规则,机器人运动在这些地区。这些机器人运动规则通过自适应集中式协议来解决机器人之间的空间冲突,从而防止死锁。我们提出的框架,确保所有机器人的进步,没有一个网格样的离散化的环境或机器人通信,协调或合作的强烈要求。每个机器人都可以自由选择如何规划和协调自己,而不会受到其他机器人或机器人组的阻碍,只要他们在必要时遵守规则。我们描述了我们的空间划分和运动规则,证明了运动规则足以保证在分区环境中的进展,并在模拟多边形环境中演示了几种情况。这项工作取得了平衡之间的每个机器人的规划独立性和保证每个机器人总是可以达到任何目标在有限的时间。
英文摘要:
In environments where multiple robots must coordinate in a shared space, decentralized approaches allow for decoupled planning at the cost of global guarantees, while centralized approaches make the opposite trade-off. These solutions make a range of assumptions - commonly, that all the robots share the same planning strategies. In this work, we present a framework that ensures progress for all robots without assumptions on any robot's planning strategy by (1) generating a partition of the environment into "flow", "open", and "passage" regions and (2) imposing a set of rules for robot motion in these regions. These rules for robot motion prevent deadlock through an adaptively centralized protocol for resolving spatial conflicts between robots. Our proposed framework ensures progress for all robots without a grid-like discretization of the environment or strong requirements on robot communication, coordination, or cooperation. Each robot can freely choose how to plan and coordinate for itself, without being vulnerable to other robots or groups of robots blocking them from their goals, as long as they follow the rules when necessary. We describe our space partition and motion rules, prove that the motion rules suffice to guarantee progress in partitioned environments, and demonstrate several cases in simulated polygonal environments. This work strikes a balance between each robot's planning independence and a guarantee that each robot can always reach any goal in finite time.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。