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

Zhongguo Li, Zhengtao Ding · International Journal of Systems Science · 2020

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.

Read the paper · More papers on PaperTik