IDEAS home Printed from https://ideas.repec.org/a/eee/apmaco/v524y2026ics0096300326000871.html

Finite-time P2P filtering for hidden Markov jump systems with adaptive memory event-triggered mechanism: A packet loss compensation strategy

Author

Listed:
  • Wang, Nan
  • Yu, Lu

Abstract

In this paper, the problem of finite-time packet loss compensation peak-to-peak (P2P) filtering for a class of Takagi-Sugeno fuzzy hidden Markov jump systems based on the mode-dependent adaptive memory event-triggered mechanism (AMETM) is studied. A hidden Markov model is used to describe the asynchronous phenomenon between the system and the filter. At the same time, assuming that the packet is discarded in the form of mode-dependent transition probability uncertainty before transmission to the filter, an event-triggered single exponential smoothing packet loss compensation scheme is designed to reduce the impact of network congestion and packet loss. In addition, to balance the relationship between P2P performance and data transmission, a mode-dependent AMETM with two dynamic threshold functions is improved. Furthermore, the sufficient conditions for the designed filter are obtained by using the fuzzy-dependent and mode-dependent Lyapunov functions to ensure the stochastic finite-time boundedness and satisfy the predetermined P2P performance. Finally, the effectiveness and superiority of the proposed method are verified by an example of a single-link manipulator system.

Suggested Citation

  • Wang, Nan & Yu, Lu, 2026. "Finite-time P2P filtering for hidden Markov jump systems with adaptive memory event-triggered mechanism: A packet loss compensation strategy," Applied Mathematics and Computation, Elsevier, vol. 524(C).
    • Handle: RePEc:eee:apmaco:v:524:y:2026:i:c:s0096300326000871
    DOI: 10.1016/j.amc.2026.130035
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0096300326000871
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.amc.2026.130035?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:524:y:2026:i:c:s0096300326000871. 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.