TY - JOUR
T1 - Optimal control for hybrid systems with partitioned state space
AU - Passenberg, Benjamin
AU - Caines, Peter E.
AU - Leibold, Marion
AU - Stursberg, Olaf
AU - Buss, Martin
PY - 2013
Y1 - 2013
N2 - For hybrid systems where the continuous state space is partitioned by switching manifolds, the discrete state changes autonomously if the continuous state hits a manifold. Recently, we introduced a version of the minimum principle for the optimal control of such systems, where necessary optimality conditions were provided for the case that a trajectory passes through the intersection of switching manifolds. Further, we introduced an algorithm based on these conditions for computing optimal controls by varying not only the continuous state on switching manifolds based on gradient information, but also the sequence of discrete states . It was shown that, the combinatorial complexity of former computational schemes based on the minimum principle can be avoided, since not all possible discrete state sequences need to be analyzed separately. In this note, theoretical aspects of the algorithm and practical considerations for a successful implementation are discussed in detail. Further, a comparison to existing algorithms for the solution of hybrid optimal control problems with autonomous switching is presented. The efficiency of the proposed algorithm is demonstrated by a novel numerical example.
AB - For hybrid systems where the continuous state space is partitioned by switching manifolds, the discrete state changes autonomously if the continuous state hits a manifold. Recently, we introduced a version of the minimum principle for the optimal control of such systems, where necessary optimality conditions were provided for the case that a trajectory passes through the intersection of switching manifolds. Further, we introduced an algorithm based on these conditions for computing optimal controls by varying not only the continuous state on switching manifolds based on gradient information, but also the sequence of discrete states . It was shown that, the combinatorial complexity of former computational schemes based on the minimum principle can be avoided, since not all possible discrete state sequences need to be analyzed separately. In this note, theoretical aspects of the algorithm and practical considerations for a successful implementation are discussed in detail. Further, a comparison to existing algorithms for the solution of hybrid optimal control problems with autonomous switching is presented. The efficiency of the proposed algorithm is demonstrated by a novel numerical example.
KW - Hybrid minimum principle
KW - Hybrid systems
KW - Intersecting switching manifolds
KW - Optimal control
UR - http://www.scopus.com/inward/record.url?scp=84880907137&partnerID=8YFLogxK
U2 - 10.1109/TAC.2013.2246112
DO - 10.1109/TAC.2013.2246112
M3 - Article
AN - SCOPUS:84880907137
SN - 0018-9286
VL - 58
SP - 2131
EP - 2136
JO - IEEE Transactions on Automatic Control
JF - IEEE Transactions on Automatic Control
IS - 8
M1 - 6457410
ER -