Distributed Multiobjective Optimization for Network Resource Allocation of Multiagent Systems

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.