论文标题
使用多UAV时空阵线分配的限制空域保护
Restricted Airspace Protection using Multi-UAV Spatio-TemporalMulti-Task Allocation
论文作者
论文摘要
本文解决了使用合作多动力学系统的限制空域保护免受入侵者的限制问题。目的是在入侵者进入受限制空域之前，由一群均质无人机（称为逃避者）合作检测并捕获入侵者。限制空域保护问题的问题被提出为多uav时空多任务分配问题，并被称为必须使用的MTA。必须使用基于修改的共识捆绑拍卖方法来解决必须MTA问题。在这里，通过合并空间和时间损耗组件来处理空间和时间限制。该解决方案确定了逃避者在特定时间瞬间到达的空间位置的序列，以中和入侵者。在模拟环境中评估了使用共识方法的Must-MTA的性能。蒙特 - 卡洛模拟结果清楚地表明了所提出的方法在限制空域保护对入侵者中的功效
This paper addresses the problem of restricted airspace protection from invaders using the cooperative multi-UAV system. The objective is to detect and capture the invaders cooperatively by a team of homogeneous UAVs (called evaders)before invaders enter the restricted airspace. The problem of restricted airspace protection problem is formulated as a Multi-UAV Spatio-Temporal Multi-Task Allocation problem and is referred as MUST-MTA. The MUST-MTA problem is solved using a modified consensus-based bundled auction method. Here, the spatial and time constraints are handled by combining both spatial and temporal loss component. The solution identifies the sequence of spatial locations to be reached by the evader at specific time instants to neutralize the invaders. The performance of MUST-MTA with the consensus approach is evaluated in a simulated environment. The Monte-Carlo simulation results clearly indicate the efficacy of the proposed approach in restricted airspace protection against intruders
