From 7a5b92b79c21852dd8d0ac67fe9cc780e16f3429 Mon Sep 17 00:00:00 2001 From: Paul Lesur Date: Thu, 9 Feb 2023 18:23:41 +0100 Subject: [PATCH] add result page for runaway --- content/publications/sgmapf.md | 6 ++- content/runaway_planning/_index.md | 41 +++++++++++++++ content/runaway_planning/results/_index.md | 58 ++++++++++++++++++++++ layouts/shortcodes/dummy.html | 1 + 4 files changed, 104 insertions(+), 2 deletions(-) create mode 100644 content/runaway_planning/_index.md create mode 100644 content/runaway_planning/results/_index.md create mode 100644 layouts/shortcodes/dummy.html diff --git a/content/publications/sgmapf.md b/content/publications/sgmapf.md index 1b3d7c7..2f81cb3 100644 --- a/content/publications/sgmapf.md +++ b/content/publications/sgmapf.md @@ -16,8 +16,6 @@ Lesur, Paul & Bajcinca, Naim ## Abstract - - In this work we present a real-time capable algorithm for solving path planning problems for the application of Runaway Scenarios. In such applications, a main agent has to follow a path, and other secondary agents should create space for the main agent, @@ -25,3 +23,7 @@ without colliding with one another. Our algorithm uses a low-level path planner, similar to what can be found in the literature for the problem of Multi-Agent Path Finding (MAPF), and combines it with our novel Planner Scheduler, a high-level scheduler that allows us to find a sub-optimal solution quickly. + +## Results + +One can find the detailed results (numbers and animations) [here](../../runaway_planning/results). diff --git a/content/runaway_planning/_index.md b/content/runaway_planning/_index.md new file mode 100644 index 0000000..1a2e87c --- /dev/null +++ b/content/runaway_planning/_index.md @@ -0,0 +1,41 @@ +--- +title: Runaway Planning Result Page +--- + + +# What is shown on each image + +TODO + +# The different algorithms + +TODO + +# How the scenarios were generated + +TODO + +# Runtime comparison + +{{< dummy >}} +

Results for raw CBS over the 100 different scenarios. Average runtime + (in case of successful computation) is 634ms.

+ +{{< /dummy >}} + +{{< dummy >}} +

Results for Schedulder + CBS over the 100 different scenarios. Average runtime + (in case of successful computation) is 250ms.

+ +{{< /dummy >}} + +{{< dummy >}} +

Results for Subproblems + Schedulder + CBS over the 100 different scenarios. Average runtime + (in case of successful computation) is 175ms.

+ +{{< /dummy >}} + + +# The detailed results + +... are [here](results) diff --git a/content/runaway_planning/results/_index.md b/content/runaway_planning/results/_index.md new file mode 100644 index 0000000..d4f5191 --- /dev/null +++ b/content/runaway_planning/results/_index.md @@ -0,0 +1,58 @@ +--- +title: Runaway Planning Results +--- + +{{< dummy >}} + + + + +

If the video does not load for a given algorithm, that means it failed to +compute a solution (within the 10s timeout).

+ +
+

Raw CBS

+ +
+ +
+

Scheduler + CBS

+ +
+ +
+

Subproblems + Scheduler + CBS

+ +
+ + +{{< /dummy >}} diff --git a/layouts/shortcodes/dummy.html b/layouts/shortcodes/dummy.html new file mode 100644 index 0000000..5827a82 --- /dev/null +++ b/layouts/shortcodes/dummy.html @@ -0,0 +1 @@ + {{ .Inner }}