-
Notifications
You must be signed in to change notification settings - Fork 125
only check plans in one place in first solution loop, remove spam and clean api so you get better errors #5280
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
base: main
Are you sure you want to change the base?
Conversation
@@ -75,24 +75,16 @@ func initRRTSolutions(ctx context.Context, wp atomicWaypoint) *rrtSolution { | |||
}) | |||
rrt.maps.optNode = &basicNode{q: goalNodes[0].Q()} | |||
|
|||
// Check for direct interpolation for the subset of IK solutions within some multiple of optimal | |||
// Since solutions are returned ordered, we check until one is out of bounds, then skip remaining checks | |||
canInterp := true |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Did you find this claim was just wrong? And we were passing up on possible solutions?
Or is the calculation simply cheap and the optimization was unnecessary?
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
it's sort of cheap.
the optimization does speed things up,
BUT most of that logic is already being run and it's duplicated here.
debating if i'm going to put it in this change or separate.
i made the change much bigger, so re-requested a look |
No description provided.