IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v13y2025i15p2420-d1711221.html
   My bibliography  Save this article

A Class of Perimeter Defense Strategies Based on Priority Path Planning

Author

Listed:
  • Shuang Zhang

    (College of Computer Engineering, Jimei University, Xiamen 361021, China)

  • Chengqian Yang

    (School of Control Engineering, Northeastern University at Qinhuangdao, Qinhuangdao 066004, China)

  • Shiwei Lin

    (College of Computer Engineering, Jimei University, Xiamen 361021, China)

  • Bomin Huang

    (College of Computer Engineering, Jimei University, Xiamen 361021, China)

Abstract

This paper investigates perimeter defense strategies for multi-agent systems. Considering the complex scenario with multiple obstacles in the mission environment, a defense strategy based on prioritized path planning is proposed in this paper. The strategy employs a minimum weight matching method to solve the optimal task assignment for interception and determines the task priority based on the relative time window. Meanwhile, the swarm path planning is realized using particle swarm optimization with a designed cost function. Compared with the existing literature, the proposed method can handle large-scale agent-based perimeter defense while accounting for inter-defender collision avoidance and obstacle avoidance. The effectiveness of the strategy is verified through simulation in the mission scenario.

Suggested Citation

  • Shuang Zhang & Chengqian Yang & Shiwei Lin & Bomin Huang, 2025. "A Class of Perimeter Defense Strategies Based on Priority Path Planning," Mathematics, MDPI, vol. 13(15), pages 1-20, July.
  • Handle: RePEc:gam:jmathe:v:13:y:2025:i:15:p:2420-:d:1711221
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/13/15/2420/pdf
    Download Restriction: no

    File URL: https://www.mdpi.com/2227-7390/13/15/2420/
    Download Restriction: no
    ---><---

    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:gam:jmathe:v:13:y:2025:i:15:p:2420-:d:1711221. 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    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.