Electrical and Electronic Engineering - Research Publications

Permanent URI for this collection

http://hdl.handle.net/11343/362

Filters
Reset filters

Settings
Statistics
Citations
Author: Manzie, Christopher × Type: Journal Article ×

Search Results

Now showing 1 - 10 of 28
  • Item
    No Preview Available
    Sub-Optimal Moving Horizon Estimation in Feedback Control of Linear Constrained Systems
    Yang, Y ; Manzie, C ; Pu, Y (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2023)
  • Item
    No Preview Available
    Reachability of Linear Time-Invariant Systems via Ellipsoidal Approximations
    Liu, V ; Manzie, C ; Dower, PM (Elsevier BV, 2023-01-01)
  • Item
    No Preview Available
    TRACKING AND REGRET BOUNDS FOR ONLINE ZEROTH-ORDER EUCLIDEAN AND RIEMANNIAN OPTIMIZATION
    Maass, A ; Manzie, C ; Nesic, D ; Manton, JH ; Shames, I (SIAM PUBLICATIONS, 2022)
  • Item
    No Preview Available
    Sub-Optimal MPC With Dynamic Constraint Tightening
    Yang, Y ; Wang, Y ; Manzie, C ; Pu, Y (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2023)
  • Item
    No Preview Available
    An algorithm for the selection of linearisation points in non-linear systems: a diesel air-path case study
    Ahmadizadeh, S ; Maass, A ; Manzie, C ; Shames, I (TAYLOR & FRANCIS LTD, 2023-12-02)
  • Item
    Thumbnail Image
    Online optimization of spark advance in alternative fueled engines using extremum seeking control
    Mohammadi, A ; Manzie, C ; Nesic, D (Elsevier, 2014-08-01)
    Alternative fueled engines offer greater challenges for engine control courtesy of uncertain fuel composition. This makes optimal tuning of input parameters like spark advance extremely difficult in most existing ECU architectures. This paper proposes the use of grey-box extremum seeking techniques to provide real-time optimization of the spark advance in alternative fueled engines. Since practical implementation of grey-box extremum seeking methods is typically done using digital technology, this paper takes advantage of emulation design methods to port the existing continuous-time grey-box extremum seeking methods to discrete-time frameworks. The ability and flexibility of the proposed discrete-time framework is demonstrated through simulations and in practical situation using a natural gas fueled engine.
  • Item
    Thumbnail Image
    Sampled Data Model Predictive Idle Speed Control of Ultra-Lean Burn Hydrogen Engines
    Sharma, R ; Nesic, D ; Manzie, C (Institute of Electrical and Electronics Engineers, 2013-03-01)
    A model-based approach for the idle speed control of ultra-lean burn engines is presented. The results from model predictive control (MPC) are extended and collectively used with the existing sampled data control theory to obtain a rigorously developed idle speed control strategy. Controller is designed using MPC theory and facilitated by successive online linearizations of the nonlinear discrete-time model at each sampling instant. Simultaneously, the approximations due to the discretization of the nonlinear engine model are explicitly considered by designing the control within a previously proposed control design framework to obtain appropriate stability guarantees of an exact (unknown) discrete-time engine model. The proposed idle speed control method is experimentally validated on a prototype 6-cylinder hydrogen engine.
  • Item
    Thumbnail Image
    A Framework for Extremum Seeking Control of Systems With Parameter Uncertainties
    Nesic, D ; Mohammadi, A ; Manzie, C (Institute of Electrical and Electronics Engineers, 2013-02-01)
    Traditionally, the design of extremum seeking algorithm treats the system as essentially a black-box, which for many applications means disregarding known information about the model structure. In contrast to this approach, there have been recent examples where a known plant structure with uncertain parameters has been used in the online optimization of plant operation. However, the results for these approaches have been restricted to specific classes of plants and optimization algorithms. This paper seeks to provide general results and a framework for the design of extremum seekers applied to systems with parameter uncertainties. General conditions for an optimization method and a parameter estimator are presented so that their combination guarantees convergence of the extremum seeker for both static and dynamic plants. Tuning guidelines for the closed loop scheme are also presented. The generality and flexibility of the proposed framework is demonstrated through a number of parameter estimators and optimization algorithms that can be combined to obtain extremum seeking. Examples of anti-lock braking and model reference adaptive control are used to illustrate the effectiveness of the proposed framework.
  • Item
    Thumbnail Image
    Multi-agent source seeking via discrete-time extremum seeking control
    Khong, SZ ; Tan, Y ; Manzie, C ; Nesic, D (PERGAMON-ELSEVIER SCIENCE LTD, 2014-09)
    Recent developments in extremum seeking theory have established a general framework for the methodology, although the specific implementations, particularly in the context of multi-agent systems, have not been demonstrated. In this work, a group of sensor-enabled vehicles is used in the context of the extremum seeking problem using both local and global optimisation algorithms to locate the extremum of an unknown scalar field distribution. For the former, the extremum seeker exploits estimates of gradients of the field from local dithering sensor measurements collected by the mobile agents. It is assumed that a distributed coordination which ensures uniform asymptotic stability with respect to a prescribed formation of the agents is employed. An inherent advantage of the frameworks is that a broad range of nonlinear programming algorithms can be combined with a wide class of cooperative control laws to perform extreme source seeking. Semi-global practical asymptotically stable convergence to local extrema is established in the presence of field sampling noise. Subsequently, global extremum seeking with multiple agents is investigated and shown to give rise to robust practical convergence whose speed can be improved via computational parallelism. Nonconvex field distributions with local extrema can be accommodated within this global framework.
  • Item
    Thumbnail Image
    Unified frameworks for sampled-data extremum seeking control: Global optimisation and multi-unit systems
    Khong, SZ ; Nesic, D ; Tan, Y ; Manzie, C (PERGAMON-ELSEVIER SCIENCE LTD, 2013-09)
    Two frameworks are proposed for extremum seeking of general nonlinear plants based on a sampled-data control law, within which a broad class of nonlinear programming methods is accommodated. It is established that under some generic assumptions, semi-global practical convergence to a global extremum can be achieved. In the case where the extremum seeking algorithm satisfies a stronger asymptotic stability property, the converging sequence is also shown to be stable using a trajectory-based proof, as opposed to a Lyapunov-function- type approach. The former is more straightforward and insightful. This allows for more general optimisation algorithms than considered in existing literature, such as those which do not admit a state-update realisation and/or Lyapunov functions. Lying at the heart of the analysis throughout is robustness of the optimisation algorithms to additive perturbations of the objective function. Multi-unit extremum seeking is also investigated with the objective of accelerating the speed of convergence.