We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
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
Hello, I have a question. As far as I know, the RRTConnect algorithm should have two trees (one with the root node as the start point and the other with the root node as the goal point), which grow towards each other and try to connect. But the algorithm you provided only has one tree growing from the starting point. Is that right? Kuffner J J, LaValle S M. RRT-connect: An efficient approach to single-query path planning[C]//Proceedings 2000 ICRA. Millennium conference. IEEE international conference on robotics and automation. Symposia proceedings (Cat. No. 00CH37065). IEEE, 2000, 2: 995-1001
The text was updated successfully, but these errors were encountered:
No branches or pull requests
Hello, I have a question. As far as I know, the RRTConnect algorithm should have two trees (one with the root node as the start point and the other with the root node as the goal point), which grow towards each other and try to connect. But the algorithm you provided only has one tree growing from the starting point. Is that right?
Kuffner J J, LaValle S M. RRT-connect: An efficient approach to single-query path planning[C]//Proceedings 2000 ICRA. Millennium conference. IEEE international conference on robotics and automation. Symposia proceedings (Cat. No. 00CH37065). IEEE, 2000, 2: 995-1001
The text was updated successfully, but these errors were encountered: