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

algorithm.cpp 里面的 2D A* ,其实实质上是Dijstra算法 #4

Open
dkb1989 opened this issue Mar 1, 2021 · 3 comments
Open

Comments

@dkb1989
Copy link

dkb1989 commented Mar 1, 2021

algorithm.cpp 里面的 2D A* ,其实实质上是Dijstra算法,虽然计算了h值、其在2D A*中没有用到这个诱导H值

@ControlLI
Copy link

algorithm.cpp 里面的 2D A* ,其实实质上是Dijstra算法,虽然计算了h值、其在2D A*中没有用到这个诱导H值

是不是 a星本身用了,返回hybridastar这个函数的其实是G的值

@hoppss
Copy link

hoppss commented May 1, 2022

@dkb1989 @ControlLI 这就是Astar! 没问题。

boost heap 谓词 compareNode 里面比较T* 的 getC() = g+h, 这里分开写,没明着计算f

@WeiJunREN
Copy link

@dkb1989 @ControlLI 这就是Astar! 没问题。

boost heap 谓词 compareNode 里面比较T* 的 getC() = g+h, 这里分开写,没明着计算f

咨询一下,Astar代码中哪里用到了这个compareNode ,a星本身返回的是g值吧

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

4 participants