New heuristic-based design of robust power system stabilizers

This paper proposes a new robust design of power system stabilizers (PSSs) in a multimachine power system using a heuristic optimization method. The structure of each PSS used is similar to that of a conventional lead/lag stabilizer. The proposed design regards a multimachine power system with PSSs as a multi-input multi-output (MIMO) control system. Additionally, a multiplicative uncertainty model is taken into account in the power system representation. Accordingly, the robust stability margin can be guaranteed by a multiplicative stability margin (MSM). The presented method utilizes the MSM as the design specification for robust stability. To acquire the control parameters of PSSs, a control design in MIMO system is formulated as an optimization problem. In the selection of objective function, not only disturbance attenuation performance but also robust stability indices are considered. Subsequently, the hybrid tabu search and evolutionary programming (hybrid TS/EP) is employed to search for the optimal parameters. The significant effects of designed PSSs are investigated under several system operating conditions

Minimum Density Hyperplanes

Associating distinct groups of objects (clusters) with contiguous regions of high probability density (high-density clusters), is central to many statistical and machine learning approaches to the classification of unlabelled data. We propose a novel hyperplane classifier for clustering and semi-supervised classification which is motivated by this objective. The proposed minimum density hyperplane minimises the integral of the empirical probability density function along it, thereby avoiding intersection with high density clusters. We show that the minimum density and the maximum margin hyperplanes are asymptotically equivalent, thus linking this approach to maximum margin clustering and semi-supervised support vector classifiers. We propose a projection pursuit formulation of the associated optimisation problem which allows us to find minimum density hyperplanes efficiently in practice, and evaluate its performance on a range of benchmark datasets. The proposed approach is found to be very competitive with state of the art methods for clustering and semi-supervised classification