40,641 research outputs found
Evolutionary L∞ identification and model reduction for robust control
An evolutionary approach for modern robust control oriented system identification and model reduction in the frequency domain is proposed. The technique provides both an optimized nominal model and a 'worst-case' additive or multiplicative uncertainty bounding function which is compatible with robust control design methodologies. In addition, the evolutionary approach is applicable to both continuous- and discrete-time systems without the need for linear parametrization or a confined problem domain for deterministic convex optimization. The proposed method is validated against a laboratory multiple-input multiple-output (MIMO) test rig and benchmark problems, which show a higher fitting accuracy and provides a tighter L�¢���� error bound than existing methods in the literature do
Recommended from our members
Derivation of near-optimal pump schedules for water distribution by simulated annealing
The scheduling of pumps for clean water distribution is a partially discrete non-linear problem with many variables. The scheduling method described in this paper typically produces costs within 1% of a linear program-based solution, and can incorporate realistic non-linear costs that may be hard to incorporate in linear programming formulations. These costs include pump switching and maximum demand charges. A simplified model is derived from a standard hydraulic simulator. An initial schedule is produced by a descent method. Two-stage simulated annealing then produces solutions in a few minutes. Iterative recalibration ensures that the solution agrees closely with the results from a full hydraulic simulation
A Tabu Search Based Approach for Graph Layout
This paper describes an automated tabu search based method for drawing general graph layouts with straight lines. To our knowledge, this is the first time tabu methods have been applied to graph drawing. We formulated the task as a multi-criteria optimization problem with a number of
metrics which are used in a weighted fitness function to measure the aesthetic
quality of the graph layout. The main goal of this work is to speed up the graph
layout process without sacrificing layout quality. To achieve this, we use a tabu
search based method that goes through a predefined number of iterations to minimize
the value of the fitness function. Tabu search always chooses the best solution in
the neighbourhood. This may lead to cycling, so a tabu list is used to store moves
that are not permitted, meaning that the algorithm does not choose previous
solutions for a set period of time. We evaluate the method according to the time
spent to draw a graph and the quality of the drawn graphs. We give experimental
results applied on random graphs and we provide statistical evidence that our
method outperforms a fast search-based drawing method (hill climbing) in execution
time while it produces comparably good graph layouts.We also demonstrate the method
on real world graph datasets to show that we can reproduce similar results in a
real world setting
- …