This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem...This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem, the（nonsmooth） objective function is a sum of local convex objective functions assigned to agents in a multi-agent network. Each agent has a private feasible set and decides a local variable, and all the local variables are coupled with a global affine inequality constraint,which is subject to polyhedral uncertain parameters. With the duality theory of convex optimization,the authors derive a robust counterpart of the robust resource allocation problem. Based on the robust counterpart, the authors propose a novel distributed continuous-time algorithm, in which each agent only knows its local objective function, local uncertainty parameter, local constraint set, and its neighbors＇ information. Using the stability theory of differential inclusions, the authors show that the algorithm is able to find the optimal solution under some mild conditions. Finally, the authors give an example to illustrate the efficacy of the proposed algorithm.展开更多
In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group...In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group consensus problem,the agents asymptotically reach several different states rather than one consistent state.A novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed for each agent in order to solve the couple-group consensus problem.It is shown that the group consensus is reachable even when the system contains the uncertain parameters.Furthermore,the multi-group consensus is discussed as an extension of the couple-group consensus,and then the group consensus with switching topology is considered.Simulation results are finally provided to validate the effectiveness of the theoretical analysis.展开更多
基金supported by the National Key Research and Development Program of China under Grant No.2016YFB0901902the National Natural Science Foundation of China under Grant Nos.61573344,61603378,61621063,and 61781340258+1 种基金Beijing Natural Science Foundation under Grant No.4152057Projects of Major International(Regional)Joint Research Program NSFC under Grant No.61720106011
文摘This paper studies a distributed robust resource allocation problem with nonsmooth objective functions under polyhedral uncertain allocation parameters. In the considered distributed robust resource allocation problem, the（nonsmooth） objective function is a sum of local convex objective functions assigned to agents in a multi-agent network. Each agent has a private feasible set and decides a local variable, and all the local variables are coupled with a global affine inequality constraint,which is subject to polyhedral uncertain parameters. With the duality theory of convex optimization,the authors derive a robust counterpart of the robust resource allocation problem. Based on the robust counterpart, the authors propose a novel distributed continuous-time algorithm, in which each agent only knows its local objective function, local uncertainty parameter, local constraint set, and its neighbors＇ information. Using the stability theory of differential inclusions, the authors show that the algorithm is able to find the optimal solution under some mild conditions. Finally, the authors give an example to illustrate the efficacy of the proposed algorithm.
基金supported by the National Natural Science Foundation of China under Grant Nos.60974017.61273212,61322302,61104145,and 61004097Zhejiang Provincial Natural Science Foundation of China under Grant No.LQ14F030011+2 种基金the Natural Science Foundation of Jiangsu Province of China under Grant No.BK2011581the Research Fund for the Doctoral Program of Higher Education of China under Grant No.20110092120024the Fundamental Research Funds for the Central Universities of China
文摘In this paper,a group consensus problem is investigated for multiple networked agents with parametric uncertainties where all the agents are governed by the Euler-Lagrange system with uncertain parameters.In the group consensus problem,the agents asymptotically reach several different states rather than one consistent state.A novel group consensus protocol and a time-varying estimator of the uncertain parameters are proposed for each agent in order to solve the couple-group consensus problem.It is shown that the group consensus is reachable even when the system contains the uncertain parameters.Furthermore,the multi-group consensus is discussed as an extension of the couple-group consensus,and then the group consensus with switching topology is considered.Simulation results are finally provided to validate the effectiveness of the theoretical analysis.
