438 citations · 875 across the 77 of their papers we have counts for
11 papers · 2 filters
Rigid-profile input scheduling under constrained dynamics with a water network application
Adair Lang, Michael Cantoni, Farhad Farokhi +1
The motivation for this work stems from the problem of scheduling requests for flow at supply points along an automated network of open-water channels. The off-take flows are rigid…
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…
Approximate Midpoint Policy Iteration for Linear Quadratic Control
Benjamin Gravell, Iman Shames, Tyler Summers
We present a midpoint policy iteration algorithm to solve linear quadratic optimal control problems in both model-based and model-free settings. The algorithm is a variation of New…
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…
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…
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…