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 math.OCShow all

16 papers · 1 filter

math.OC2024★ 2 cited

A Hamilton-Jacobi-Bellman Approach to Ellipsoidal Approximations of Reachable Sets for Linear Time-Varying Systems

Vincent Liu, Chris Manzie, Peter M. Dower

Reachable sets for a dynamical system describe collections of system states that can be reached in finite time, subject to system dynamics. They can be used to guarantee goal satis…

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…

math.OC2022★ 14 cited

Gradient Free Cooperative Seeking of a Moving Source

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

In this paper, we consider the optimisation of a time varying scalar field by a network of agents with no gradient information. We propose a composite control law, blending extremu…

math.OC2021★ 1 cited

Zeroth-order optimisation on subsets of symmetric matrices with application to MPC tuning

Alejandro I. Maass, Chris Manzie, Iman Shames +1

This paper provides a zeroth-order optimisation framework for non-smooth and possibly non-convex cost functions with matrix parameters that are real and symmetric. We provide compl…

math.OC2021

Ordinal Optimisation and the Offline Multiple Noisy Secretary Problem

Robert Chin, Jonathan E. Rowe, Iman Shames +2

We study the success probability for a variant of the secretary problem, with noisy observations and multiple offline selection. Our formulation emulates, and is motivated by, prob…

math.OC2021

Sensitivity Analysis for Bottleneck Assignment Problems

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

In assignment problems, decision makers are often interested in not only the optimal assignment, but also the sensitivity of the optimal assignment to perturbations in the assignme…

math.OC2021

A Sequential Learning Algorithm for Probabilistically Robust Controller Tuning

Robert Chin, Chris Manzie, Iman Shames +2

We introduce a sequential learning algorithm to address a robust controller tuning problem, which in effect, finds (with high probability) a candidate solution satisfying the inter…

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…

math.OC2019

Ordinal Optimisation for the Gaussian Copula Model

Robert Chin, Jonathan E. Rowe, Iman Shames +2

We present results on the estimation and evaluation of success probabilities for ordinal optimisation over uncountable sets (such as subsets of ). Our formulation i…

math.OC2016

Analytical results for the multi-objective design of model-predictive control

Vincent Bachtiar, Chris Manzie, William H. Moase +1

In model-predictive control (MPC), achieving the best closed-loop performance under a given computational resource is the underlying design consideration. This paper analyzes the M…