Fast Shortest Path Polyline Smoothing with G¹ Continuity and Bounded Curvature
Published in IEEE Robotics and Automation Letters, 10(4): 3182–3189, 2025
This work proposes a real-time algorithm to smooth polyline paths while maintaining geometric continuity and curvature bounds—ideal for safe robot motion planning in constrained environments.
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