Distributed Multiobjective Optimization for Network Resource Allocation of Multiagent Systems

Abstract

In this article, a distributed multiobjective optimization problem is formulated for the resource allocation of network-connected multiagent systems. The framework encompasses a group of distributed decision makers in the subagents, where each of them possesses a local preference index. Novel distributed algorithms are proposed to solve such a problem in a distributed manner. The weighted L p preference index is utilized in each agent since it can provide a robust Pareto solution to the problem. By using distributed fixed-time optimization methods, the L p preference index is constructed online without specifying the unknown parameters. Then, it is proved that the problem admits a unique Pareto solution. By exploiting consensus and gradient descent techniques, asymptotic convergence to the optimal solution is established via Lyapunov theories. Distinct from most of the current works, the proposed framework does not require any prior information in the formulation process, and private data can be well protected using this distributed approach. Numerical examples are included to validate the effectiveness of the proposed algorithms.

Consensus-Based Cooperative Algorithms for Training Over Distributed Data Sets Using Stochastic Gradients

“…Bidimensional samples are used, which are randomly generated by a multivariate Gaussian distribution. We label the samples as l k i = 1 for those generated with a covariance matrix equal to the identity and mean equal to (0, 0), and as l k i = −1 for mean equal to (5,3).…”

“…O PTIMISATION and learning over distributed networks have been widely studied in recent years, owing to their significant potentials in many biological, engineering, and social applications [1][2][3][4][5][6]. Several critical limitations of the centralised methods can be addressed by the distributed algorithms: first, communicational requirement is relieved as information exchanges are confined to adjacent neighbours; second, local datasets can be kept private and do not need to be revealed to remote fusion centres; third, computational burdens are distributed into a set of agents, where each of them only needs to process its local datasets.…”

An Adaptive Deployment Algorithm for IaaS Cloud Virtual Machines Based on Q Learning Mechanism

“…(a) Resources are limited during task execution. When the traditional method is to schedule independent tasks, any number of tasks can be allocated in a certain resource, but when deploying virtual machines, it is necessary to provide sufficient resources for the host machines [12,13] (b) When the task is scheduled to the resource, the task can be expanded and processed 2.1.3. Problem Description.…”

Robust State Agreement in Switching Networks of Nonlinear Agents with Measurement Disturbances and Communication Delays

“…State agreement, which aims at forcing the agents to agree on the states via local interactions, is a basic group behavior with promising applications in many directions, such as synchronization of complex networks [1,2,3], formation control [4,5,6,7,8], distributed optimization [9,10,11,12] and etc.…”