Electrical and Electronic Engineering - Research Publications

Permanent URI for this collection

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

Filters
Reset filters

Settings
Statistics
Citations
Author: Evans, Robin × End date: 2018 × Type: Conference Paper ×

Search Results

Now showing 1 - 9 of 9
  • Item
    Thumbnail Image
    On the use of switched linear controllers for stabilizability of implicit recursive equations
    Nesic, D (IEEE, 1998-01-01)
    Stabilizability of implicit recursive equations is investigated. These equations arise naturally in the context of output dead-beat control for systems described by NARMAX models. Due to non-uniqueness of the solutions of these equations a special kind of a constrained stabilizability problem is considered. We take a hybrid switching control approach in testing the existence of a locally stabilizing controller. A method for the design of a stabilizing switching controller is also presented.
  • Item
    Thumbnail Image
    Analysis of minimum phase properties for non-affine nonlinear systems
    Nesic, D ; Skafidas, E ; Mareels, IMY ; Evans, RJ (IEEE, 1997)
    A system can be termed non-minimum phase according to some definitions available in the literature and yet the same system may exhibit stable zero output constrained dynamics. We show that for non-affine nonlinear systems there may not exist a continuous control law which would keep the output identically equal to zero and for which the zero output constrained dynamics are stable, whereas a discontinuous controller which achieves this exists. We give conditions for existence and present a method for design of discontinuous switching controllers which yield stable zero dynamics. In this sense, the results of this paper enlarge the class of non-affine nonlinear systems that can be termed minimum-phase.
  • Item
    Thumbnail Image
    Lower Bounds on the Best-Case Complexity of Solving a Class of Non-cooperative Games
    Nekouei, E ; Alpcan, T ; Nair, GN ; Evans, RJ (Elsevier, 2016)
    This paper studies the complexity of solving the class G of all N-player non-cooperative games with continuous action spaces that admit at least one Nash equilibrium (NE). We consider a distributed Nash seeking setting where agents communicate with a set of system nodes (SNs), over noisy communication channels, to obtain the required information for updating their actions. The complexity of solving games in the class G is defined as the minimum number of iterations required to find a NE of any game in G with ε accuracy. Using information-theoretic inequalities, we derive a lower bound on the complexity of solving the game class G that depends on the Kolmogorov 2ε-capacity of the constraint set and the total capacity of the communication channels. We also derive a lower bound on the complexity of solving games in G which depends on the volume and surface area of the constraint set.
  • Item
  • Item
    Thumbnail Image
    An efficient self-healing process for ZigBee sensor networks
    Qiu, W ; Hao, P ; Evans, RJ (IEEE, 2007)
  • Item
    Thumbnail Image
    Optimum design for coherent optical OFDM transmitter
    Tang, Y ; Yi, X ; Shieh, W ; Evans, R (IEEE, 2007-01-01)
  • Item
    Thumbnail Image
    OPTIMAL INFINITE HORIZON CONTROL UNDER A LOW DATA RATE 2
    Nair, GN ; Huang, M ; Evans, RJ (Elsevier BV, 2006)
  • Item
    Thumbnail Image
    A DATA-RATE LIMITED VIEW OF ADAPTIVE CONTROL
    Zhang, GZ ; Nair, GN ; Evans, RJ ; Wittenmark, B (Elsevier BV, 2006)
  • Item
    Thumbnail Image
    Finite horizon LQ optimal control and computation with data rate constraints
    HUANG, M. ; NAIR, G. ; EVANS, R. (IEEE - Institute of Electrical and Electronic Engineers, 2005)