In [1], [2], [3], [4] necessary conditions were obtained for hybrid optimal control problems (HOCPs) which resulted in a general Hybrid Maximum Principle (HMP); further, in [5] a class of efficient, provably convergent Hybrid Maximum Principle (HMP) algorithms were obtained based upon the HMP. In [5], [3], [4] the notion of optimality zones (OZs) was introduced as a theoretical framework enabling the computation of optimal schedules for HOCPs (i.e. discrete state sequences with the associated switching times and states). This paper presents the algorithm HMPZ which fully integrates the prior computation of the OZs into the HMP algorithms of [5].Adding (i) the computational investment in the construction of the OZs for a given HOCP, and (ii) the complexity of the computation of the optimal schedule, optimal switching time and state sequence, and the optimal continuous control input, yields a complexity estimate for the algorithm (HMPZ) which is linear (i.e. O(L)) in the number of switching times L; this is to be compared with the geometric (i.e. O(|Q| L )) growth of a direct combinatoric search over the set of schedules, where Q denotes the discrete state set of the hybrid system.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.