In this article, a dynamic resource allocation with decentralized multi-task assignment (DREAM) approach using a dynamic sized team of defenders is presented to protect a perimeter of a high-security area from heterogeneous intruders. In the DREAM approach, the spatio-temporal problem of neutralizing the heterogeneous intruders is converted into a decentralized time-ordered multi-task assignment problem. A single-step dynamic resource allocation algorithm based on the computed assignments determines an optimal number of defenders required. The DREAM approach adds more defenders to the team from the reserve stations or removes the excess defenders from the team such that it always utilizes minimal resources for protecting convex territory. A trajectory computation algorithm converts the optimal multi-task assignments to trajectories for the defenders. The working of the DREAM approach for a typical perimeter defense problem is illustrated using a simulated convex territory protection problem. Based on the results from the ablation study, it is seen that one needs to deploy a higher number of defenders in the team for a better success rate to handle highly maneuvering intruders. Furthermore, a higher defender-to-intruder speed ratio helps in better resource utilization. These results clearly indicate that the DREAM approach can protect any convex territory efficiently with minimal resources.

中文翻译：

---

周界防御问题的分散多任务分配方法的动态资源分配


在本文中，提出了一种使用动态规模的防御者团队的分散多任务分配（DREAM）方法的动态资源分配，以保护高安全区域的周边免受异构入侵者的侵害。在DREAM方法中，中和异构入侵者的时空问题被转换为分散的时间顺序多任务分配问题。基于计算分配的单步动态资源分配算法确定所需的最佳防御者数量。 DREAM 方法从预备站向球队添加更多的防守者，或者从球队中移除多余的防守者，这样它总是利用最少的资源来保护凸面区域。轨迹计算算法将最佳多任务分配转换为防御者的轨迹。使用模拟凸区域保护问题说明了 DREAM 方法针对典型周界防御问题的工作原理。根据消融研究的结果可以看出，需要在团队中部署更多数量的防御者，才能提高应对高机动性入侵者的成功率。此外，更高的防御者与入侵者速度比有助于更好的资源利用率。这些结果清楚地表明，DREAM 方法可以用最少的资源有效地保护任何凸区域。