IDEAS home Printed from https://ideas.repec.org/a/taf/tsysxx/v51y2020i15p2793-2806.html
   My bibliography  Save this article

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

Author

Listed:
  • Zhongguo Li
  • Zhengtao Ding

Abstract

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.

Suggested Citation

  • Zhongguo Li & Zhengtao Ding, 2020. "Time-varying multi-objective optimisation over switching graphs via fixed-time consensus algorithms," International Journal of Systems Science, Taylor & Francis Journals, vol. 51(15), pages 2793-2806, November.
    • Handle: RePEc:taf:tsysxx:v:51:y:2020:i:15:p:2793-2806
    DOI: 10.1080/00207721.2020.1801885
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207721.2020.1801885
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207721.2020.1801885?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:taf:tsysxx:v:51:y:2020:i:15:p:2793-2806. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TSYS20 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.