Shortest Path of a Robot using Interpolation

by Sean Herbert

Submitted : Fall 2015

For my project, I sought to find the shortest path a robot could take between several points without joining the consecutive points with straight lines. Polynomials provide differentiable curves that reduce wear on robots, and are preferable to the longevity of the robot's life which is why straight lines conjoining points was not considered. So I used m two methods of interpolation: polynomial interpolation and cubic spline interpolation. I used these two methods to efficiently produce curves of the points provided to me. From My results I found that the cubic spline interpolation was the most efficient way to formulate a path.

[ Back ]