Skip to content

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

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 2 commits into from
Mar 7, 2025
Merged

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

Changes from 1 commit
Commits
Show all changes
2 commits
Select commit Hold shift + click to select a range
3b9ab73
bug: fix typo on line 6 of SpaceTimeAStar.py
spnsingh Mar 6, 2025
31a962b
bug: removed extra line return on line 11 of SpaceTimeAStar.py
spnsingh Mar 7, 2025
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
3 changes: 2 additions & 1 deletion PathPlanning/TimeBasedPathPlanning/SpaceTimeAStar.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,11 +3,12 @@
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
"""


import numpy as np
import matplotlib.pyplot as plt
from PathPlanning.TimeBasedPathPlanning.GridWithDynamicObstacles import (
Expand Down