Abstract
In this paper, we characterize the time-optimal trajectories leading a Dubins car in collision with the obstacles in its workspace. Due to the constant velocity constraint characterizing the Dubins car model, these trajectories form a sufficient set of shortest paths between any robot configuration and the obstacles in the environment. Based on these paths, we define and give the algorithm for computing a distance function that takes into account the nonholonomic constraints and captures the nonsymmetric nature of the system. The developments presented here assume that the obstacles and the robot are polygons although the methodology can be applied to different shapes.
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.
