遇见数据集

Hexagonal Maritime Coverage Path Planning Dataset

收藏
Zenodo2026-04-13 更新2026-05-26 收录
官方服务:

资源简介:

This record contains the dataset used for research on coverage path planning over hexagonal grids in maritime-like areas of interest. The dataset is intended for benchmarking and training algorithms for graph-based and learning-based coverage planning, including deep reinforcement learning approaches. The dataset consists of problem instances derived from polygonal areas of interest, including irregular geometries and cases with internal holes/obstacles, which are transformed into hexagonal decompositions and graph representations. Each instance provides the information required to formulate the coverage path planning problem, including the spatial layout, graph connectivity, and auxiliary attributes needed for planning and evaluation. A data schema in Markdown format is included in this record to document the dataset structure, variables, and fields. This record should be cited when using the dataset in experiments, benchmarking, or derived works. Related supporting images and visual examples are provided in a separate Zenodo record.

本数据集收录了针对类海事感兴趣区域内六边形网格覆盖路径规划(coverage path planning)开展研究所用的数据集。该数据集旨在为基于图的、基于学习的覆盖路径规划算法(含深度强化学习(deep reinforcement learning)方法)提供基准测试与训练支持。 本数据集的问题实例源自各类多边形感兴趣区域(polygonal areas of interest),涵盖不规则几何形状以及带内部孔洞/障碍物的场景,这些区域均被转换为六边形分解(hexagonal decompositions)结构与图表示(graph representations)形式。每个实例均提供了构建覆盖路径规划问题所需的全部信息,包括空间布局、图连通性以及规划与评估所需的辅助属性。 本数据包中包含Markdown格式的数据模式(data schema)文档,用于说明数据集的结构、变量与字段信息。若在实验、基准测试或衍生研究中使用本数据集,请引用本数据包。相关配套图像与可视化示例已上传至独立的Zenodo存档记录中。

提供机构:
Zenodo
创建时间:
2026-04-13
二维码
社区交流群
二维码
科研交流群
商业服务