基于中轴的卵石图嵌入多机器人路径规划
Multi-Robot Path Planning Using Medial-Axis-Based Pebble-Graph Embedding
摘要:
提出了一种集中式算法,用于在具有多边形边界的连续平面工作空间中进行标记的圆盘形多机器人路径规划。我们的方法自动将连续问题转换为离散的,基于图形的变量,称为卵石运动问题,可以有效地解决。为了构建底层卵石图,我们通过中轴变换识别工作空间中的内切圆,并将机器人组织到每个内切圆内的层中。我们表明,我们的分层卵石图使无碰撞运动,允许所有图形限制MPP实例是可行的。具有连续开始和目标位置的MPP实例然后可以通过局部导航来解决,该局部导航将机器人从图形顶点路由到图形顶点。我们测试了我们的方法在几个环境中的高机器人包装密度(高达$61.6\%$的工作空间)。对于狭窄通道的环境,这种密度违反了最先进的MPP规划者所做的良好分离的假设,而我们的方法实现了$83\%$的平均成功率。
英文摘要:
We present a centralized algorithm for labeled, disk-shaped Multi-Robot Path Planning (MPP) in a continuous planar workspace with polygonal boundaries. Our method automatically transform the continuous problem into a discrete, graph-based variant termed the pebble motion problem, which can be solved efficiently. To construct the underlying pebble graph, we identify inscribed circles in the workspace via a medial axis transform and organize robots into layers within each inscribed circle. We show that our layered pebble-graph enables collision-free motions, allowing all graph-restricted MPP instances to be feasible. MPP instances with continuous start and goal positions can then be solved via local navigations that route robots from and to graph vertices. We tested our method on several environments with high robot-packing densities (up to $61.6\%$ of the workspace). For environments with narrow passages, such density violates the well-separated assumptions made by state-of-the-art MPP planners, while our method achieves an average success rate of $83\%$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。