Mechanical Engineering - Research Publications

Permanent URI for this collection

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

Filters
Reset filters

Settings
Statistics
Citations
Start date: 2000 × Author: Nesic, Dragan × Author: Tan, Ying × Type: Journal Article ×

Search Results

Now showing 1 - 10 of 15
  • Item
    No Preview Available
    A Multi-Processor Implementation for Networked Control Systems
    Maass, AI ; Wang, W ; Nesic, D ; Tan, Y ; Postoyan, R (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2023)
  • Item
    No Preview Available
    On state estimation for nonlinear systems under random access wireless protocols
    Maass, AI ; Nesic, D ; Postoyan, R ; Tan, Y (SPRINGER LONDON LTD, 2023-03-01)
    This article is dedicated to Eduardo D. Sontag on the occasion of his 70th birthday. We build upon fundamental stability concepts developed by Sontag, such as input-to-state stability and its related properties, to study a relevant application in industrial internet of things, namely estimation for wireless networked control systems. Particularly, we study emulation-based state estimation for nonlinear plants that communicate with a remote observer over a shared wireless network subject to packet losses. To reduce bandwidth usage, a stochastic communication protocol is employed to determine which node should be given access to the network. Each node has a different successful transmission probability. We describe the overall closed-loop system as a stochastic hybrid model, which allows us to capture the behaviour both between and at transmission instants, whilst covering network features such as random transmission instants, packet losses and stochastic scheduling. We then provide sufficient conditions on the transmission rate that guarantee an input-to-state stability property (in expectation) for the corresponding estimation error system. We illustrate our results in the design of circle criterion observers.
  • Item
    Thumbnail Image
    Stability and Persistent Excitation in Signal Sets
    Lee, T-C ; Tan, Y ; Nesic, D (IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC, 2015-05)
    Persistent excitation (PE) conditions have been widely used to analyze stability properties of various parameter identification algorithms and to establish uniform global asymptotic stability (UGAS) for a large class of nonlinear time-varying systems. In order to generalize such conditions to a more general setting, a new PE condition is proposed with three basic ingredients: a signal set to represent a family of time functions (e.g., trajectories); a pseudo distance measure to describe the convergence; and some binary relations (e.g., state-to-output relations). Closely related to detectability, this PE condition is a necessary condition to guarantee UGAS. Under uniform global stability and an integral inequality, it becomes a sufficient condition of UGAS. A novel concept: M-pair, which aims at simplifying the checking of the PE condition, is introduced. By using M-pair, it is possible to simplify the structure of the referred signal set (in the spirit of the classic Krasovskii-LaSalle theorem) and to extend the dimension of the reference signal set (similar to the Matrosov theorem). Thus, the framework of M-pair not only unifies these well-known results, but also generates more flexibility in checking the PE conditions. When applied to nonlinear switched systems, three new tools to verify the PE condition are obtained. Finally, an example illustrates that a nonlinear time-varying switched system with arbitrary switching can be shown to be UGAS without using a common Lyapunov function.
  • 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.
  • Item
    Thumbnail Image
    Multidimensional global extremum seeking via the DIRECT optimisation algorithm
    Khong, SZ ; Nesic, D ; Manzie, C ; Tan, Y (PERGAMON-ELSEVIER SCIENCE LTD, 2013-07-01)
    DIRECT is a sample-based global optimisation method for Lipschitz continuous functions defined over compact multidimensional domains. This paper adapts the DIRECT method with a modified termination criterion for global extremum seeking control of multivariable dynamical plants. Finite-time semi-global practical convergence is established based on a periodic sampled-data control law, whose sampling period is a parameter which determines the region and accuracy of convergence. A crucial part of the development is dedicated to a robustness analysis of the DIRECT method against bounded additive perturbations on the objective function. Extremum seeking involving multiple units is also considered within the same context as a means to increase the speed of convergence. Numerical examples of global extremum seeking based on DIRECT are presented at the end.
  • Item
    Thumbnail Image
    A non-gradient approach to global extremum seeking: An adaptation of the Shubert algorithm
    Nesic, D ; Thang, N ; Tan, Y ; Manzie, C (PERGAMON-ELSEVIER SCIENCE LTD, 2013-03-01)
    The main purpose of this paper is to adapt the so-called Shubert algorithm for extremum seeking control of general dynamic plants. This algorithm is a good representative of the "sampling optimization methods" that achieve global extremum seeking on compact sets in the presence of local extrema. The algorithm applies to Lipschitz mappings; the model of the system is assumed unknown but the knowledge of its Lipschitz constant is assumed. The controller depends on a design parameter, the "waiting time", and tuning guidelines that relate the design parameter and the region of convergence and accuracy of the algorithm are presented. The analysis shows that semi-global practical convergence (in the initial states) to the global extremum can be achieved in presence of local extrema if compact sets of inputs are considered. Numerical simulations for global optimization in the presence of local extrema are provided to demonstrate the proposed approach.
  • Item
    Thumbnail Image
    On Extremum Seeking in Bioprocesses with Multivalued Cost Functions
    Bastin, G ; Nesic, D ; Tan, Y ; Mareels, I (WILEY, 2009)
    Finding optimal operating modes for bioprocesses has been, for a long time, a relevant issue in bioengineering. The problem is of special interest when it implies the simultaneous optimization of competing objectives. In this paper, we address the problem of finding optimal steady states that achieve the best tradeoff between yield and productivity by using nonmodel-based extremum-seeking control with semiglobal practical stability and convergence properties. A special attention is paid to processes with multiple steady states and multivalued cost functions.
  • Item
    Thumbnail Image
    On global extremum seeking in the presence of local extrema
    Tan, Y ; Nesic, D ; Mareels, IMY ; Astolfi, A (PERGAMON-ELSEVIER SCIENCE LTD, 2009-01-01)
    We propose a global extremum seeking scheme which can seek the global optimal value in the presence of local extrema. It is shown that the proposed global extremum seeking scheme can converge to an arbitrarily small neighborhood of the global extremum from an arbitrarily large set of initial conditions if sufficient conditions are satisfied. A simple example illustrates the effectiveness of the proposed scheme.
  • Item
    Thumbnail Image
    On the choice of dither in extremum seeking systems: A case study
    Tan, Y ; Nesic, D ; Mareels, I (PERGAMON-ELSEVIER SCIENCE LTD, 2008-05-01)
    We discuss how the choice of dither (excitation signal) affects the performance of extremum seeking using a benchmark situation: a static scalar map; and a simple scalar extremum seeking scheme. Our comparisons are based on the performance of the system with different dithers in terms of three performance indicators: the speed of convergence, domain of attraction and accuracy (i.e. the ultimate bound on trajectories). Our analysis explicitly shows how the dither shape affects each of these performance indicators. Our study suggests that the practitioners using extremum seeking control should consider the dither shape as an important design parameter. Computer simulations support our theoretical findings.