15-puzzle Instances

该数据集包含了从解决10,000个15数码难题实例中收集的数据，记录了A*算法找到最优解所需要扩展的节点数量，以及实际最优解的长度。此外，数据集还包含了关于每个初始h值在所需扩展和最优解长度方面的累积分布直方图。该数据集的规模为10,000个实例，其任务是在问题解决场景中进行并发规划和执行。This dataset contains data collected from solving 10,000 instances of the 15-puzzle problem. It records the number of nodes expanded by the A* algorithm to find the optimal solution, as well as the length of the actual optimal solution. Additionally, the dataset includes cumulative distribution histograms for each initial heuristic h-value, covering the required number of expanded nodes and the optimal solution length. Comprising a total of 10,000 instances, this dataset is designed for concurrent planning and execution tasks in problem-solving scenarios.

搜集汇总

背景与挑战

背景概述

该数据集是'CoPE'项目的一部分，包含用于测试并发规划与执行元推理模型的15拼图问题实例。这些实例涉及多个进程配置，并附带截止时间和终止时间采样数据，主要用于实验评估和算法性能分析。