4.5 Article

A Decentralized Multi-objective Optimization Algorithm

期刊

出版社

SPRINGER/PLENUM PUBLISHERS
DOI: 10.1007/s10957-021-01840-z

关键词

Multi-agent systems; Distributed optimization; Pareto front; Multi-objective optimization

资金

  1. Fonds de recherche Nature et technologies postdoctoral fellowship
  2. AFOSR [FA9550-19-1-0169]

向作者/读者索取更多资源

In this study, a distributed optimization algorithm is proposed to explore Pareto optimal solutions for non-homogeneously weighted sums of objective functions. Agents initially disagree on the priorities of objective functions, but are gradually driven to reach a consensus as they optimize, ultimately reaching a common solution.
During the past few decades, multi-agent optimization problems have drawn increased attention from the research community. When multiple objective functions are present among agents, many works optimize the sum of these objective functions. However, this formulation implies a decision regarding the relative importance of each objective: optimizing the sum is a special case of a multi-objective problem in which all objectives are prioritized equally. To enable more general prioritizations, we present a distributed optimization algorithm that explores Pareto optimal solutions for non-homogeneously weighted sums of objective functions. This exploration is performed through a new rule based on agents' priorities that generates edge weights in agents' communication graph. These weights determine how agents update their decision variables with information received from other agents in the network. Agents initially disagree on the priorities of objective functions, though they are driven to agree upon them as they optimize. As a result, agents still reach a common solution. The network-level weight matrix is (non-doubly) stochastic, contrasting with many works on the subject in which the network-level weight matrix is doubly-stochastic. New theoretical analyses are therefore developed to ensure convergence of the proposed algorithm. This paper provides a gradient-based optimization algorithm, proof of convergence to solutions, and convergence rates of the proposed algorithm. It is shown that agents' initial priorities influence the convergence rate of the proposed algorithm and that these initial choices affect its long-run behavior. Numerical results performed with different numbers of agents illustrate the performance and effectiveness of the proposed algorithm.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.5
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据