MAPF Scenarios
收藏arXiv2025-09-30 收录
下载链接：
https://github.com/PathPlanning/Continuous-CBS
下载链接
链接失效反馈官方服务：
资源简介：
该数据集包含了为测试连续时间基于冲突搜索（CCBS）算法在不同路网图上处理多代理问题而生成的一系列场景。每个场景都是通过从图中随机选择起始点和目标点来创建的，每个路网图都生成了25个不同的场景。数据集的规模包括：稀疏图拥有158个节点和349条边，密集图拥有878个节点和7,341条边，而超密集图则拥有11,342个顶点和263,533条边。该数据集的任务是针对多代理路径寻找（MAPF）。
This dataset consists of a set of scenarios created to evaluate the continuous-time conflict-based search (CCBS) algorithm when solving multi-agent problems on various road network graphs. Each scenario is generated by randomly selecting start and goal points from the corresponding graph, with 25 distinct scenarios produced for each road network graph. The dataset encompasses road network graphs of three scales: the sparse graph has 158 nodes and 349 edges, the dense graph has 878 nodes and 7,341 edges, and the ultra-dense graph has 11,342 vertices and 263,533 edges. The primary task of this dataset is multi-agent path finding (MAPF).
提供机构：
Open Motion Planning Library (OMPL)
