Mechanical Engineering - Research Publications

Permanent URI for this collection

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

Filters

2013 - 2014 3
Reset filters

Settings
Statistics
Citations
Author: Manzie, Christopher × Author: Nesic, Dragan × Author: Tan, Ying × Start date: 2013 × Type: Conference Paper ×

Search Results

Now showing 1 - 3 of 3
  • Item
    Thumbnail Image
    Trajectory-based proofs for sampled-data extremum seeking control
    KHONG, S ; Nesic, D ; Tan, Y ; Manzie, CG (IEEE, 2013)
    Extremum seeking of nonlinear systems based on a sampled-data control law is revisited. It is established that under some generic assumptions, semi-global practical asymptotically stable convergence to an extremum can be achieved. To this end, trajectory-based arguments are employed, by contrast with Lyapunov-function-type approaches in the existing literature. The proof is simpler and more straightforward; it is based on assumptions that are in general easier to verify. The proposed extremum seeking framework may encompass more general optimisation algorithms, such as those which do not admit a state-update realisation and/or Lyapunov functions. Multi-unit extremum seeking is also investigated within the context of accelerating the speed of convergence.
  • Item
    Thumbnail Image
    On sampled-data extremum seeking control via stochastic approximation methods
    Khong, SZ ; Tan, Y ; Nesic, D ; Manzie, C (IEEE, 2013-01-01)
    This note establishes a link between stochastic approximation and extremum seeking of dynamical nonlinear systems. In particular, it is shown that by applying classes of stochastic approximation methods to dynamical systems via periodic sampled-data control, convergence analysis can be performed using standard tools in stochastic approximation. A tuning parameter within this framework is the period of the synchronised sampler and hold device, which is also the waiting time during which the system dynamics settle to within a controllable neighbourhood of the steady-state input-output behaviour. Semiglobal convergence with probability one is demonstrated for three basic classes of stochastic approximation methods: finite-difference, random directions, and simultaneous perturbation. The tradeoff between the speed of convergence and accuracy is also discussed within the context of asymptotic normality of the outputs of these optimisation algorithms.
  • Item
    Thumbnail Image
    Multi-agent gradient climbing via extremum seeking control
    Kong, SZ ; Manzie, CG ; Tan, Y ; Nesic, D (IFAC - International Federation of Automatic Control, 2014)
    A unified framework based on discrete-time gradient-based extremum seeking control is proposed to localise an extremum of an unknown scalar field distribution using a group of equipped with sensors. The controller utilises estimates of gradients of the field from local dithering sensor measurements collected by the mobile agents. It is assumed that distributed coordination which ensures uniform asymptotic stability with respect to a prescribed formation of the agents is employed. The framework is useful in 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 bounded field sampling noise.