A Greedy and Distributable Approach to the Lexicographic Bottleneck Assignment Problem with Conditions on Exactness

Khoo, Mitchell; Wood, Tony; Manzie, Chris; Shames, Iman

doi:10.48550/arxiv.2008.12508

Cited by 1 publication

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Remark 4. Determining bottleneck edges and robustness margins of all orders has a complexity of O(mn 3 ), see [18], [38].…”

Section: B Threat Assignmentmentioning

confidence: 99%

“…Remark 5. In [38] an algorithm finds a sequential bottleneck optimising assignment without centralised decision making. Agents only have knowledge of weights associated with them, e.g., decoy i ∈ D knows the subset of weights W i := {∆ i,j | j ∈ T }, and communicate local estimates of maximum and minimum global weights to other agents.…”

Section: B Threat Assignmentmentioning

confidence: 99%

See 1 more Smart Citation

Temporal Logic Planning for Minimum-Time Positioning of Multiple Threat-Seduction Decoys

Wood¹,

Khoo²,

Elad³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

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.

show abstract

“…Remark 4. Determining bottleneck edges and robustness margins of all orders has a complexity of O(mn 3 ), see [18], [38].…”

Section: B Threat Assignmentmentioning

confidence: 99%

Section: B Threat Assignmentmentioning

confidence: 99%

Temporal Logic Planning for Minimum-Time Positioning of Multiple Threat-Seduction Decoys

Wood¹,

Khoo²,

Elad³

et al. 2021

Preprint

Self Cite

View full text Add to dashboard Cite

show abstract

A Greedy and Distributable Approach to the Lexicographic Bottleneck Assignment Problem with Conditions on Exactness

Cited by 1 publication

References 17 publications

Temporal Logic Planning for Minimum-Time Positioning of Multiple Threat-Seduction Decoys

Temporal Logic Planning for Minimum-Time Positioning of Multiple Threat-Seduction Decoys

Contact Info

Product

Resources

About