Optimal Speed Control System of Generator Based on Chaotic Particle Swarm Optimization

In view of real-time and operational requirements of the speed control system for generating, the method of determining the traditional PID control parameters seriously affected by the operator due to the use of the experience, not accurate enough. This paper proposed chaotic particle swarm optimization (PSO) and adjustment methods based on the traditional PID in the electro-hydraulic control, establish the state equation of the speed control system, and thus to design generator speed control system based on chaotic particle swarm optimization algorithm. The simulation experiments show that the regulator has better robustness and real-time compared to the traditional PID control method, and can provide optimal control in the light of the different types of the running point and the interference.

[1]  Piotr Indyk,et al.  Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[2]  Heng Tao Shen,et al.  Exploring Bit-Difference for Approximate KNN Search in High-dimensional Databases , 2005, ADC.

[3]  Yong Shi,et al.  A shrinking-based clustering approach for multidimensional data , 2005, IEEE Transactions on Knowledge and Data Engineering.

[4]  Jonathan Goldstein,et al.  When Is ''Nearest Neighbor'' Meaningful? , 1999, ICDT.

[5]  Russell C. Eberhart,et al.  A discrete binary version of the particle swarm algorithm , 1997, 1997 IEEE International Conference on Systems, Man, and Cybernetics. Computational Cybernetics and Simulation.

[6]  Anthony K. H. Tung,et al.  Spatial clustering in the presence of obstacles , 2001, Proceedings 17th International Conference on Data Engineering.

[7]  Ramesh C. Jain,et al.  Similarity indexing with the SS-tree , 1996, Proceedings of the Twelfth International Conference on Data Engineering.

[8]  Jiawei Han,et al.  Efficient and Effective Clustering Methods for Spatial Data Mining , 1994, VLDB.

[9]  Yong Shi,et al.  PanKNN: A Dimension-wise Approach to Similarity Search Problems , 2008, DMIN.

[10]  Elke Achtert,et al.  Efficient reverse k-nearest neighbor search in arbitrary metric spaces , 2006, SIGMOD Conference.

[11]  Hans-Peter Kriegel,et al.  The X-tree : An Index Structure for High-Dimensional Data , 2001, VLDB.

[12]  Charu C. Aggarwal,et al.  On the Surprising Behavior of Distance Metrics in High Dimensional Spaces , 2001, ICDT.

[13]  Ickjai Lee,et al.  AUTOCLUST+: Automatic Clustering of Point-Data Sets in the Presence of Obstacles , 2000, TSDM.

[14]  Charu C. Aggarwal,et al.  Towards meaningful high-dimensional nearest neighbor search by human-computer interaction , 2002, Proceedings 18th International Conference on Data Engineering.

[15]  T D Cockerell.  THE LAWS OF PHYSICS. , 2009, Science.

[16]  James C. Bezdek,et al.  Pattern Recognition with Fuzzy Objective Function Algorithms , 1981, Advanced Applications in Pattern Recognition.

[17]  Chi-Hoon Lee,et al.  Clustering spatial data when facing physical constraints , 2002, 2002 IEEE International Conference on Data Mining, 2002. Proceedings..

[18]  Ickjai Lee,et al.  AUTOCLUST: Automatic Clustering via Boundary Extraction for Mining Massive Point-Data Sets , 2000 .

[19]  Hans-Peter Kriegel,et al.  Optimal multi-step k-nearest neighbor search , 1998, SIGMOD '98.

[20]  Ronald Fagin,et al.  Efficient similarity search and classification via rank aggregation , 2003, SIGMOD '03.

[21]  Howard J. Hamilton,et al.  DBRS: A Density-Based Spatial Clustering Method with Random Sampling , 2003, PAKDD.

[22]  Hans-Jörg Schek,et al.  A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces , 1998, VLDB.