2021/06/17 by Tony A. Wood, Wood, Tony A., Mitchell Khoo +7
Computer Science · #Formal Methods in Verification #AI-based Problem Solving and Planning #Software Testing and Debugging Techniques
paper · pdf · doi:10.48550/arxiv.2106.09252
Reusable decoys offer a cost-effective alternative to the single-use hardware\ncommonly applied to protect surface assets from threats. Such decoys portray\nfake assets to lure threats away from the true asset. To deceive a threat, a\ndecoy first has to position itself such that it can break the radar lock.\nConsidering multiple simultaneous threats, this paper introduces an approach\nfor controlling multiple decoys to minimise the time required to break the\nlocks of all the threats. The method includes the optimal allocation of one\ndecoy to every threat with an assignment procedure that provides local position\nconstraints to guarantee collision avoidance and thereby decouples the control\nof the decoys. A crude model of a decoy with uncertainty is considered for\nmotion planning. The task of a decoy reaching a state in which the lock of the\nassigned threat can be broken is formulated as a temporal logic specification.\nTo this end, the requirements to complete the task are modelled as time-varying\nset-membership constraints. The temporal and logical combination of the\nconstraints is encoded in a mixed-integer optimisation problem. To demonstrate\nthe results a simulated case study is provided.\n