Time-varying multi-objective optimisation over switching graphs via fixed-time consensus algorithms

This paper considers distributed multi-objective optimisation problems with time-varying cost functions for network-connected multi-agent systems over switching graphs. The scalarisation approach is used to convert the problem into a weighted-sum objective. Fixed-time consensus algorithms are develo...

Full description

Saved in:
Bibliographic Details
Published in:International journal of systems science Vol. 51; no. 15; pp. 2793 - 2806
Main Authors: Li, Zhongguo, Ding, Zhengtao
Format: Journal Article
Language:English
Published: London Taylor & Francis 17.11.2020
Taylor & Francis Ltd
Subjects:
Adaptive algorithms
Algorithms
Consensus
Convergence
Cost function
distributed algorithm
gradient descent
Graphs
multi-agent systems
Multiagent systems
Multiple objective analysis
optimisation
Pareto optimization
Switching
ISSN:0020-7721, 1464-5319
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper considers distributed multi-objective optimisation problems with time-varying cost functions for network-connected multi-agent systems over switching graphs. The scalarisation approach is used to convert the problem into a weighted-sum objective. Fixed-time consensus algorithms are developed for each agent to estimate the global variables and drive all local copies of the decision vector to a consensus. The algorithm with fixed gains is first proposed, where some global information is required to choose the gains. Then, an adaptive algorithm is presented to eliminate the use of global information. The convergence of those algorithms to the Pareto solutions is established via Lyapunov theory for connected graphs. In the case of disconnected graphs, the convergence to the subsets of the Pareto fronts is studied. Simulation results are provided to demonstrate the effectiveness of the proposed algorithms.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0020-7721
1464-5319
DOI:10.1080/00207721.2020.1801885