Skip to content
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

stdcm: use the A* heuristic to discard paths that can't be fast enough #2817

Closed
Tracked by #1960
eckter opened this issue Jan 10, 2023 · 0 comments
Closed
Tracked by #1960

stdcm: use the A* heuristic to discard paths that can't be fast enough #2817

eckter opened this issue Jan 10, 2023 · 0 comments
Labels
area:core Work on Core Service module:stdcm Short-Term DCM

Comments

@eckter
Copy link
Contributor

eckter commented Jan 10, 2023

Requires #2818, this can't be done if the coordinates don't match the distances.

We discard paths that are longer than x seconds (a given parameter), but we only check the known run time. We should also estimate the fastest remaining run time to go from the current point to the destination, and discard the path if it can't lead to a solution in time.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
area:core Work on Core Service module:stdcm Short-Term DCM
Projects
None yet
Development

No branches or pull requests

1 participant