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

Global planning using A* algorithm with GradientPath method #962

Open
wants to merge 3 commits into
base: melodic-devel
Choose a base branch
from
Open

Global planning using A* algorithm with GradientPath method #962

wants to merge 3 commits into from

Commits on Jan 26, 2020

  1. Use A* algorithm by default 

    use-_dijkstra parameter changed to false
    @MikeDegany
    MikeDegany committed Jan 26, 2020
    Configuration menu
    Copy the full SHA
    e8ef486 View commit details
    Browse the repository at this point in the history

  2. Euclidean instead of Manhattan 

    Calculate Euclidean distance instead of Manhattan distance in A* algorithm
    @MikeDegany
    MikeDegany committed Jan 26, 2020
    Configuration menu
    Copy the full SHA
    b4a505b View commit details
    Browse the repository at this point in the history

  3. Goal adjacency tolerance increased 

    Goal adjacency tolerance increased from 0.5 to 1 to work while using A* algorithm and GradientPath method without error.
    @MikeDegany
    MikeDegany committed Jan 26, 2020
    Configuration menu
    Copy the full SHA
    785ae1f View commit details
    Browse the repository at this point in the history