ダウンロード数: 336
このアイテムのファイル:
ファイル | 記述 | サイズ | フォーマット | |
---|---|---|---|---|
LCSYS.2018.2833621.pdf | 196.5 kB | Adobe PDF | 見る/開く |
タイトル: | Sparsity-Constrained Controllability Maximization With Application to Time-Varying Control Node Selection |
著者: | Ikeda, Takuya Kashima, Kenji https://orcid.org/0000-0002-2963-2584 (unconfirmed) |
著者名の別形: | 池田, 卓矢 加嶋, 健司 |
キーワード: | Optimal control linear systems time-varying systems sparse optimal control networked control systems |
発行日: | Jul-2018 |
出版者: | Institute of Electrical and Electronics Engineers(IEEE) |
誌名: | IEEE Control Systems Letters |
巻: | 2 |
号: | 3 |
開始ページ: | 321 |
終了ページ: | 326 |
抄録: | In this letter, we consider the maximization of a quantitative metric of controllability with a constraint of L 0 norm of the control input. Since the optimization problem contains a combinatorial structure, we introduce a convex relaxation problem for the sake of reducing computation burden. We prove the existence of solutions to the main problem and also give a simple condition under which the relaxed problem gives a solution to the main problem. It should be emphasized that the main problem can formulate time-varying control node selection, which attempts to extract when and where exogenous inputs should be provided in order to achieve high controllability of multi-agent systems. |
著作権等: | © 2018 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works. この論文は出版社版でありません。引用の際には出版社版をご確認ご利用ください。 This is not the published version. Please cite only the published version. |
URI: | http://hdl.handle.net/2433/245128 |
DOI(出版社版): | 10.1109/LCSYS.2018.2833621 |
出現コレクション: | 学術雑誌掲載論文等 |
このリポジトリに保管されているアイテムはすべて著作権により保護されています。