 Electrical and Electronic Engineering  Research Publications
Electrical and Electronic Engineering  Research Publications
Permanent URI for this collection
8 results
Filters
Reset filtersSettings
Statistics
Citations
Search Results
Now showing
1  8 of 8

ItemCloseness of Solutions for Singularly Perturbed Systems via AveragingDeghat, M ; Ahmadizadeh, S ; Nesic, D ; Manzie, C ( 20180920)This paper studies the behavior of singularly perturbed nonlinear differential equations with boundarylayer solutions that do not necessarily converge to an equilibrium. Using the average of the fast variable and assuming the boundary layer solutions converge to a bounded set, results on the closeness of solutions of the singularly perturbed system to the solutions of the reduced average and boundary layer systems over a finite time interval are presented. The closeness of solutions error is shown to be of order O(\sqrt(\epsilon)), where \epsilon is the perturbation parameter.

ItemAdaptive Scan for Atomic Force Microscopy Based on Online Optimisation: Theory and ExperimentWang, K ; Ruppert, MG ; Manzie, C ; Nesic, D ; Yong, YK ( 20190211)A major challenge in Atomic Force Microscopy (AFM) is to reduce the scan duration while retaining the image quality. Conventionally, the scan rate is restricted to a sufficiently small value in order to ensure a desirable image quality as well as a safe tipsample contact force. This usually results in a conservative scan rate for samples that have a large variation in aspect ratio and/or for scan patterns that have a varying linear velocity. In this paper, an adaptive scan scheme is proposed to alleviate this problem. A scan linebased performance metric balancing both imaging speed and accuracy is proposed, and the scan rate is adapted such that the metric is optimised online in the presence of aspect ratio and/or linear velocity variations. The online optimisation is achieved using an extremumseeking (ES) approach, and a semiglobal practical asymptotic stability (SGPAS) result is shown for the overall system. Finally, the proposed scheme is demonstrated via both simulation and experiment.

ItemOrdinal Optimisation for the Gaussian Copula ModelChin, R ; Rowe, JE ; Shames, I ; Manzie, C ; Nešić, D ( 20191105)We present results on the estimation and evaluation of success probabilities for ordinal optimisation over uncountable sets (such as subsets of R d ). Our formulation invokes an assumption of a Gaussian copula model, and we show that the success probability can be equivalently computed by assuming a special case of additive noise. We formally prove a lower bound on the success probability under the Gaussian copula model, and numerical experiments demonstrate that the lower bound yields a reasonable approximation to the actual success probability. Lastly, we showcase the utility of our results by guaranteeing high success probabilities with ordinal optimisation.

ItemActive Learning for Linear ParameterVarying System IdentificationChin, R ; Maass, AI ; Ulapane, N ; Manzie, C ; Shames, I ; Nešić, D ; Rowe, JE ; Nakada, H ( 20200502)Active learning is proposed for selection of the next operating points in the design of experiments, for identifying linear parametervarying systems. We extend existing approaches found in literature to multipleinput multipleoutput systems with a multivariate scheduling parameter. Our approach is based on exploiting the probabilistic features of Gaussian process regression to quantify the overall model uncertainty across locally identified models. This results in a flexible framework which accommodates for various techniques to be applied for estimation of local linear models and their corresponding uncertainty. We perform active learning in application to the identification of a diesel engine airpath model, and demonstrate that measures of model uncertainty can be successfully reduced using the proposed framework.

ItemTracking and regret bounds for online zerothorder Euclidean and Riemannian optimisationMaass, AI ; Manzie, C ; Nesic, D ; Manton, JH ; Shames, I ( 20201001)We study numerical optimisation algorithms that use zerothorder information to minimise timevarying geodesicallyconvex cost functions on Riemannian manifolds. In the Euclidean setting, zerothorder algorithms have received a lot of attention in both the timevarying and timeinvariant cases. However, the extension to Riemannian manifolds is much less developed. We focus on Hadamard manifolds, which are a special class of Riemannian manifolds with global nonpositive curvature that offer convenient grounds for the generalisation of convexity notions. Specifically, we derive bounds on the expected instantaneous tracking error, and we provide algorithm parameter values that minimise the algorithm’s performance. Our results illustrate how the manifold geometry in terms of the sectional curvature affects these bounds. Additionally, we provide dynamic regret bounds for this online optimisation setting. To the best of our knowledge, these are the first regret bounds even for the Euclidean version of the problem. Lastly, via numerical simulations, we demonstrate the applicability of our algorithm on an online Karcher mean problem.

ItemA Sequential Learning Algorithm for Probabilistically Robust Controller TuningChin, R ; Manzie, C ; Shames, I ; Nešić, D ; Rowe, JE ( 20210218)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 internal performance constraint to a chanceconstrained program which has blackbox functions. The algorithm leverages ideas from the areas of randomised algorithms and ordinal optimisation, and also draws comparisons with the scenario approach; these have all been previously applied to finding approximate solutions for difficult design problems. By exploiting statistical correlations through blackbox sampling, we formally prove that our algorithm yields a controller meeting the prescribed probabilistic performance specification. Additionally, we characterise the computational requirement of the algorithm with a probabilistic lower bound on the algorithm's stopping time. To validate our work, the algorithm is then demonstrated for tuning model predictive controllers on a diesel engine airpath across a fleet of vehicles. The algorithm successfully tuned a single controller to meet a desired tracking error performance, even in the presence of the plant uncertainty inherent across the fleet. Moreover, the algorithm was shown to exhibit a sample complexity comparable to the scenario approach.

ItemOrdinal Optimisation and the Offline Multiple Noisy Secretary ProblemChin, R ; Rowe, JE ; Shames, I ; Manzie, C ; Nešić, D ( 20210602)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, problems involving noisy selection arising in the disciplines of stochastic simulation and simulationbased optimisation. In addition, we employ the philosophy of ordinal optimisation  involving an ordinal selection rule, and a percentile notion of goal softening for the success probability. As a result, it is shown that the success probability only depends on the underlying copula of the problem. Other general properties for the success probability are also presented. Specialising to the case of Gaussian copulas, we also derive an analytic lower bound for the success probability, which may then be inverted to find sufficiently large sample sizes that guarantee a high success probability arbitrarily close to one.

ItemTuning of multivariable model predictive controllersthrough expert bandit feedbackIra, AS ; Manzie, C ; Shames, I ; Chin, R ; Nesic, D ; Nakada, H ; Sano, T ( 20200209)For certain industrial control applications an explicit function capturing the nontrivial tradeoff between competing objectives in closed loop performance is not available. In such scenarios it is common practice to use the human innate ability to implicitly learn such a relationship and manually tune the corresponding controller to achieve the desirable closed loop performance. This approach has its deficiencies because of individual variations due to experience levels and preferences in the absence of an explicit calibration metric. Moreover, as the complexity of the underlying system and/or the controller increase, in the effort to achieve better performance, so does the tuning time and the associated tuning cost. To reduce the overall tuning cost, a tuning framework is proposed herein, whereby a supervised machine learning is used to extract the humanlearned cost function and an optimization algorithm that can efficiently deal with a large number of variables, is used for optimizing the extracted cost function. Given the interest in the implementation across many industrial domains and the associated high degree of freedom present in the corresponding tuning process, a Model Predictive Controller applied to air path control in a diesel engine is tuned for the purpose of demonstrating the potential of the framework.