A Class of Perimeter Defense Strategy via Relative Time and Maximum Matching
This paper studies a class of perimeter defense problems for large-scale multi-robot systems. A perimeter defense strategy is designed via relative time calculations and maximum matching methods. The strategy is simple, effective, and easy to implement for large-scale perimeter defense problems. Some simulations are made to verify the effectiveness of the strategy.
Authors
- Bomin Huang (ORCID: https://orcid.org/0000-0003-2397-6738)
- Zi‐Yi Du (ORCID: https://orcid.org/0000-0002-2794-7670)
- Lixiong Lin (ORCID: https://orcid.org/0000-0002-9829-5358)
- Guangtong Xu (ORCID: https://orcid.org/0000-0003-0683-5992)
- Chengqian Yang
Institutions
- Jimei University (CN)
- Huzhou Normal University (CN)
- Zhejiang University (CN)
- Northeastern University (CN)
- Tsinghua University (CN)
Publication Details
- Published
- 2024-11-01
- DOI
- https://doi.org/10.1109/cac63892.2024.10864873
- Citations
- 1
- Primary Topic
- Guidance and Control Systems
- Type
- article
- Field-Weighted Citation Impact
- 1.30