Electrical and Electronic Engineering - Research Publications

Permanent URI for this collection

Search Results

Now showing 1 - 10 of 17
  • Item
    Thumbnail Image
    Active Learning for Linear Parameter-Varying System Identification
    Chin, R ; Maass, AI ; Ulapane, N ; Manzie, C ; Shames, I ; Nešić, D ; Rowe, JE ; Nakada, H ( 2020-05-02)
    Active learning is proposed for selection of the next operating points in the design of experiments, for identifying linear parameter-varying systems. We extend existing approaches found in literature to multiple-input multiple-output 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 air-path model, and demonstrate that measures of model uncertainty can be successfully reduced using the proposed framework.
  • Item
    Thumbnail Image
    Tracking and regret bounds for online zeroth-order Euclidean and Riemannian optimisation
    Maass, AI ; Manzie, C ; Nesic, D ; Manton, JH ; Shames, I ( 2020-10-01)
    We study numerical optimisation algorithms that use zeroth-order information to minimise time-varying geodesically-convex cost functions on Riemannian manifolds. In the Euclidean setting, zeroth-order algorithms have received a lot of attention in both the time-varying and time-invariant 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.
  • Item
    Thumbnail Image
    Security metrics and synthesis of secure control systems
    Murguia, C ; Shames, I ; Ruths, J ; Nešić, D (Elsevier Inc., 2020-05-01)
    The term stealthy has come to encompass a variety of techniques that attackers can employ to avoid being detected. In this manuscript, for a class of perturbed linear time-invariant systems, we propose two security metrics to quantify the potential impact that stealthy attacks could have on the system dynamics by tampering with sensor measurements. We provide analysis tools to quantify these metrics for given system dynamics, control, and system monitor. Then, we provide synthesis tools (in terms of semidefinite programs) to redesign controllers and monitors such that the impact of stealthy attacks is minimized and the required attack-free system performance is guaranteed.
  • Item
    Thumbnail Image
    Tuning of multivariable model predictive controllersthrough expert bandit feedback
    Ira, AS ; Manzie, C ; Shames, I ; Chin, R ; Nesic, D ; Nakada, H ; Sano, T ( 2020-02-09)
    For certain industrial control applications an explicit function capturing the nontrivial trade-off 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 human-learned 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.
  • Item
    Thumbnail Image
    Information-theoretic privacy through chaos synchronization and optimal additive noise
    Murguia, C ; Shames, I ; Farokhi, F ; Nešić, D ; Farokhi, F (Springer, 2020)
    We study the problem of maximizing privacy of data sets by adding random vectors generated via synchronized chaotics oscillators. In particular, we consider the setup where information about data sets, queries, is sent through public (unsecured) communication channels to a remote station. To hide private features (specific entries) within the data set, we corrupt the response to queries by adding random vectors.We send the distorted query (the sum of the requested query and the random vector) through the public channel. The distribution of the additive random vector is designed to minimize the mutual information (our privacy metric) between private entries of the data set and the distorted query. We cast the synthesis of this distribution as a convex program in the probabilities of the additive random vector. Once we have the optimal distribution, we propose an algorithm to generate pseudorandom realizations from this distribution using trajectories of a chaotic oscillator. At the other end of the channel, we have a second chaotic oscillator, which we use to generate realizations from the same distribution. Note that if we obtain the same realizations on both sides of the channel, we can simply subtract the realization from the distorted query to recover the requested query. To generate equal realizations, we need the two chaotic oscillators to be synchronized, i.e., we need them to generate exactly the same trajectories on both sides of the channel synchronously in time. We force the two chaotic oscillators into exponential synchronization using a driving signal. Simulations are presented to illustrate our results.
  • Item
    No Preview Available
    Newton's method: sufficient conditions for practical and input-to-state stability
    Colabufo, GG ; Dower, PM ; Shames, I (ELSEVIER, 2020)
  • Item
    Thumbnail Image
    Active Learning for Linear Parameter-Varying System Identification
    Chin, R ; Maass, A ; Ulapane, N ; Manzie, C ; Shames, I ; Nesic, D ; Rowe, JE ; Nakada, H (ELSEVIER, 2020-01-01)
    Active learning is proposed for selection of the next operating points in the design of experiments, for identifying linear parameter-varying systems. We extend existing approaches found in literature to multiple-input multiple-output 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 air-path model, and demonstrate that measures of model uncertainty can be successfully reduced using the proposed framework.
  • Item
    No Preview Available
  • Item
    No Preview Available
    Distributed Signal Signature Minimization Via Network Topology Modification
    Zamani, M ; Shames, I ; Hunjet, R (ELSEVIER, 2020)
  • Item
    No Preview Available
    Exploiting Structure in the Bottleneck Assignment Problem
    Khoo, M ; Wood, TA ; Manzie, C ; Shames, I (ELSEVIER, 2020)