首页> 外文期刊>IFAC PapersOnLine >Multi-robot Path Planning with Boolean Specifications and Collision Avoidance ?
【24h】

Multi-robot Path Planning with Boolean Specifications and Collision Avoidance ?

机译:具有布尔规范和碰撞避免的多机器人路径规划

获取原文
           

摘要

In this paper we consider the path planning problem for a team of identical mobile robots that should fulfill a given global specification. This specification is given as a Boolean formula over some regions of interest and should be satisfied on the final state (when the robots stop) and on the trajectories. The main novelty of this paper is the automatic computation of collision-free trajectories. The approach is based on a Petri net model and on solving two Mixed Integer Linear Programming problems. Based on the solutions of these problems, intermediate synchronization points are introduced in order to avoid possible collisions. Additionally, the algorithm in this paper is implemented in an open-source Matlab toolbox, called RMTool.
机译:在本文中,我们考虑了一个相同的移动机器人团队的路径规划问题,应该满足给定的全局规范。本说明书作为布尔公式给出了一些感兴趣的区域,并且应在最终状态(机器人停止时)和轨迹上的满意。本文的主要新颖性是自动计算无碰撞轨迹。该方法基于Petri网络模型以及解决两个混合整数线性规划问题。基于这些问题的解决方案,引入中间同步点以避免可能的碰撞。此外,本文中的算法在开源Matlab工具箱中实现,称为RMTool。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号