We study the planning and acting phase for the problem of multi-agent path finding (MAPF) in this paper. MAPF is a problem of navigating agents from their start positions to specified individual goal positions so that agents do not collide with each other. Specifically we focus on executing MAPF plans with a group of Crazyflies, small indoor quadcopters . We show how to modify the existing continuous time conflict-based search algorithm (CCBS) to produce plans that are suitable for execution with the quadcopters. The acting phase uses the the Loco positioning system to check if the plan is executed correctly. Our finding is that the CCBS algorithm allows for extensions that can produce safe plans for quadcopters, namely cylindrical protection zone around each quadcopter can be introduced at the planning level.
翻译:在本文中,我们研究了多试剂路径发现(MAPF)问题的规划和行动阶段。MAPF是一个从初始位置到特定目标位置的导航代理器的问题,因此代理器不会相互碰撞。具体地说,我们侧重于与一群疯虫、小型室内四肢执行MAPF计划。我们展示了如何修改现有的基于冲突的持续时间搜索算法(CCBS),以制定适合与四肢检查器一起执行的计划。该操作阶段使用 Loco 定位系统来检查计划是否得到正确执行。我们发现CCBS算法允许延长可产生四肢检查器安全计划的范围,即每个四肢检查器周围的圆柱形保护区,可以在规划层面引入。