• Title/Summary/Keyword: Global Robust Optimization

Search Result 63, Processing Time 0.026 seconds

Optimazation of Simulated Fuzzy Car Controller Using Genetic Algorithm (유전자 알고즘을 이용한 자동차 주행 제어기의 최적화)

  • Kim Bong-Gi
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.1
    • /
    • pp.212-219
    • /
    • 2006
  • The important problem in designing a Fuzzy Logic Controller(FLC) is generation of fuzzy control rules and it is usually the case that they are given by human experts of the problem domain. However, it is difficult to find an well-trained expert to any given problem. In this paper, I describes an application of genetic algorithm, a well-known global search algorithm to automatic generation of fuzzy control rules for FLC design. Fuzzy rules are automatically generated by evolving initially given fuzzy rules and membership functions associated fuzzy linguistic terms. Using genetic algorithm efficient fuzzy rules can be generated without any prior knowledge about the domain problem. In addition expert knowledge can be easily incorporated into rule generation for performance enhancement. We experimented genetic algorithm with a non-trivial vehicle controling problem. Our experimental results showed that genetic algorithm is efficient for designing any complex control system and the resulting system is robust.

Strategy based PSO for Dynamic Control of UPFC to Enhance Power System Security

  • Mahdad, Belkacem;Bouktir, T.;Srairi, K.
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.3
    • /
    • pp.315-322
    • /
    • 2009
  • Penetration and installation of a new dynamic technology known as Flexible AC Transmission Systems (FACTS) in a practical and dynamic network requires and force expert engineer to develop robust and flexible strategy for planning and control. Unified Power Flow Controller (UPFC) is one of the recent and effective FACTS devices designed for multi control operation to enhance the power system security. This paper presents a dynamic strategy based on Particle Swarm Optimization (PSO) for optimal parameters setting of UPFC to enhance the system loadability. Firstly, we perform a multi power flow analysis with load incrementation to construct a global database to determine the initial efficient bounds associated to active power and reactive power target vector. Secondly a PSO technique applied to search the new parameters setting of the UPFC within the initial new active power and reactive power target bounds. The proposed approach is implemented with Matlab program and verified with IEEE 30-Bus test network. The results show that the proposed approach can converge to the near optimum solution with accuracy, and confirm that flexible multi-control of this device coordinated with efficient location enhance the system security of power system by eliminating the overloaded lines and the bus voltage violation.

As-Rigid-As-Possible Dynamic Deformation with Oriented Particles (방향성 입자를 이용한 ARAP 동적 변형)

  • Choi, Min Gyu
    • Journal of Korea Game Society
    • /
    • v.17 no.1
    • /
    • pp.89-98
    • /
    • 2017
  • This paper presents a novel ARAP (as-rigid-as-possible) approach to real-time simulation of physics-based deformation. To cope with one, two and three dimensional deformable bodies in an efficient, robust and uniform manner, we introduce a deformation graph of oriented particles and formulate the corresponding ARAP deformation energy. For stable time integration of the oriented particles, we develop an implicit integration scheme formulated in a variational form. Our method seeks the optimal positions and rotations of the oriented particles by iteratively applying an alternating local/global optimization scheme. The proposed method is easy to implement and computationally efficient to simulate complex deformable models in real time.

An Optimized Random Tree and Particle Swarm Algorithm For Distribution Environments

  • Feng, Zhou;Lee, Un-Kon
    • Journal of Distribution Science
    • /
    • v.13 no.6
    • /
    • pp.11-15
    • /
    • 2015
  • Purpose - Robot path planning, a constrained optimization problem, has been an active research area with many methods developed to tackle it. This study proposes the use of a Rapidly-exploring Random Tree and Particle Swarm Optimizer algorithm for path planning. Research design, data, and methodology - The grid method is built to describe the working space of the mobile robot, then the Rapidly-exploring Random Tree algorithm is applied to obtain the global navigation path and the Particle Swarm Optimizer algorithm is adopted to obtain the best path. Results - Computer experiment results demonstrate that this novel algorithm can rapidly plan an optimal path in a cluttered environment. Successful obstacle avoidance is achieved, the model is robust, and performs reliably. The effectiveness and efficiency of the proposed algorithm is demonstrated through simulation studies. Conclusions - The findings could provide insights to the validity and practicability of the method. This method makes it is easy to build a model and meet real-time demand for mobile robot navigation with a simple algorithm, which results in a certain practical value for distribution environments.

An Effective Orientation-based Method and Parameter Space Discretization for Defined Object Segmentation

  • Nguyen, Huy Hoang;Lee, GueeSang;Kim, SooHyung;Yang, HyungJeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.12
    • /
    • pp.3180-3199
    • /
    • 2013
  • While non-predefined object segmentation (NDOS) distinguishes an arbitrary self-assumed object from its background, predefined object segmentation (DOS) pre-specifies the target object. In this paper, a new and novel method to segment predefined objects is presented, by globally optimizing an orientation-based objective function that measures the fitness of the object boundary, in a discretized parameter space. A specific object is explicitly described by normalized discrete sets of boundary points and corresponding normal vectors with respect to its plane shape. The orientation factor provides robust distinctness for target objects. By considering the order of transformation elements, and their dependency on the derived over-segmentation outcome, the domain of translations and scales is efficiently discretized. A branch and bound algorithm is used to determine the transformation parameters of a shape model corresponding to a target object in an image. The results tested on the PASCAL dataset show a considerable achievement in solving complex backgrounds and unclear boundary images.

A Novel Stabilizing Control for Neural Nonlinear Systems with Time Delays by State and Dynamic Output Feedback

  • Liu, Mei-Qin;Wang, Hui-Fang
    • International Journal of Control, Automation, and Systems
    • /
    • v.6 no.1
    • /
    • pp.24-34
    • /
    • 2008
  • A novel neural network model, termed the standard neural network model (SNNM), similar to the nominal model in linear robust control theory, is suggested to facilitate the synthesis of controllers for delayed (or non-delayed) nonlinear systems composed of neural networks. The model is composed of a linear dynamic system and a bounded static delayed (or non-delayed) nonlinear operator. Based on the global asymptotic stability analysis of SNNMs, Static state-feedback controller and dynamic output feedback controller are designed for the SNNMs to stabilize the closed-loop systems, respectively. The control design equations are shown to be a set of linear matrix inequalities (LMIs) which can be easily solved by various convex optimization algorithms to determine the control signals. Most neural-network-based nonlinear systems with time delays or without time delays can be transformed into the SNNMs for controller synthesis in a unified way. Two application examples are given where the SNNMs are employed to synthesize the feedback stabilizing controllers for an SISO nonlinear system modeled by the neural network, and for a chaotic neural network, respectively. Through these examples, it is demonstrated that the SNNM not only makes controller synthesis of neural-network-based systems much easier, but also provides a new approach to the synthesis of the controllers for the other type of nonlinear systems.

Hybrid Genetic Operators of Hamming Distance and Fitness for Reducing Premature Convergence (조기수렴 저감을 위한 해밍거리와 적합도의 혼합 유전 연산자)

  • Lee, Hong-Kyu
    • Journal of Advanced Navigation Technology
    • /
    • v.18 no.2
    • /
    • pp.170-177
    • /
    • 2014
  • Genetic Algorithms are robust search and optimization techniques but have some problems such as premature convergence and convergence to local extremum. As population diversity converges to low value, the search ability decreases and converges to local extremum but population diversity converges to high value, then the search ability increases and converges to global optimum or genetic algorithm may diverge. To guarantee that genetic algorithms converge to the global optima, the genetic operators should be chosen properly. In this paper, we propose the genetic operators with the hybrid function of the average Hamming distance and the fitness value to maintain the diversity of the GA's population for escaping from the premature convergence. Results of simulation studies verified the effects of the mutation operator for maintaining diversity and the other operators for improving convergence properties as well as the feasibility of using proposed genetic operators on convergence properties to avoid premature convergence and convergence to local extremum.

Robust Intelligent Digital Redesign of Nonlinear System with Parametric Uncertainties (불확실성을 갖는 비선형 시스템의 강인한 지능형 디지털 재설계)

  • Sung, Hwa-Chang;Joo, Young-Hoon;Park, Jin-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.16 no.2
    • /
    • pp.138-143
    • /
    • 2006
  • This paper presents intelligent digital redesign method for hybrid state space fuzzy-model-based controllers. For effectiveness and stabilization of continuous-time uncertain nonlinear systems under discrete-time controller, Takagi-Sugeno(TS) fuzzy model is used to represent the complex system. And global approach design problems viewed as a convex optimization problem that we minimize the error of the norm bounds between nonlinearly interpolated linear operators to be matched. Also, by using the bilinear and inverse bilinear approximation method, we analyzed nonlinear system's uncertain parts more precisely. When a sampling period is sufficiently small, the conversion of a continuous-time structured uncertain nonlinear system to an equivalent discrete-time system have proper reason. Sufficiently conditions for the global state-matching of the digitally controlled system are formulated in terms of linear matrix inequalities (LMIs). Finally, a TS fuzzy model for the chaotic Lorentz system is used as an . example to guarantee the stability and effectiveness of the proposed method.

Development and implementation of a knowledge based TBM tunnel segment lining design program (지식기반형 TBM 터널 세그먼트 라이닝 설계 프로그램의 개발 및 적용)

  • Jeong, Yong-Jun;Yoo, Chung-Sik
    • Journal of Korean Tunnelling and Underground Space Association
    • /
    • v.16 no.3
    • /
    • pp.321-339
    • /
    • 2014
  • This paper concerns the development of a knowledge-based tunnel design system within the framework of artifical neural networks(ANNs). The system is aimed at expediting a routine tunnel design works such as computation of segment lining body forces and stability analysis of selected cross section. A number of sub-modules for computation of segment lining body forces and stability analysis were developed and implemented to the system. It is shown that the ANNs trained with the results of 3D numerical analyses can be generalized with a reasonable accuracy, and that the ANN based tunnel design concept is a robust tool for tunnel design optimization. The details of the system architecture and the ANNs development are discussed in this paper.

PC Cluster based Parallel Adaptive Evolutionary Algorithm for Service Restoration of Distribution Systems

  • Mun, Kyeong-Jun;Lee, Hwa-Seok;Park, June-Ho;Kim, Hyung-Su;Hwang, Gi-Hyun
    • Journal of Electrical Engineering and Technology
    • /
    • v.1 no.4
    • /
    • pp.435-447
    • /
    • 2006
  • This paper presents an application of the parallel Adaptive Evolutionary Algorithm (AEA) to search an optimal solution of the service restoration in electric power distribution systems, which is a discrete optimization problem. The main objective of service restoration is, when a fault or overload occurs, to restore as much load as possible by transferring the de-energized load in the out of service area via network reconfiguration to the appropriate adjacent feeders at minimum operational cost without violating operating constraints. This problem has many constraints and it is very difficult to find the optimal solution because of its numerous local minima. In this investigation, a parallel AEA was developed for the service restoration of the distribution systems. In parallel AEA, a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner are used in order to combine the merits of two different evolutionary algorithms: the global search capability of the GA and the local search capability of the ES. In the reproduction procedure, proportions of the population by GA and ES are adaptively modulated according to the fitness. After AEA operations, the best solutions of AEA processors are transferred to the neighboring processors. For parallel computing, a PC cluster system consisting of 8 PCs was developed. Each PC employs the 2 GHz Pentium IV CPU and is connected with others through switch based fast Ethernet. To show the validity of the proposed method, the developed algorithm has been tested with a practical distribution system in Korea. From the simulation results, the proposed method found the optimal service restoration strategy. The obtained results were the same as that of the explicit exhaustive search method. Also, it is found that the proposed algorithm is efficient and robust for service restoration of distribution systems in terms of solution quality, speedup, efficiency, and computation time.