• 제목/요약/키워드: Evolutionary Algorithm (EA)

검색결과 17건 처리시간 0.029초

안티와인드업 기법을 가지는 PID 제어기의 EA 기반 동조 (EA-based Tuning of a PID Controller with an Anti-windup Scheme)

  • 진강규;박동진
    • 제어로봇시스템학회논문지
    • /
    • 제19권10호
    • /
    • pp.867-872
    • /
    • 2013
  • Many practical processes in industry have nonlinearities of some forms. One commonly encountered form is actuator saturation which can cause a detrimental effect known as integrator windup. Therefore, a strategy of attenuating the effects of integrator windup is required to guarantee the stability and performance of the overall control system. In this paper, optimal tuning of a PID (Proportional-Integral-Derivative) controller with an anti-windup scheme is presented to enhance the tracking performance of the PID control system in the presence of the actuator saturation. First, we investigate effective anti-windup schemes. Then, the parameters of both the PID controller and the anti-windup scheme are optimally tuned by an EA (Evolutionary Algorithm) such as the IAE (Integral of Absolute Error) is minimized. A set of simulation works on two high-order processes demonstrates the benefit of the proposed method.

RFID 리더기 안테나의 최적 배치를 위한 효율적인 진화 연산 알고리즘 (An Efficient Evolutionary Algorithm for Optimal Arrangement of RFID Reader Antenna)

  • 순남순;여명호;유재수
    • 한국콘텐츠학회논문지
    • /
    • 제9권10호
    • /
    • pp.40-50
    • /
    • 2009
  • RFID 기술를 이용한 다양한 응용분야에서 잘못된 RFID 리더기의 배치로 인해 리더기간의 간섭이 발생한다. 리더기간의 간섭은 어떤 리더기가 다른 리더기의 동작에 간섭을 일으키는 신호를 송신하여 태그를 인식하는 것을 방해할 때 발생한다. RFID 시스템에서 리더기의 충돌 문제는 시스템 처리량과 인식의 효율성의 병목현상을 발생 시킨다. 본 논문에서는 RIFD 안테나 배치의 적합도를 높이기 위해서 진화 연산 알고리즘을 이용한 새로운 RFID 리더기 배치 설계 시스템을 제안한다. 먼저, 주위 환경에 민감한 안테나의 전파 특성을 분석하고, 특성 데이터베이스를 구축한다. 그리고, 안테나를 최적으로 배치하기 위한 진화 연산 알고리즘을 이용한 Encoding 기법과 Fitness 기법 및 유전잔 연산자를 제안한다. 제안하는 기법의 우수성을 보이기 위해서 시뮬레이션을 수행하였으며, 실험 결과, 약 100세대의 진화 연산을 통해 커버율 95.45%, 간섭율 10.29%의 RFID 안테나 배치의 적합도를 달성하였다.

공생 진화알고리듬을 이용한 확장된 hub-and-spoke 수송네트워크 설계 (Extended Hub-and-spoke Transportation Network Design using a Symbiotic Evolutionary Algorithm)

  • 신경석;김여근
    • 한국경영과학회지
    • /
    • 제31권2호
    • /
    • pp.141-155
    • /
    • 2006
  • In this paper, we address an extended hub-and-spoke transportation network design problem (EHSNP). In the existing hub location problems, the location and number of spokes, and shipments on spokes are given as input data. These may, however, be viewed as the variables according to the areas which they cover. Also, the vehicle routing in each spoke needs to be considered to estimate the network cost more correctly. The EHSNP is a problem of finding the location of hubs and spokes, and pickup/delivery routes from each spoke, while minimizing the total related transportation cost in the network. The EHSNP is an integrated problem that consists of several interrelated sub-problems. To solve EHSNP, we present an approach based on a symbiotic evolutionary algorithm (symbiotic EA), which are known as an efficient tool to solve complex integrated optimization problems. First, we propose a framework of symbiotic EA for EHSNP and its genetic elements suitable for each sub-problem. To analyze the proposed algorithm, the extensive experiments are performed with various test-bed problems. The results show that the proposed algorithm is promising in solving the EHSNP.

RFID 리더기 안테나의 최적 배치를 위한 효율적인 진화연산 알고리즘 (An Efficient Evolutionary Algorithm for Optimal Arrangement of RFID Reader Antenna)

  • 순남순;여명호;유재수
    • 한국콘텐츠학회:학술대회논문집
    • /
    • 한국콘텐츠학회 2009년도 춘계 종합학술대회 논문집
    • /
    • pp.715-719
    • /
    • 2009
  • RFID 기술를 이용한 다양한 응용분야에서 잘못된 RFID 리더기의 배치로 인해 리더기간의 간섭이 발생한다. 리더기 간의 간섭은 어떤 리더기가 다른 리더기의 동작에 간섭을 일으키는 신호를 송신하여 태그를 인식하는 것을 방해할 때 발생한다. RFID 시스템에서 리더기의 충돌 문제는 시스템 처리량과 인식의 효율성의 병목현상을 발생 시킨다. 본 논문에서는 RIFD 안테나 배치의 적합도를 높이기 위해서 진화 연산 기법을 이용한 새로운 RFID 리더기 배치 설계 시스템을 제안한다. 먼저, 주위 환경에 민감한 안테나의 전파 특성을 분석하고, 특성 데이터베이스를 구축한다. 그리고, 안테나를 최적으로 배치하기 위한 EA Encoding 기법과 Fitness 기법 및 유전잔 연산자를 제안한다. 제안하는 기법의 우수성을 보이기 위해서 시뮬레이션을 수행하였으며, 실험 결과, 약 100세대의 진화 연산을 통해 커버율 95.45%, 간섭율 10.29%의 RFID 안테나 배치의 적합도를 달성하였다.

  • PDF

다목적 최적화를 위한 공생 진화알고리듬 (A Symbiotic Evolutionary Algorithm for Multi-objective Optimization)

  • 신경석;김여근
    • 한국경영과학회지
    • /
    • 제32권1호
    • /
    • pp.77-91
    • /
    • 2007
  • In this paper, we present a symbiotic evolutionary algorithm for multi-objective optimization. The goal in multi-objective evolutionary algorithms (MOEAs) is to find a set of well-distributed solutions close to the true Pareto optimal solutions. Most of the existing MOEAs operate one population that consists of individuals representing the entire solution to the problem. The proposed algorithm has a two-leveled structure. The structure is intended to improve the capability of searching diverse and food solutions. At the lower level there exist several populations, each of which represents a partial solution to the entire problem, and at the upper level there is one population whose individuals represent the entire solutions to the problem. The parallel search with partial solutions at the lower level and the Integrated search with entire solutions at the upper level are carried out simultaneously. The performance of the proposed algorithm is compared with those of the existing algorithms in terms of convergence and diversity. The optimization problems with continuous variables and discrete variables are used as test-bed problems. The experimental results confirm the effectiveness of the proposed algorithm.

Comparison of Three Evolutionary Algorithms: GA, PSO, and DE

  • Kachitvichyanukul, Voratas
    • Industrial Engineering and Management Systems
    • /
    • 제11권3호
    • /
    • pp.215-223
    • /
    • 2012
  • This paper focuses on three very similar evolutionary algorithms: genetic algorithm (GA), particle swarm optimization (PSO), and differential evolution (DE). While GA is more suitable for discrete optimization, PSO and DE are more natural for continuous optimization. The paper first gives a brief introduction to the three EA techniques to highlight the common computational procedures. The general observations on the similarities and differences among the three algorithms based on computational steps are discussed, contrasting the basic performances of algorithms. Summary of relevant literatures is given on job shop, flexible job shop, vehicle routing, location-allocation, and multimode resource constrained project scheduling problems.

CSTR용 PID 제어기의 EA 기반 동조 (EA-Based Tuning of the PID Controller for a CSTR)

  • 진강규
    • 한국지능시스템학회논문지
    • /
    • 제24권3호
    • /
    • pp.330-336
    • /
    • 2014
  • 연속교반탱크반응기, 담수화 플랜트, 증류탑, pH 중화 프로세스 등을 포함한 많은 산업용 프로세스들은 높은 비선형성과 시변 특성으로 인해 제어가 까다로워 보다 정밀하고 안정된 성능을 가지는 제어기를 설계하려는 많은 노력들이 있어 왔다. 본 논문에서는 기존 연구의 단점을 개선한 CSTR 프로세스의 농도제어용 PID 제어기를 동조하는 문제를 다룬다. 액추에이터 포화 문제를 극복하기 위해 PID 제어기에는 적분기 안티와인드업 피드백 루프가 구성되며, PID 제어기의 파라미터는 전체 제어 프로세스가 만족스러운 설정치 추종 성능을 가지도록 진화연산(EA)에 의해 동조된다. 제안하는 방법은 시뮬레이션을 통해 설정치 추종 성능, 외란 억제 성능과 파라미터 변동에 대한 강인성을 확인한다.

Optimization of long span portal frames using spatially distributed surrogates

  • Zhang, Zhifang;Pan, Jingwen;Fu, Jiyang;Singh, Hemant Kumar;Pi, Yong-Lin;Wu, Jiurong;Rao, Rui
    • Steel and Composite Structures
    • /
    • 제24권2호
    • /
    • pp.227-237
    • /
    • 2017
  • This paper presents optimization of a long-span portal steel frame under dynamic wind loads using a surrogate-assisted evolutionary algorithm. Long-span portal steel frames are often used in low-rise industrial and commercial buildings. The structure needs be able to resist the wind loads, and at the same time it should be as light as possible in order to be cost-effective. In this work, numerical model of a portal steel frame is constructed using structural analysis program (SAP2000), with the web-heights at five locations of I-sections of the columns and rafters as the decision variables. In order to evaluate the performance of a given design under dynamic wind loading, the equivalent static wind load (ESWL) is obtained from a database of wind pressures measured in wind tunnel tests. A modified formulation of the problem compared to the one available in the literature is also presented, considering additional design constraints for practicality. Evolutionary algorithms (EA) are often used to solve such non-linear, black-box problems, but when each design evaluation is computationally expensive (e.g., in this case a SAP2000 simulation), the time taken for optimization using EAs becomes untenable. To overcome this challenge, we employ a surrogate-assisted evolutionary algorithm (SAEA) to expedite the convergence towards the optimum design. The presented SAEA uses multiple spatially distributed surrogate models to approximate the simulations more accurately in lieu of commonly used single global surrogate models. Through rigorous numerical experiments, improvements in results and time savings obtained using SAEA over EA are demonstrated.

A New Green Clustering Algorithm for Energy Efficiency in High-Density WLANs

  • Lu, Yang;Tan, Xuezhi;Mo, Yun;Ma, Lin
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권2호
    • /
    • pp.326-354
    • /
    • 2014
  • In this paper, a new green clustering algorithm is proposed to be as a first approach in the framework of an energy efficient strategy for centralized enterprise high-density WLANs. Traditionally, in order to maintain the network coverage, all the APs within the WLAN have to be powered-on. Nevertheless, the new algorithm can power-off a large proportion of APs while the coverage is maintained as its always-on counterpart. The two main components of the new approach are the faster procedure based on K-means and the more accurate procedure based on Evolutionary Algorithm (EA), respectively. The two procedures are processes in parallel for different designed requirements and there is information interaction in between. In order to implement the new algorithm, EA is applied to handle the optimization of multiple objectives. Moreover, we adapt the method for selection and recombination, and then introduce a new operator for mutation. This paper also presents simulations in scenarios modeled with ray-tracing method and FDTD technique, and the results show that about 67% to 90% of energy consumption can be saved while it is able to maintain the original network coverage during periods when few users are online or the traffic load is low.

Control System Synthesis Using BMI: Control Synthesis Applications

  • Chung, Tae-Jin;Oh, Hak-Joon;Chung, Chan-Soo
    • International Journal of Control, Automation, and Systems
    • /
    • 제1권2호
    • /
    • pp.184-193
    • /
    • 2003
  • Biaffine Matrix Inequality (BMI) is known to provide the most general framework in control synthesis, but problems involving BMI's are very difficult to solve because nonconvex optimization should be solved. In the previous paper, we proposed a new solver for problems involving BMI's using Evolutionary Algorithms (EA). In this paper, we solve several control synthesis examples such as Reduced-order control, Simultaneous stabilization, Multi-objective control, $H_{\infty}$ optimal control, Maxed $H_2$ / $H_{\infty}$control design, and Robust $H_{\infty}$ control. Each of these problems is formulated as the standard BMI form, and solved by the proposed algorithm. The performance in each case is compared with those of conventional methods.