bug: fix typo on line 6 of SpaceTimeAStar.py (#1182)

* bug: fix typo on line 6 of SpaceTimeAStar.py

* bug: removed extra line return on line 11 of SpaceTimeAStar.py

Author: spnsingh

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
 """