多个威胁引诱诱饵最短时间定位的时序逻辑规划
Temporal Logic Planning for Minimum-Time Positioning of Multiple Threat-Seduction Decoys
摘要：
可重复使用的诱饵提供了一个具有成本效益的替代品，通常用于保护地面资产免受威胁的一次性硬件。这种诱饵描绘虚假资产，以吸引威胁远离真正的资产。为了欺骗威胁，诱饵首先必须定位自己，以便它可以打破雷达锁定。考虑到多个同时存在的威胁，本文提出了一种控制多个诱饵的方法，以最小化破解所有威胁锁所需的时间。该方法包括一个诱饵的最佳分配给每一个威胁的分配过程，提供本地位置的限制，以保证避免碰撞，从而简化了控制的诱饵。一个粗略的模型与不确定性的诱饵被认为是运动规划。诱饵的任务达到一个状态，其中所分配的威胁的锁可以被打破制定为一个时间逻辑规范。为此，完成任务的要求建模为随时间变化的集合成员资格的约束。的时间和逻辑组合的约束编码在一个混合整数优化问题。为了证明结果，提供了一个模拟案例研究。
英文摘要：
Reusable decoys offer a cost-effective alternative to the single-use hardware commonly applied to protect surface assets from threats. Such decoys portray fake assets to lure threats away from the true asset. To deceive a threat, a decoy first has to position itself such that it can break the radar lock. Considering multiple simultaneous threats, this paper introduces an approach for controlling multiple decoys to minimise the time required to break the locks of all the threats. The method includes the optimal allocation of one decoy to every threat with an assignment procedure that provides local position constraints to guarantee collision avoidance and thereby decouples the control of the decoys. A crude model of a decoy with uncertainty is considered for motion planning. The task of a decoy reaching a state in which the lock of the assigned threat can be broken is formulated as a temporal logic specification. To this end, the requirements to complete the task are modelled as time-varying set-membership constraints. The temporal and logical combination of the constraints is encoded in a mixed-integer optimisation problem. To demonstrate the results a simulated case study is provided.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
