Re:Open Problems in Robotics
by snovv_crash on Wednesday August 19, 2020 @03:45AM
(#24208118)
I discovered when doing something in this space recently that even the simple case of doing optimal planning for a particle under Newtonian dynamics, with limits on eg. velocity and acceleration, is NP-Complete.
[ Parent
| on HN ]
There are no comments on this comment yet.