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

Path searching: is it pure A*? #71

Open
karjalv opened this issue Mar 3, 2023 · 1 comment
Open

Path searching: is it pure A*? #71

karjalv opened this issue Mar 3, 2023 · 1 comment

Comments

@karjalv
Copy link

karjalv commented Mar 3, 2023

Hi @bigsuperZZZX,

thanks for impressive work! I noticed that in your article you mentioned that for path searching you use A*. The name of the file in the repository is dyn_a_star.cpp. What is that "dyn" meaning there? Is the path searching done by pure A*, or does the name mean that it is "dynamic A*" (same as D*)? And if it is dynamic A*, where is the modification of arc costs done in the code?

Thanks in advance!

@bigsuperZZZX
Copy link
Member

The "dynamic" means the start and the end grids of A* search are dynamically allocated in the memory pool.
Nothing special.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

No branches or pull requests

2 participants