IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v507y2025ics0096300325002942.html
   My bibliography  Save this article

Observer-based fixed-time topology identification and synchronization for complex networks via quantized pinning control strategy

Author

Listed:
  • Wu, Huaiqin
  • Zhao, Xueqing
  • Wang, Lingyan
  • Cao, Jinde

Abstract

This paper is concerned with observer-based topology identification and synchronization in fixed time for multi-weighted complex networks (MWCNs) with/without output couplings. Firstly, a new fixed-time stability criterion is developed for continuous nonlinear systems by utilizing incomplete beta function and beta function ratio. Secondly, a quantized pinning controller and several topology observers are designed respectively to realize the fixed-time topology identification (FTTI) and the fixed-time synchronization (FTS) objective. Thirdly, by applying Lyapunov functional approach, the proposed stability criteria and the inequality analysis technique, some sufficient conditions with respect to the FTTI and the FTS are addressed in terms of linear matrix inequalities (LMIs). Eventually, the Chua's chaotic circuit and the island micro-grid, as two practical application examples, are given to demonstrate the effectiveness of the designed control strategies and the correctness of the obtained theoretical results.

Suggested Citation

  • Wu, Huaiqin & Zhao, Xueqing & Wang, Lingyan & Cao, Jinde, 2025. "Observer-based fixed-time topology identification and synchronization for complex networks via quantized pinning control strategy," Applied Mathematics and Computation, Elsevier, vol. 507(C).
  • Handle: RePEc:eee:apmaco:v:507:y:2025:i:c:s0096300325002942
    DOI: 10.1016/j.amc.2025.129568
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300325002942
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.amc.2025.129568?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

    for a different version of it.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    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:eee:apmaco:v:507:y:2025:i:c:s0096300325002942. 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: Catherine Liu (email available below). General contact details of provider: https://www.journals.elsevier.com/applied-mathematics-and-computation .

    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.