Abstract
This paper presents first attempts at a method for searching for time-optimal trajectories for a general model of mobile robots that includes Dubins and Reeds-Shepp cars, differential-drive robots, and omnidirectional robots as special cases. The paper takes as a starting point recent results by the authors that describe necessary conditions on the trajectories, based on Pontryagin's Maximum Principle. These necessary conditions reduce the problem of finding an optimal trajectory between start and goal to a few one-dimensional search problems. This search is not formally guaranteed to find a near-optimal trajectory if the sampling of the search space is not fine enough, but comparison to existing analytical results for specific systems, and a complete numerical search over trajectories with only a few control switches, demonstrates effectiveness of the method.
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.
