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

Multi-pursuer single-evader privacy-preserving differential games

Author

Listed:
  • Zhou, Yinglu
  • Li, Yinya
  • Sheng, Andong
  • Qi, Guoqing

Abstract

This paper investigates a multi-pursuer single-evader (MPSE) differential game with privacy-preserving over time-varying unbalanced directed network topologies. A novel player decomposition mechanism for the MPSE differential game with privacy-preserving is proposed. Distributed control strategies under this mechanism are then designed based on the Hamilton–Jacobi–Isaacs (HJI) and the Nash equilibrium of these strategies is proved. The interception condition related to a proposed novel coupling gain and reconstructed symmetric Laplacian matrix based on the weight balancing method is derived to guarantee that multiple pursuers successfully intercept the evader over time-varying unbalanced directed network topologies. Privacy-preserving is also verified to ensure that the state of any pursuer is not disclosed. Especially, the privacy-preserving algorithm is proved to be applicable to the continuous-time system, which is different from most existing studies whose research system is the discrete-time case. Illustrative examples are given to demonstrate that all pursuers can intercept the evader and that the private information they carry can be preserved.

Suggested Citation

  • Zhou, Yinglu & Li, Yinya & Sheng, Andong & Qi, Guoqing, 2026. "Multi-pursuer single-evader privacy-preserving differential games," Applied Mathematics and Computation, Elsevier, vol. 508(C).
  • Handle: RePEc:eee:apmaco:v:508:y:2026:i:c:s0096300325003388
    DOI: 10.1016/j.amc.2025.129612
    as

    Download full text from publisher

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

    File URL: https://libkey.io/10.1016/j.amc.2025.129612?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:508:y:2026:i:c:s0096300325003388. 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.