Quote:
Originally Posted by Jared
Currently, I'm working on implementing something similar to this while trying to reduce computing time and I had a few more questions about how yours worked.
|
That sounds really cool. Any chance of a picture of it? I don't have something to build the program with at home.
As for the acceleration problem, you could locate local minimums for velocity, then work your way out of each of the mins, only going as fast as you can go. Then, when there's overlap between velocities calculated between different mins, you pick the lower one. Acceleration won't be a continuous function though, it'll have jumps. How important is jerk limits?