• 제목/요약/키워드: Search operator

검색결과 131건 처리시간 0.023초

Genetic Algorithm for Identification of Time Delay Systems from Step Responses

  • Shin, Gang-Wook;Song, Young-Joo;Lee, Tae-Bong;Choi, Hong-Kyoo
    • International Journal of Control, Automation, and Systems
    • /
    • 제5권1호
    • /
    • pp.79-85
    • /
    • 2007
  • In this paper, a real-coded genetic algorithm is proposed for identification of time delay systems from step responses. FOPDT(First-Order Plus Dead-Time) and SOPDT(Second-Order Plus Dead-Time) systems, which are the most useful processes in this field, but are difficult for system identification because of a long dead-time problem and a model mismatch problem. Genetic algorithms have been successfully applied to a variety of complex optimization problems where other techniques have often failed. Thus, the modified crossover operator of a real-code genetic algorithm is proposed to effectively search the system parameters. The proposed method, using a real-coding genetic algorithm, shows better performance characteristics when compared to the usual area-based identification method and the directed identification method that uses step responses.

정보통신시장 유무선 통합서비스 도입과 기업 대응전략 (Strategies with the Introduction of fixed-mobile Convergence Services on the IT Market)

  • 송영화;류완화;김갑식
    • 한국정보시스템학회지:정보시스템연구
    • /
    • 제13권1호
    • /
    • pp.59-75
    • /
    • 2004
  • Fixed-mobile convergence services can be defined as the combination of previously separate fixed and mobile services, and networks and commercial practices. Examples of fixed-mobile convergence services include single voice-mail box, single number and unified messaging across fixed and mobile networks. Recently as more voice is transferred to mobile networks, convergence services between fixed and mobile become more important. In Korea convergence services are only starting to become established, and are likely to become an important part of any operator's offering. In this paper, we search the different levels of fixed-mobile convergence services and the trends and regulations for fixed-mobile convergence services in major countries. And at the same time, we also suggest the corresponding Marketing strategies by operators related to fixed-mobile convergence services.

  • PDF

국내 송전계통 및 송전제약 비용 분석 (The Analysis of The Domestic Transmission System and Transmission Congestion Price)

  • 백웅기;전영환;김정훈;곽노홍;송인준
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2004년도 하계학술대회 논문집 A
    • /
    • pp.737-739
    • /
    • 2004
  • The domestic power system established with Cost-Based-Pricing(CBP) from April 2001. The system is a uniform pricing system. System Operator(50) establishes a Price Setting Schedule by the prediction of consumption and the presented bid price(generation cost) of the generation utility. But the Price Setting Schedule doesn't take account of the constraint of the system. This cause a transmission congestion, constrained-on generation and constrained-off generation. This Paper search the way of the increasing efficiency of domestic power system through the redemption of congestion charge.

  • PDF

경계 검출을 이용한 고속 디지털 영상 안정화 기법 (Fast Digital Image Stabilization based on Edge Detection)

  • 김정환;김진형;변근영;고성제
    • 대한전자공학회:학술대회논문집
    • /
    • 대한전자공학회 2008년도 하계종합학술대회
    • /
    • pp.823-824
    • /
    • 2008
  • In this paper, we propose a robust and fast digital image stabilization algorithm based on edge detection. The proposed algorithm exploits sobel operator to obtain edge image and fast detects irregular conditions with analyzing an edge information of the image. Experimental results show that the proposed algorithm can gain better performance in the sense of speed and precision comparing with full-block search method.

  • PDF

A* 알고리즘을 적용한 금속 그레이팅 생산 공정에서의 절단문제 해결 (Application of A* Algorithm to solve a Cutting Problem in Metal Manufacturing Process)

  • 김진명;조대호
    • 한국시뮬레이션학회논문지
    • /
    • 제14권4호
    • /
    • pp.1-8
    • /
    • 2005
  • In a metal grating manufacturing process, the cutting operation allocates the gratings and cut them out from given panels or a plate sheets. Before the cutting operation an operator generates a cutting plan. The cutting plan should decide how pieces of metal rectangles i.e., gratings, are allocated and cut from the panel. This plan generation is a deal of weight on the production cost. the generation of cutting plan is similar to the general two-dimensional cutting problem. In this paper, we first define cutting problem and Af algorithm of Artificial Intelligence to solve the problem. Also, through a simulation, we compare the proposed cutting algorithm to an existing method in terms of material loss

  • PDF

Job Shop 일정계획을 위한 병렬 유전 알고리즘 (A Parallel Genetic Algorithms for lob Shop Scheduling Problems)

  • 박병주;김현수
    • 산업경영시스템학회지
    • /
    • 제23권59호
    • /
    • pp.11-20
    • /
    • 2000
  • The Job Shop Scheduling Problem(JSSP) is one of the most general and difficult of all traditional scheduling problems. The goal of this research is to develop an efficient scheduling method based on single genetic algorithm(SGA) and parallel genetic algorithm (PGA) to address JSSP. In this scheduling method, new genetic operator, generating method of initial population are developed and island model PGA are proposed. The scheduling method based on PGA are tested on standard benchmark JSSP. The results were compared with SGA and another GA-based scheduling method. The PGA search the better solution or improves average of solution in benchmark JSSP. Compared to traditional GA, the proposed approach yields significant improvement at a solution.

  • PDF

상이한 네트워크 서비스 어떻게 향상시킬까? (How to Reinvent Network Services for All)

  • 김용재;이석준;임재익
    • 경영과학
    • /
    • 제25권3호
    • /
    • pp.87-99
    • /
    • 2008
  • Besieged by needs for upgrading the current Internet, social pressures, and regulatory concerns, a network operator may be left with few options to Improve his services. Yet he can still consider a transition prioritizing network services. In this paper, we describe a transition from a non-priority system to a prioritized one, using non-preemptive M/G/1 model. After reviewing the constraints and theoretical results from past research, we describe steps making the transition Pareto-improving, which boils down to a multi-goal search for a Pareto-improving state. We use a genetic algorithm that captures actual transition costs along with incentive-compatible and Pareto-Improving constraints. Simulation results demonstrate that the initial post-transition solutions are typically Pareto-improving. for non Pareto-improving solutions, the heuristic quickly generates Pareto-improving and incentive-compatible solutions.

열연코일 권취형상 불량 자동진단 시스템 개발 (Development of Diagnostic System for Winding Profile Abnormality of Hot Coils)

  • 이성진
    • 대한기계학회:학술대회논문집
    • /
    • 대한기계학회 2000년도 추계학술대회논문집A
    • /
    • pp.590-595
    • /
    • 2000
  • On the contrary to the increasing needs of shape qualities, most of quality inspections are carried out by manual or operator's insight. To find the causes of shape inferiority, it is required to gather and analyze the shape measurement data. As a result the winding profile measurement system ($TELE-SCANNER^{(R)}$) is developed to analyze the coiling process and automate the manual measuring process for winding profile of hot-rolled coils. The winding profile measurement system measures and analyzes winding profile shapes of hot-rolled coils, and classifies them into several dominant patterns that are related to normal or abnormal mechanical conditions of down-coiler. The system also contains analysis software to quantify the winding profile shapes and patterns, and to produce statistics to help search the causes of profile shape inferiority.

  • PDF

Genetic Algorithms의 연구방향과 과제

  • 김태식;정성용;김대영
    • 한국산업정보학회:학술대회논문집
    • /
    • 한국산업정보학회 1998년도 춘계공동학술대회 발표논문집 IMF시대의정보화 추진전략
    • /
    • pp.213-219
    • /
    • 1998
  • Genetic Algorithms(GAs ; 유전자 알고리즘)은 자연적 선택(natural selection)의 유전적인 메카니즘에 기초한 탐색 알고리즘(search algo-rithms)이다. GA는 세대(generation)를 거듭함에 따라 어떤 최적화화하는 해에 수렴해가는 탐색 알고리즘으로 전세대의 우수개체로부터 새로운 세대의 개체들이 집합이 형성되는 과정을 이용한 탐색 알고리즘이다. GA에 대한 최근의 활발한 연구와 많은 관심은 주로 기존의 기법이 특정 영역의 지식을 많이 필요로하는데 비해서 GA는 효율적인 영역독립 탐색경험들의 집합을 제공하여 최적해를 얻는 기법으로서 전역함수 최적화와 NP 등의 문제에 유용하다는 연구결과가 제시되고 있기 때문이다. 본 연구에서는 GA에 대한 명확한 이해와 세대의 형성 , 개체를 선택하기 위한 타당한 연산자(operator)에 관한 내용을 고찰하고, GA가 언제, 어떻게 사용되는가에 대해 응용사례를 중심으로 GA의 향후 연구방향에 대해 논의하고 GA가 앞으로 어떤 분야에서 어떻게 발전해 나가야 할 지에 대한 과제에 대해 논의한다.

Online Evolution for Cooperative Behavior in Group Robot Systems

  • Lee, Dong-Wook;Seo, Sang-Wook;Sim, Kwee-Bo
    • International Journal of Control, Automation, and Systems
    • /
    • 제6권2호
    • /
    • pp.282-287
    • /
    • 2008
  • In distributed mobile robot systems, autonomous robots accomplish complicated tasks through intelligent cooperation with each other. This paper presents behavior learning and online distributed evolution for cooperative behavior of a group of autonomous robots. Learning and evolution capabilities are essential for a group of autonomous robots to adapt to unstructured environments. Behavior learning finds an optimal state-action mapping of a robot for a given operating condition. In behavior learning, a Q-learning algorithm is modified to handle delayed rewards in the distributed robot systems. A group of robots implements cooperative behaviors through communication with other robots. Individual robots improve the state-action mapping through online evolution with the crossover operator based on the Q-values and their update frequencies. A cooperative material search problem demonstrated the effectiveness of the proposed behavior learning and online distributed evolution method for implementing cooperative behavior of a group of autonomous mobile robots.