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 >}}
+        <p>Results for raw CBS over the 100 different scenarios. Average runtime
+        (in case of successful computation) is 634ms.</p>
+      <img src="./cbs.png">
+{{< /dummy >}}
+
+{{< dummy >}}
+        <p>Results for Schedulder + CBS over the 100 different scenarios. Average runtime
+        (in case of successful computation) is 250ms.</p>
+      <img src="./scheduling_cbs.png">
+{{< /dummy >}}
+
+{{< dummy >}}
+        <p>Results for Subproblems + Schedulder + CBS over the 100 different scenarios. Average runtime
+        (in case of successful computation) is 175ms.</p>
+      <img src="./subproblem_scheduling_cbs.png">
+{{< /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 >}}
+
+<input type="number" id="resultId" min="0" max="99" default="0">
+<input type="submit" id="showResultButton">
+
+<p>If the video does not load for a given algorithm, that means it failed to
+compute a solution (within the 10s timeout).</p>
+
+<div>
+    <p>Raw CBS</p>
+    <video id="cbs" controls width="560" class="videoTag">
+        <source type="video/mp4" />
+    </video>
+</div>
+
+<div>
+    <p>Scheduler + CBS</p>
+<video id="scheduling_cbs" controls width="560" class="videoTag">
+    <source type="video/mp4" />
+</video>
+</div>
+
+<div>
+    <p>Subproblems + Scheduler + CBS</p>
+    <video id="subproblem_scheduling_cbs" controls width="560" class="videoTag">
+        <source type="video/mp4" />
+    </video>
+</div>
+
+<script charset="utf-8">
+    var idField = document.getElementById("resultId");
+    var button = document.getElementById("showResultButton");
+    button.addEventListener("click", () => show_all_videos(idField.value)); 
+
+    function show_one_video(videoDiv, n) {
+        const videoLoc = "./" + videoDiv.id + "/from_generated_" + n + ".mp4";
+        videoDiv.children[0].src = videoLoc;
+        videoDiv.load();
+        videoDiv.play();
+    }
+
+    function show_all_videos(n) {
+        const videoDivs = document.getElementsByClassName("videoTag")
+        for (var i = 0; i < videoDivs.length; i++) {
+            show_one_video(videoDivs.item(i), n);
+        }
+
+    }
+
+    if (n != null) {
+        show_all_videos(n);
+    }
+</script>
+{{< /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 }}