Drones Coverage Point Placement Dataset
收藏doi.org2025-03-25 收录
下载链接:
http://doi.org/10.17632/4mwtzndhrb.1
下载链接
链接失效反馈官方服务:
资源简介:
Optimal placement and coverage of drones is a challenging optimization problem to monitor all targets/sensors with the fewest possible number of drones. We launch test dataset include problems ranging from small to large-scale. The dataset includes four categories with three problems with different parameters. Set 1 that includes the problems P11, P12, and P13, and it is denoted as small-dimensional problems. Set 2 includes P21, P22, and P23, and it is denoted as medium-dimensional problems. Set 3 to represent the large-dimensional. It includes P31, P32, and P33, and Set 4 represents the very large-scale and contains P41, P42, and P43. Each problem per the set differs from the other within that set in the initialization process (different sensors/targets list and different suggested initial drones list) . The details of the presented problems are showed in table 1 attached with the dataset files.
无人机最优布署与覆盖范围问题是一项极具挑战性的优化难题,旨在以尽可能少的无人机数量监控所有目标/传感器。本测试数据集涵盖了从小型到大型规模的问题。数据集包含四个类别,每个类别包含三个具有不同参数的问题。第一组(Set 1)包含问题 P11、P12 和 P13,被标记为低维问题。第二组(Set 2)包括问题 P21、P22 和 P23,被标记为中等维度的問題。第三组(Set 3)代表高维问题,包含问题 P31、P32 和 P33,而第四组(Set 4)则代表极大规模问题,包含问题 P41、P42 和 P43。每个组内的问题在初始化过程中均存在差异(传感器/目标列表不同,以及建议的初始无人机列表不同)。所呈现问题的详细信息展示于附随数据集文件的表格 1 中。
提供机构:
doi.org



