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.

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

Jump to bottom

Better heuristic for the shortest path algorithm for navigation2D #22047

Merged
merged 1 commit into from
Sep 20, 2018
Merged

Better heuristic for the shortest path algorithm for navigation2D #22047

merged 1 commit into from
Sep 20, 2018

Commits on Sep 20, 2018

  1. Better heuristic for the shortest path algorithm for navigation2D and… 

    … navigation.

Better heuristic for the shortest path algorithm for navigation2D and navigation.
It now will use the shortest distance to the polygon as cost instead of the distance to the center.
    @Piet-G
    Piet-G committed Sep 20, 2018
    Configuration menu
    Copy the full SHA
    0b5c694 View commit details
    Browse the repository at this point in the history