• 제목/요약/키워드: Work path

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

Irregular Failures at Metal/polymer Interfaces

  • Lee, Ho-Young
    • 한국표면공학회지
    • /
    • 제36권4호
    • /
    • pp.347-355
    • /
    • 2003
  • Roughening of metal surfaces frequently enhances the adhesion strength of metals to polymers by mechanical interlocking. When a failure occurs at a roughened metal/polymer interface, the failure prone to be cohesive. In a previous work, an adhesion study on a roughened metal (oxidized copper-based leadframe)/polymer (Epoxy Molding Compound, EMC) interface was carried out, and the correlation between adhesion strength and failure path was investigated. In the present work, an attempt to interpret the failure path was made under the assumption that microvoids are formed in the EMC as well as near the roots of the CuO needles during compression-molding process. A simple adhesion model developed from the theory of fiber reinforcement of composite materials was introduced to explain the adhesion behavior of the oxidized copper-based leadframe/EMC interface and failure path. It is believed that this adhesion model can be used to explain the adhesion behavior of other similarly roughened metal/polymer interfaces.

유전알고리즘을 이용한 운송설비용 자율 주행 운반체의 경로계획에 관한 연구 (A Study on Path Planning of an Autonomous mobile Vehicle for Transport System Using Genetic Algorithms)

  • 조현철;이기성
    • 조명전기설비학회논문지
    • /
    • 제13권2호
    • /
    • pp.32-38
    • /
    • 1999
  • 운송설비용 자율 주행 운반체는 인간의 지도없이 주어진 환경 내에서 장애물과 충돌을 회피하며 효율적으로 목표지점까지 주행할 수 있는 최적의 이동 경로를 생성해야 한다. 본 논문에서는 장애물과 충돌을 회피하는 전역 및 지역경로를 유전알고리즘을 이용하여 계획하였다. 본 논문에서는 제안한 운송설비용 자율 주행 운반체의 충돌회피 알고리즘은 전통적인 충돌회피 알고리즘에 비해 능률적임을 모의 실험을 통해 확인하였다.

  • PDF

PERT 요소공정의 주경로 확률 산정 모델 개발 (Development Model for Estimating Critical Path Probability of Element Path in PERT)

  • 윤득노;김태곤;한이철;이정재
    • 한국농공학회논문집
    • /
    • 제52권2호
    • /
    • pp.27-34
    • /
    • 2010
  • The PERT is one form of probabilistic network and can have many critical paths in the concept of each work has dispersed complete time. Here we propose two operators to estimate the probabilistic complete time about serial and parallel connections, and in each junction node, probability of critical path is estimated by new operator. Then we compare the estimated results with robability of critical path with deterministic CPM and Monte Carlo simulation (MCS). Our results show that all paths in PERT can be critical path, and proposed operators are efficient and accurate probabilistic calculators compare MCS result.

승용차 실내소음의 전달경로 해석 (Transfer Path Analysis on the Passenger Car Interior Noise)

  • 지태한;최윤봉
    • 소음진동
    • /
    • 제9권1호
    • /
    • pp.97-102
    • /
    • 1999
  • Structure-borne noise is an important aspect to consider during the design and development of a vehicle. In this work. it was desired to identify the primary paths associated with structure-borne noise generated from the engine and front suspension. An experimental source-path-receiver model was used to characterize the system. A variety of primary sources such as engine. tires or exhaust system generate vibrations of the inner surfaces of the passenger compartment of a vehicle which subsequently radiate noise. The source was characterized by the force acting at the engine-to-body interface. and the path was characterized by pressure over force FRF's. The excitation forces were indirectly determined using dynamic stiffness of rubber mount or the system accelerance matrix. Through these analysis, path contribution diagram which is well expressed primary noise path is obtained.

  • PDF

유전알고리즘을 이용한 운송설비용 자율 주행 운반체의 경로계획에 관한 연구 (A Study on Path Planning of an Autonomous mobile Vehicle for Transport Sysing Using Genetic Algorithms)

  • 조현철;;이기성
    • 한국조명전기설비학회지:조명전기설비
    • /
    • 제13권2호
    • /
    • pp.164-164
    • /
    • 1999
  • An autonomous mobile vehicle for transport system must plan optimal path in work environment without human supervision and obstacle collision. This is to reach a destination without getting lost. In this paper, a genetic algorithm for global and local path planning and collision avoidance is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

토크 제한하에서의 첨단부 잔류진동 감소를 위한 매니퓰레이터 경로설계 (Manipulator Path Design to Reduce the Endpoint Residual Vibration under Torque Constraints)

  • 박경조;박윤식
    • 대한기계학회논문집
    • /
    • 제17권10호
    • /
    • pp.2437-2445
    • /
    • 1993
  • In this work, a new method is presented for generating the manipulator path which significantly reduces residual vibration under the torque constraints. The desired path is optimally designed so that the required movement can be achieved with minimum residual vibration. From the previous research works, the dynamic model had been established including both the link and the joint flexibilities. The performance index is selected to minimize the maximum amplitude of residual vibration. The path to be designed is developed by a combined Fourier series and polynomial function to satisfy both the convergence and boundary condition matching problems. The concept of correlation coefficients is used to select the minimum number of design variables, i.e. Fourier coefficients, the only ones which have a considerable effect on the reduction of residual vibration. A two-link Manipulator is used to evaluate this method. Results show that residual vibration can be drastically reduced by selecting an appropriate manipulator path to both of unlimited and torque-limited cases.

A*를 이용한 장애물 회피 (Avoidance obstacles using A* algorithm in the Eyebot)

  • 정현룡;김영배
    • 한국정밀공학회:학술대회논문집
    • /
    • 한국정밀공학회 2003년도 춘계학술대회 논문집
    • /
    • pp.468-471
    • /
    • 2003
  • The A* algorithm is usually used in game programming, mainly because it is fast in finding a optimal path to goal. In this paper. This algorithm was utilized for path finding, HIMM(Histogramic In-Motion Mapping) method is used in map-building. Map is updated continuously with range data sampled by PSD sensors From the map, A* algorithm finds a optimal path and sends subsequently the most suitable point to the Eyebot. A* algorithm has been tested on the Eyebot in various unknown maps of unknown and proved to work well. It could escape the local minimum, also.

  • PDF

신경 회로 이론을 이용한 이동 로보트의 경로 제어에 관한 연구 (Path control for a mobile robot using neural network)

  • 신철균;조형석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 26-27 Oct. 1990
    • /
    • pp.710-715
    • /
    • 1990
  • This paper presents a path control method for mobile robot using neural network and a systematic method for the kinematic and dynamic modelling of a mobile robot. The robot finds its path deviation by taking the signals of an optical array sensor and determined its moving behaviors using neural net control method. A robot can be taught behaviors by changing the given patterns, in this work, Back Propagation rule is used as a learning method.

  • PDF

유전 알고리즘을 이용한 자율 이동로봇의 최적경로 계획 (Path planning of Autonomous Mobile robot based on a Genetic Algorithm)

  • 이동하
    • 한국공작기계학회:학술대회논문집
    • /
    • 한국공작기계학회 2000년도 춘계학술대회논문집 - 한국공작기계학회
    • /
    • pp.147-152
    • /
    • 2000
  • In this paper we propose a Genetic Algorithm for the path planning of an autonomous mobile robot. Genetic Algorithms(GAs) have advantages of the adaptivity such as GAs work even if an environment is time-varying or unknown. Therefore, we propose the path planning algorithms using the GAs-based approach and show more adaptive and optimal performance by simulation.

  • PDF

포텐셜함수(Potential Function)를 이용한 자율주행로봇들간의 충돌예방을 위한 주행제어 알고리즘의 개발 (Development of Potential-Function Based Motion Control Algorithm for Collision Avoidance Between Multiple Mobile Robots)

  • 이병룡
    • 한국정밀공학회지
    • /
    • 제15권6호
    • /
    • pp.107-115
    • /
    • 1998
  • A path planning using potential field method is very useful for the real-time navigation of mobile robots. However, the method needs high modeling cost to calculate the potential field because of complex preprocessing, and mobile robots may get stuck into local minima. In this paper, An efficient path planning algorithm for multiple mobile robots, based on the potential field method, was proposed. In the algorithm. the concepts of subgoals and obstacle priority were introduced. The subgoals can be used to escape local minima, or to design and change the paths of mobile robots in the work space. In obstacle priority, all the objects (obstacles and mobile robots) in the work space have their own priorities, and the object having lower priority should avoid the objects having higher priority than it has. In this paper, first, potential based path planning method was introduced, next an efficient collision-avoidance algorithm for multiple mobile robots, moving in the obstacle environment, was proposed by using subgoals and obstacle priority. Finally, the developed algorithm was demonstrated graphically to show the usefulness of the algorithm.

  • PDF