-
Notifications
You must be signed in to change notification settings - Fork 1.6k
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
I have a question of "rrt_star.py" in rrt_2D. #27
Comments
r is calculated correctly. If max works better then you might have chosen a too large step size. Then max always picks the step size as r, otherwise, for a small step size, it is scaled to the tree's cardinality, right? |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
rrt_star.py :
this part of code
r is the search radius to search for potential best parent nodes,but I don‘t think it should use min() function. I guess the function of the code about r is that as the vertex increases, the radius of the search for the parent node also increases. But it should use max() function. Maybe there is something I misunderstood, but using max() works better works more in principle..
using min():
using max():
Is it my understanding of your code is wrong, I hope to get your help.
The text was updated successfully, but these errors were encountered: