Multiple Sparsity Constrained Control Node Scheduling With Application to Rebalancing of Mobility Networks

• 成果类型: Article
• 署名作者: Ikeda, Takuya; Sakurama, Kazunori; Kashima, Kenji
• 署名单位: University of Kitakyushu; Kyoto University
• 刊物名称: IEEE TRANSACTIONS ON AUTOMATIC CONTROL
• ISSN/ISSBN: 0018-9286
• DOI: 10.1109/TAC.2021.3115441
• 发表日期: 2022
• 页码: 4314-4321
• 关键词: Convex optimization; networked systems; optimal control; sparse control

摘要

This article treats an optimal scheduling problem of control nodes in networked systems. We newly introduce both the L-0 and l(0) constraints on control inputs to extract a time-varying small number of effective control nodes. As the cost function, we adopt the trace of the controllability Gramian to reduce the required control energy. Since the formulated optimization problem is combinatorial, we introduce a convex relaxation problem for its computational tractability. After a reformulation of the problem into an optimal control problem to which Pontryagin's maximum principle is applicable, we give a sufficient condition under which the relaxed problem gives a solution of the main problem. Finally, the proposed method is applied to a rebalancing problem of a mobility network.