Commit
•
65de3a2
1
Parent(s):
951f84b
Update README.md
Browse files
README.md
CHANGED
@@ -7,4 +7,13 @@ tags:
|
|
7 |
pretty_name: PPFT
|
8 |
size_categories:
|
9 |
- n<1K
|
10 |
-
---
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
7 |
pretty_name: PPFT
|
8 |
size_categories:
|
9 |
- n<1K
|
10 |
+
---
|
11 |
+
|
12 |
+
**PPFT**: Path Planning on Fifty x Thirty
|
13 |
+
Our dataset consists of 100 manually selected 50 × 30 maps from a randomly generated collection, each with 10 different start and goal positions. Therefore, there are 1000 samples in total (see Figure 1 for sample visualization). Our data conform to the standard of search-based algorithm environments in a continuous space. Each map includes the following parameters:
|
14 |
+
• x range: The minimum and maximum x-coordinates of the environment boundary range as [x min, x max].
|
15 |
+
• y range: The minimum and maximum y-coordinates of the environment boundary range as [y min, y max].
|
16 |
+
• horizontal barriers: List of horizontal barriers, each represented as [y, x start, x end].
|
17 |
+
• vertical barriers: List of vertical barriers, each represented as [x, y start, y end].
|
18 |
+
• start goal: List of 10 unique start and goal positions for each map.
|
19 |
+
These parameters define the structure and constraints of each map, ensuring consistency and relevance to the standard experimental environment conditions for search-based algorithms. Meanwhile, the map environment is able to scale properly for scalability experiment.
|