An algorithm for discrete state sequence and trajectory optimization for hybrid systems with partitioned state space

An algorithm for hybrid optimal control is proposed that varies the discrete state sequence based on gradient information during the search for an optimal trajectory. The algorithm is developed for hybrid systems with partitioned state space. It uses a version of the hybrid minimum principle that allows optimal trajectories to pass through intersections of switching manifolds, which enables the algorithm to vary the sequence. Consequently, the combinatorial complexity of former algorithms can be avoided, since not each possible sequence has to be investigated separately anymore. The convergence of the algorithm is proven and a numerical example demonstrates the efficiency of the algorithm.