• Title/Summary/Keyword: synthesis algorithm

검색결과 668건 처리시간 0.191초

인공생명 알고리듬을 이용한 유체마운트의 최적설계 (Optimal Design of Fluid Mount Using Artificial Life Algorithm)

  • 안영공;송진대;양보석;김동조
    • 한국소음진동공학회논문집
    • /
    • 제12권8호
    • /
    • pp.598-608
    • /
    • 2002
  • This paper shows the optimal design methodology for the fluid engine mount by the artificial life algorithm. The design has been commonly modified by trial and error because there is many design parameters that can be varied in order to minimize transmissibility at the desired fundamental resonant and notch frequencies. The application of trial and error method to optimization of the fluid mount is a great work. Many combinations of parameters are possible to give us the desired resonant and notch frequencies, but the question is which combination Provides the lowest resonant peak and notch depth. In this study the enhanced artificial life algorithm is applied to get the desired fundamental resonant and notch frequencies of a fluid mount and to minimize transmissibility at these frequencies. The present hybrid algorithm is the synthesis of and artificial life algorithm with the random tabu (R-tabu) search method. The hybrid algorithm has some advantages, which is not only faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all globa1 optimum solutions. The results show that the performance of the optimized mount compared with the original mount is improved significantly.

Virtual View Generation by a New Hole Filling Algorithm

  • Ko, Min Soo;Yoo, Jisang
    • Journal of Electrical Engineering and Technology
    • /
    • 제9권3호
    • /
    • pp.1023-1033
    • /
    • 2014
  • In this paper, performance improved hole-filling algorithm which includes the boundary noise removing pre-process that can be used for an arbitrary virtual view synthesis has been proposed. Boundary noise occurs due to the boundary mismatch between depth and texture images during the 3D warping process and it usually causes unusual defects in a generated virtual view. Common-hole is impossible to recover by using only a given original view as a reference and most of the conventional algorithms generate unnatural views that include constrained parts of the texture. To remove the boundary noise, we first find occlusion regions and expand these regions to the common-hole region in the synthesized view. Then, we fill the common-hole using the spiral weighted average algorithm and the gradient searching algorithm. The spiral weighted average algorithm keeps the boundary of each object well by using depth information and the gradient searching algorithm preserves the details. We tried to combine strong points of both the spiral weighted average algorithm and the gradient searching algorithm. We also tried to reduce the flickering defect that exists around the filled common-hole region by using a probability mask. The experimental results show that the proposed algorithm performs much better than the conventional algorithms.

$\mu$-합성법을 이용한 사장교의 지진응답 제어 (Seismic Response Control of a Cable-Stayed Bridge using a $\mu$-Synthesis Method)

  • 박규식;정형조;윤우현;이인원
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2004년도 가을 학술발표회 논문집
    • /
    • pp.476-483
    • /
    • 2004
  • This paper presents a hybrid system combining lead rubber bearings and hydraulic actuators controlled by a μ-synthesis method for seismic response control of a cable-stayed bridge. A hybrid system could alleviate some of restrictions and limitations that exist when each system is acting alone because multiple control devices are operating. Therefore, the overall control performance of a hybrid system may be improved compared to each system, however the overall system robustness may be negatively impacted by active device in the hybrid system or active controller may cause instability due to small margins. Therefore, a f-synthesis method that guarantees the robust performance is considered to enhance the possibility of real applications of the control system. The control performances of the proposed control system are compared with those of passive, active, semiactive control systems and hybrid system controlled by LQG algorithm and an extensive robust analysis with respect to stiffness and mass matrices perturbation and time delay of actuator is performed. Numerical simulation results show that the control performance of the proposed control system is superior to that of the passive system and slightly better than that of the active and semiactive systems and two hybrid systems show similar control performances. Furthermore, the hybrid system controlled by a μ-synthesis method shows the good robustness without loss of control performances. Therefore, the proposed control system could effectively be used to seismically excited cable-stayed bridge which contains many uncertainties.

  • PDF

인공생명을 이용한 유체마운트의 최적화 (Optimal Design of Fluid Mount Using Artificial Life Algorithm)

  • 안영공;송진대;양보석
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2001년도 추계학술대회논문집 I
    • /
    • pp.427-432
    • /
    • 2001
  • This paper shows the optimum design of the fluid engine mount. The design has been modified by trial and error because there is many design parameters that can be varied in order to obtain resonant and notch frequencies, and notch depth. It seems to be a great application for optimal design for the mount. Many combinations of parameters are possible to give us the desired resonant and notch frequencies, but the question is which combination provides the lowest resonant peak and notch depth\ulcorner In this study, the enhanced artificial life algorithm is applied to get the desired notch frequency of a fluid mount and minimize transmissibility at the notch frequency. The present hybrid algorithm is the synthesis of an artificial life algorithm with the random tabu (R-tabu) search method. The hybrid algorithm has some advantages, which is not only faster than the conventional artificial life algorithm, but also gives a more accurate solution. In addition, this algorithm can find all global optimum solutions. The results show that the performance of a conventional engine mount can be improved significantly compared with the optimized mount.

  • PDF

스마트폰으로 검출된 객체의 음성합성 시스템 (Speech Synthesis System for Detected Objects by Smart Phone)

  • 권순각
    • 한국멀티미디어학회논문지
    • /
    • 제19권2호
    • /
    • pp.469-478
    • /
    • 2016
  • This paper designs an application for detecting various objects using a smart phone with camera sensor, then implements the application that detects the number of faces in front of a user by using the Face API provided by android and generates a speech to the user. For implementing the application, the GoF strategy pattern is applied to design the application. It provides some advantages; first, the algorithm development schedule can separate the whole application development schedule; next, it makes easier to add the algorithm. For example, another detecting algorithm for the other objects (character, motion detection) that may be developed in the future, or it may be replaced by a more high-performance algorithm. With the propose method, a general smart phone can make some advantages that can provide information of various objects (such as moving people and objects, and detected character from signboards) to the person who is visually impaired.

스테레오정합과 신경망을 이용한 3차원 잡기계획 (3D Grasp Planning using Stereo Matching and Neural Network)

  • 이현기;배준영;이상룡
    • 대한기계학회논문집A
    • /
    • 제27권7호
    • /
    • pp.1110-1119
    • /
    • 2003
  • This paper deals with the synthesis of the 3-dimensional grasp planning for unknown objects. Previous studies have many problems, which the estimation time for finding the grasping points is much long and the analysis used the not-perfect 3-dimensional modeling. To overcome these limitations in this paper new algorithm is proposed, which algorithm is achieved by two steps. First step is to find the whole 3-dimensional geometrical modeling for unknown objects by using stereo matching. Second step is to find the optimal grasping points for unknown objects by using the neural network trained by the result of optimization using genetic algorithm. The algorithm is verified by computer simulation, comparing the result between neural network and optimization.

임의 물체에 대한 최적 3차원 Grasp Planning (Optimal 3D Grasp Planning for unknown objects)

  • 이현기;최상균;이상릉
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2002년도 춘계학술대회 논문집
    • /
    • pp.462-465
    • /
    • 2002
  • This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has analyzed mainly with either unknown objects 2D by vision sensor or unknown objects, cylindrical or hexahedral objects, 3D. Extending the previous work, in this paper we propose an algorithm to analyze grasp of unknown objects 3D by vision sensor. This is archived by two steps. The first step is to make a 3D geometrical model of unknown objects by stereo matching which is a kind of 3D computer vision technique. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand because it has the characteristic of multi-finger hand and is easy to modeling. To find the optimal grasping points, genetic algorithm is used and objective function minimizing admissible farce of finger tip applied to the object is formulated. The algorithm is verified by computer simulation by which an optimal grasping points of known objects with different angles are checked.

  • PDF

3차원 영상처리 기술을 이용한 Grasp planning의 최적화 (The Optimal Grasp Planning by Using a 3-D Computer Vision Technique)

  • 이현기;김성환;최상균;이상룡
    • 한국정밀공학회지
    • /
    • 제19권11호
    • /
    • pp.54-64
    • /
    • 2002
  • This paper deals with the problem of synthesis of stable and optimal grasps with unknown objects by 3-finger hand. Previous robot grasp research has mainly analyzed with either unknown objects 2-dimensionally by vision sensor or known objects, such as cylindrical objects, 3-dimensionally. As extending the previous work, in this study we propose an algorithm to analyze grasp of unknown objects 3-dimensionally by using vision sensor. This is archived by two steps. The first step is to make a 3-dimensional geometrical model for unknown objects by using stereo matching. The second step is to find the optimal grasping points. In this step, we choose the 3-finger hand which has the characteristic of multi-finger hand and is easy to model. To find the optimal grasping points, genetic algorithm is employed and objective function minimizes the admissible force of finger tip applied to the objects. The algorithm is verified by computer simulation by which optimal grasping points of known objects with different angle are checked.

인공생명 알고리듬을 이용한 프로팅 링 저널 베어링 지지 축계의 최적설계 (Optimum design of rotor supported on floating ring journal bearing by the enhanced artificial life optimization algorithm)

  • 송진대;석호일;양보석
    • 한국소음진동공학회:학술대회논문집
    • /
    • 한국소음진동공학회 2002년도 추계학술대회논문집
    • /
    • pp.1034-1037
    • /
    • 2002
  • This paper presents an optimum design of rotor-bearing system using a hybrid method to compute the solutions of optimization problem. The present hybrid algorithm namely Enhanced Artificial Life Algorithm(EALA), is a synthesis of an artificial life algorithm(ALA) and the random tabu search(R-tabu) method. We applied EALA to the optimum design of rotor-shaft system supported by the floating ring journal bearings. we will propose the optimum shape of rotor, position and shape of bearings. Through this study, we investigate the reliability and usefulness of EALA.

  • PDF

구간 그래프를 이용한 스케쥴링 알고리듬 (A Scheduling Algorithm Using the Interval Graph)

  • 김기현;정정화
    • 전자공학회논문지A
    • /
    • 제31A권1호
    • /
    • pp.84-92
    • /
    • 1994
  • In this paper, we present a novel scheduling algorithm using the weighted interval graph. An interval graph is constructed, where an interval is a time frame of each operation. And for each operation type, we look for the maximum clique of the interval graph: the number of nodes of the maximum clique represents the number of operation that are executed concurrently. In order to minimize resource cost. we select the operation type to reduce the number of nodes of a maximum clique. For the selected operation type, an operation selected by selection rule is moved to decrease the number of nodes of a maximum clique. A selected operation among unscheduled operations is moved repeatly and assigned to a control step consequently. The proposed algorithm is applied to the pipeline and the nonpipeline data path synthesis. The experiment for examples shows the efficiency of the proposed scheduling algorithm.

  • PDF