activity
20202022
most citedUncertainty Intervals for Robust Bottleneck Assignment

6 citations · 8 across the 5 of their papers we have counts for

collaborators

9 papers

math.OC2023

Auction algorithm sensitivity for multi-robot task allocation

Katie Clinch, Tony A. Wood, Chris Manzie

We consider the problem of finding a low-cost allocation and ordering of tasks between a team of robots in a d-dimensional, uncertain, landscape, and the sensitivity of this soluti…

cs.RO2022

Probabilistic Data Association for Semantic SLAM at Scale

Elad Michael, Tyler Summers, Tony A. Wood +2

With advances in image processing and machine learning, it is now feasible to incorporate semantic information into the problem of simultaneous localisation and mapping (SLAM). Pre…

eess.SY2021

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

Tony A. Wood, Mitchell Khoo, Elad Michael +2

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 threa…

math.OC20201 cited

A Distributed Augmenting Path Approach for the Bottleneck Assignment Problem

Mitchell Khoo, Tony A. Wood, Chris Manzie +1

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…

math.OC2020

Exploiting Structure in the Bottleneck Assignment Problem

Mitchell Khoo, Tony A. Wood, Chris Manzie +1

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…

eess.SY20201 cited

Optimization with Zeroth-Order Oracles in Formation

Elad Michael, Daniel Zelazo, Tony A. Wood +2

In this paper, we consider the optimisation of time varying functions by a network of agents with no gradient information. The proposed a novel method to estimate the gradient at e…