Abstract
In this article, we consider a finite-elementapproximation of the Bellman equation for the optimal control of switched systems. We show that the problem belongs to a special class that we studied in a previous work, for which we developed an efficient solution algorithm. As an application, we present the problem of generating parking maneuvers for self-driving vehicles on two typical urban parking scenarios. The vehicle is described by four different switched systems in which every switching is associated to a penalization term. In this way, we obtain parking paths that have a small number of direction changes and have a simple structure.
Sign-in/Register to access full text options 
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.
