activity
20162024
most citedMinimizing Pumping Energy Cost in Real-time Operations of Water Distribution Systems using Economic Model Predictive Control

38 citations · 143 across the 42 of their papers we have counts for

collaborators
Showing 2020 · math.OCShow all

7 papers · 2 filters

math.OC2020★ 1 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

Tracking and regret bounds for online zeroth-order Euclidean and Riemannian optimisation

Alejandro I. Maass, Chris Manzie, Dragan Nesic +2

We study numerical optimisation algorithms that use zeroth-order information to minimise time-varying geodesically-convex cost functions on Riemannian manifolds. In the Euclidean s…

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…

math.OC2020

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

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

Solving the Lexicographic Bottleneck Assignment Problem (LexBAP) typically relies on centralised computation with order quartic complexity. We consider the Sequential Bottleneck As…

math.OC2020★ 6 cited

Uncertainty Intervals for Robust Bottleneck Assignment

Elad Michael, Tony A. Wood, Chris Manzie +1

We examine the robustness of bottleneck assignment problems to perturbations in the assignment weights. We derive two algorithms that provide uncertainty bounds for robust assignme…

math.OC2020

Global Sensitivity Analysis for the Linear Assignment Problem

Elad Michael, Tony A. Wood, Chris Manzie +1

In this paper, the following question is addressed: given a linear assignment problem, how much can the all of the individual assignment weights be perturbed without changing the o…

math.OC2020★ 8 cited

Collision Avoidance Based on Robust Lexicographic Task Assignment

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

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