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

HybridAstar algorithm: about the judgment of the same cell #54

Open
Zhihaibi opened this issue Oct 10, 2022 · 0 comments
Open

HybridAstar algorithm: about the judgment of the same cell #54

Zhihaibi opened this issue Oct 10, 2022 · 0 comments
Labels

Comments

@Zhihaibi
Copy link

Zhihaibi commented Oct 10, 2022

algorithm.cpp in line 201 - 208

               if (iPred == iSucc && nSucc->getC() > nPred->getC() + Constants::tieBreaker) {
                  delete nSucc;
                  continue;
                   }
                // if successor is in the same cell and the C value is lower, set predecessor to predecessor of predecessor
             else if (iPred == iSucc && nSucc->getC() <= nPred->getC() + Constants::tieBreaker) {
                  nSucc->setPred(nPred->getPred());
  }

Hi, thank you very much for the open-source code. I am confused about the judgment of the same cell in the code above. The index iPred and iSucc here are the three-dimensional indexes related to the heading angle, which will result in almost no judgment as the same cell as long as the heading angle changes. I think it is not necessary to consider the heading angle when judging whether it is the same cell, just check whether there is already a waypoint in the current grid in the 2D grid. What do you think?

@Zhihaibi Zhihaibi changed the title About hybridAstar algorithm HybridAstar algorithm: about the judgment of the same cell Oct 10, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
Projects
None yet
Development

No branches or pull requests

2 participants