Abstract
This paper addresses the issue of planning smooth (C∞) 2D paths with bounded curvature and curvature derivative connecting two assigned poses (positions and orientations). The solution builds on an approximation of Dubins shortest paths and it can be used also to link an ordered sequence of via-points. The effectiveness of the proposed planning method is validated by simulations.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
