信号時相論理と凸凹計画の融合:STL仕様のための構造活用型SQPアルゴリズム
Signal Temporal Logic Meets Convex-Concave Programming: A Structure-Exploiting SQP Algorithm for STL Specifications
信号時相論理(STL)仕様を満たす制御問題に対し、ロバスト性関数を凸関数の差(DC)計画に分解し、選言部分のみを近似する逐次二次計画法(SQP)を提案。従来法より局所解に陥りにくく、ロバスト性と計算時間で優れることを示した。
著者: Yoshinari Takayama, Kazumune Hashimoto, Toshiyuki Ohtsuka
分類: eess.SY, cs.FL, cs.RO, cs.SY
原文アブストラクト
This study considers the control problem with signal temporal logic (STL) specifications. Prior works have adopted smoothing techniques to address this problem within a feasible time frame and solve the problem by applying sequential quadratic programming (SQP) methods naively. However, one of the drawbacks of this approach is that solutions can easily become trapped in local minima that do not satisfy the specification. In this study, we propose a new optimization method, termed CCP-based SQP, based on the convex-concave procedure (CCP). Our framework includes a new robustness decomposition method that decomposes the robustness function into a set of constraints, resulting in a form of difference of convex (DC) program that can be solved efficiently. We solve this DC program sequentially as a quadratic program by only approximating the disjunctive parts of the specifications. Our experimental results demonstrate that our method has a superior performance compared to the state-of-the-art SQP methods in terms of both robustness and computational time.
