Sparsity-Constrained Controllability Maximization With Application to Time-Varying Control Node Selection

• 池田, 卓矢

  Graduate School of Informatics, Kyoto University

• 加嶋, 健司

  Graduate School of Informatics, Kyoto University

抄録

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.

収録刊行物

• IEEE Control Systems Letters

  IEEE Control Systems Letters 2 (3), 321-326, 2018-07

  Institute of Electrical and Electronics Engineers(IEEE)

キーワード

• Optimal control
• linear systems
• time-varying systems
• sparse optimal control
• networked control systems

詳細情報

• CRID: 1050564289020499072
• NII論文ID: 120006773154
• ISSN: 24751456
• DOI: 10.1109/lcsys.2018.2833621
• HANDLE: 2433/245128
• Web Site: http://xplorestaging.ieee.org/ielx7/7782633/8361597/08355260.pdf?arnumber=8355260
• 本文言語コード: en
• 資料種別: journal article
• データソース種別:
  • IRDB
  • Crossref
  • CiNii Articles
  • KAKEN