1 / 6

Finding the Smoothest Shortest Path for a Robot through Data Points

This study explores methods to guide a robot along the shortest but smooth path through a series of consecutive data points. We compare two interpolation techniques: Polynomial and Spline Interpolants. The length of the path calculated using Polynomial Interpolants is 14.9, while the Spline Interpolant results in a shorter path of just 12.9. This analysis highlights the effectiveness of spline interpolation in optimizing robot path planning, ensuring smoother transitions between points to enhance performance and efficiency.

susan
Télécharger la présentation

Finding the Smoothest Shortest Path for a Robot through Data Points

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Find a Smooth Shortest Path for a Robot http://numericalmethods.eng.usf.edu

  2. Points for Robot Path Find the shortest but smooth path through consecutive data points

  3. Polynomial Interpolant Path

  4. Spline Interpolant Path

  5. Compare Spline & Polynomial Interpolant Path Length of path Polynomial Interpolant=14.9 Spline Interpolant =12.9

  6. THE END

More Related