日本フィジカルAI新聞

世界のフィジカルAIを、日本語で。

制御最適化arXiv:2304.01475

信号時相論理と凸凹計画の融合:STL仕様のための構造活用型SQPアルゴリズム

Signal Temporal Logic Meets Convex-Concave Programming: A Structure-Exploiting SQP Algorithm for STL Specifications

シェア:XThreadsFacebookLINEはてブBluesky

信号時相論理(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.

関連論文

  1. 1Boston Dynamics、車輪付きAtlasの研究試作機を紹介研究・技術
  2. 2newmoとKDDIが資本業務提携 2028年に堺市で自動運転タクシー商用化目指す提携・買収
  3. 3NVIDIA、CoRLでGR00T 2とIsaac Lab 3.0を発表新製品・発表
  4. 4GXOとApptronik、Apolloの物流現場試験を拡大 最大1,000台の展開を構想量産・展開
  5. 5Google DeepMind、ロボット向けAIを発表新製品・発表

PR・アフィリエイト広告

OZ GAMING(GPU搭載BTOゲーミングPC)

OZ GAMING(GPU搭載BTOゲーミングPC)の公式広告バナーOZ GAMINGで完成品PCを見る ↗
PR本紙発行元 EmplifAI