Fast Shortest Path Polyline Smoothing with G¹ Continuity and Bounded Curvature
Published in IEEE Robotics and Automation Letters, 10(4): 3182–3189, 2025
Introduces an efficient algorithm for smoothing shortest paths while ensuring G¹ continuity and bounded curvature—achieving real-time feasibility for robotic navigation.
Recommended citation: P. Pastorelli, S. Dagnino, E. Saccon, M. Frego, and L. Palopoli. (2025). "Fast Shortest Path Polyline Smoothing with G¹ Continuity and Bounded Curvature." IEEE Robotics and Automation Letters, 10(4): 3182–3189.
Download Paper