News
Research
Projects
Events
People
Publications
Contact
Interpolation;Approximation Algorithms;Smoothing Methods;Computational Efficiency;Turning;Planning;Training;Standards;Programming;Motion Segmentation;Motion Planning;path Planning;shortest Path Problem
Fast Shortest Path Polyline Smoothing With $G^1$ Continuity and Bounded Curvature
Patrick Pastorelli
,
Simone Dagnino
,
Enrico Saccon
,
Marco Frego
,
Luigi Palopoli
Cite
DOI
Cite
×