diff --git a/PathPlanning/TimeBasedPathPlanning/SpaceTimeAStar.py b/PathPlanning/TimeBasedPathPlanning/SpaceTimeAStar.py
index 3b3613d695..a7aed41869 100644
--- a/PathPlanning/TimeBasedPathPlanning/SpaceTimeAStar.py
+++ b/PathPlanning/TimeBasedPathPlanning/SpaceTimeAStar.py
@@ -3,7 +3,7 @@
     This script demonstrates the Space-time A* algorithm for path planning in a grid world with moving obstacles.
     This algorithm is different from normal 2D A* in one key way - the cost (often notated as g(n)) is
     the number of time steps it took to get to a given node, instead of the number of cells it has
-    traversed. This ensures the path is time-optimal, while respescting any dynamic obstacles in the environment.
+    traversed. This ensures the path is time-optimal, while respecting any dynamic obstacles in the environment.
 
     Reference: https://www.davidsilver.uk/wp-content/uploads/2020/03/coop-path-AIWisdom.pdf
 """