详细信息
Nodes selection strategy in cooperative tracking problem ( SCI-EXPANDED收录 EI收录)
文献类型:期刊文献
英文题名:Nodes selection strategy in cooperative tracking problem
作者:Yang, Wen[1];Wang, Zidong[2];Zuo, Zongyu[3];Yang, Chao[1];Shi, Hongbo[1]
机构:[1]East China Univ Sci & Technol, Minist Educ, Key Lab Adv Control & Optimizat Chem Proc, Shanghai, Peoples R China;[2]Brunel Univ London, Dept Comp Sci, Uxbridge UB8 3PH, Middx, England;[3]Beihang Univ, Res Div 7, Sci & Technol Aircraft Control Lab, Beijing, Peoples R China
年份:2016
卷号:74
起止页码:118
外文期刊名:AUTOMATICA
收录:;EI(收录号:20164002875014);WOS:【SCI-EXPANDED(收录号:WOS:000389087200016)】;
基金:This work was supported in part by the National Natural Science Foundation of China under Grant (61573143, 61503139,61374140,61329301), the Innovation Program of Shanghai Municipal Education Commission under Grant No.14zz55. The material in this paper was not presented at any conference. This paper was recommended for publication in revised form by Associate Editor Michael M. Zavlanos under the direction of Editor Christos G. Cassandras.
语种:英文
外文关键词:Cooperative control; Controlled consensus; Node selection; Convex optimization
摘要:In this paper, a new optimization problem is addressed for node selection that has application potentials in input/output switches for sensors in control system design and leader determination in social networks. The purpose of the addressed problem is to develop a strategy for selecting a subset of nodes as controlled nodes in order to minimize certain objective function consisting of the convergence speed and the energy of control action, over a finite time-horizon. For networks with fixed controlled nodes, an upper bound of the objective function is obtained which is shown to be convex and independent of the time-horizon. For networks with switched controlled nodes, a greedy algorithm is proposed to reduce the computation complexity resulting from the length of the time-horizon, where the nodes selection is carried out over divided small time-intervals. The cost gap is also analyzed between the strategy of optimizing over the whole time-horizon and the strategy of optimizing over the small intervals. Finally, the proposed nodes selection strategy is validated through simulations and two regions are found in which the number of optimal controlled nodes is determined. (C) 2016 Elsevier Ltd. All rights reserved.
参考文献:
正在载入数据...
