Add multi_stop_search for multi-waypoint routing (#935)#937
Merged
Conversation
Routes through N waypoints by calling a_star_search for each consecutive pair and stitching segments into a single cumulative-cost surface. Supports optional TSP-based reordering of interior waypoints (exact Held-Karp for N<=12, nearest-neighbor + 2-opt otherwise).
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
1 participant
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
Summary
multi_stop_search(), which routes through N waypoints by callinga_star_searchfor each consecutive pair and stitching the results into a single cumulative-cost DataArray.data.get()for CuPy arrays to avoid implicit conversion errorsTest plan
jupyter nbconvert --execute docs/source/user_guide/pathfinding.ipynb)