Fast Shortest Path Polyline Smoothing With $G^1$ Continuity and Bounded Curvature

Patrick Pastorelli, Simone Dagnino, Enrico Saccon, Marco Frego, Luigi Palopoli
January 2025
Cite DOI
Type
Journal article
Publication
IEEE Robotics and Automation Letters
Interpolation;Approximation Algorithms;Smoothing Methods;Computational Efficiency;Turning;Planning;Training;Standards;Programming;Motion Segmentation;Motion Planning;path Planning;shortest Path Problem