We first present a method, called Two-Phase Pareto Local Search, to find a good approximation of the efficient set of the biobjective traveling salesman problem. In the first p...
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
In today’s high-performance computational environments communication substrates often stand out as the major limiting factor to performance, accessibility, and stability. Such p...
Conventional MPC uses quadratic programming (QP) to minimise, on-line, a cost over n linearly constrained control moves. However, stability constraints often require the use of la...
Basil Kouvaritakis, Mark Cannon, J. Anthony Rossit...
Hepatitis B virus (HBV) infection is endemic in many parts of the world. One of the characteristics of HBV transmission is the age structure of the host population. In this paper, ...