-
-
Notifications
You must be signed in to change notification settings - Fork 6.6k
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.
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
Improve Performance #1074
Comments
is this issue still open i want to contribute to this issue |
PR is welcome. |
@AtsushiSakai can you assign me |
no need to assign. please create a PR. |
@AtsushiSakai check pr |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
https://github.com/AtsushiSakai/PythonRobotics/blob/ad600cd9023e67cd8064b678213d6586d076dd15/PathPlanning/AStar/a_star_searching_from_two_side.py#L80C1-L117C20
In the above function the search for coordinates and neighbors in
ob_list
andneighbors
happens very often, specially for long obstacles.It would be more efficient to store the obstacles and neighbors in a set as the lookup is done by a hashmap instead of a linear search.
The text was updated successfully, but these errors were encountered: