Abstract
A general Hybrid Minimum Principle (HMP) for hybrid optimal control problems (HOCPs) is presented in [1, 2, 3, 4] and in [4, 5], a class of efficient, provably convergent Hybrid Minimum Principle (HMP) algorithms were obtained based upon the HMP. The notion of optimality zones (OZs) ([3, 4]) provides a theoretical framework for the computation of optimal location (i.e. discrete state) schedules for HOCPs (i.e. discrete state sequences with the associated switching times and states). This paper presents the algorithm HMPOZ which fully integrates the prior computation of the OZs into the HMP algorithms class. Summing (a) the computational investment in the construction of the OZs for a given HOCP, and (b) the complexity of (i) the computation of the optimal schedule, (ii) the optimal switching time and optimal switching state sequence, and (iii) the optimal continuous control input, yields a complexity estimate for the algorithm HMPOZ which is linear (i.e. O(L)) in the number of switching times L.
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.
