Výsledky vyhledávání - "Khoo, Mitchell"

Report

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

Autor: Wood, Tony A., Khoo, Mitchell, Michael, Elad, Manzie, Chris, Shames, Iman

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

Externí odkaz: http://arxiv.org/abs/2106.09252

Zobrazit plný text záznamu

Report

A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

Autor: Khoo, Mitchell, Wood, Tony A., Manzie, Chris, Shames, Iman

We develop an algorithm to solve the Bottleneck Assignment Problem (BAP) that is amenable to having computation distributed over a network of agents. This consists of exploring how each component of the algorithm can be distributed, with a focus on o

Externí odkaz: http://arxiv.org/abs/2011.09606

Zobrazit plný text záznamu

Report

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

Autor: Khoo, Mitchell, Wood, Tony A., Manzie, Chris, Shames, Iman

Solving the Lexicographic Bottleneck Assignment Problem (LexBAP) typically relies on centralised computation with order quartic complexity. We consider the Sequential Bottleneck Assignment Problem (SeqBAP), which yields a greedy solution to the LexBA

Externí odkaz: http://arxiv.org/abs/2008.12508

Zobrazit plný text záznamu

Report

Exploiting Structure in the Bottleneck Assignment Problem

Autor: Khoo, Mitchell, Wood, Tony A., Manzie, Chris, Shames, Iman

An assignment problem arises when there exists a set of tasks that must be allocated to a set of agents. The bottleneck assignment problem (BAP) has the objective of minimising the most costly allocation of a task to an agent. Under certain condition

Externí odkaz: http://arxiv.org/abs/2008.10804

Zobrazit plný text záznamu

Report

Collision Avoidance Based on Robust Lexicographic Task Assignment

Autor: Wood, Tony A., Khoo, Mitchell, Michael, Elad, Manzie, Chris, Shames, Iman

Traditional task assignment approaches for multi-agent motion control do not take the possibility of collisions into account. This can lead to challenging requirements for path planning. We derive an assignment method that not only minimises the larg

Externí odkaz: http://arxiv.org/abs/2002.11247

Zobrazit plný text záznamu