• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 Proceedings of the Korea Automatic Control Conference, 11th (KACC); Pohang, Korea; 24-26 Oct. 1996
• /
• pp.324-327
• /
• 1996

This paper describes the robust controller design methods applied to the problem of an automatic system for tow-vehicle/trailer combinations. This study followed an inverse Linear Quadratic Regulator(LQR) approach which combines pole assignment methods with conventional LOR methods. It overcomes two concerns associated with these separate methods. It overcomes the robustness problems associated with pole placement methods and trial and error required in the application of the LQR problem. Moreover, a Kalman filter is used as the observer, but is modified by using the loop transfer recovery (LTR) technique with modified transmission zero assignment. The proposed inverse LQG,/LTR controllers enhances the forward motion stability and maneuverability of the combination vehicles. At high speeds, where the inherent yaw damping of the vehicle system decreases, the controller operates to maintain an adequate level of yaw damping. At backward moton, both 4WS (2WS tow-vehicle, 2WS trailer) and 6WS (4WS tow-vehicle, 2WS trailer) control laws are proposed by using inverse LQG/LTR method. To evaluate the stability and robustness of the proposed controllers, simulations for both forward and backward motion were conducted using a detailed nonlinear model. The proposed controllers are significantly more robust than the previous controllers and continues to operate effectively in spite of parameter perturbations that would cause previous controllers to enters limit cycles or to loose stability.

• 산업공학
• /
• 제11권3호
• /
• pp.65-75
• /
• 1998

This research considers the problem of scheduling jobs on parallel machines with non-common due dates and additional resource constraints. The objective is to minimize the total absolute deviation of job completion times about the due dates. Job processing times are assumed to be the same. This problem is motivated by restrictions that occur in the handling and processing of jobs in certain phases of semiconductor manufacturing and other production systems. We examine two problems. For the first of these, the number of different types of additional: resources and resource requirements per job are arbitrary. The problem is formulated as a zero-one integer linear programming and the Lagrangian relaxation approach is used. For the second case, there exists one single type of additional resource and the resource requirements per job are zero or one. We show how to formulate the problem as an assignment problem.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회/대한산업공학회 2003년도 춘계공동학술대회
• /
• pp.381-385
• /
• 2003

We consider the bandwidth parking problem arising from telecommunication networks The problem is to determine the set of calls to be routed and an assignment or them to the paths in arc capacitated network. The objective is to maximize profit. We formulate the problem as an integer programming and propose an algorithm to solve it. Column generation technique to solve the linear programming relxation is proposed with two types of columns in addition, to obtain an optimum integer solution, we consider a new branching strategy. Computational experiments show that the algorithm gives option at solutions within reasonably small time limits.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
• /
• pp.158-160
• /
• 2005

This paper presents a new approach to the problem of designing a cascaded three-parameters controller for a given linear time invariant (LTD plant in unity feedback system. We consider a proportional-integral-derivative (PID) and a first-order controller with specified overshoot and settling time. This problem is difficult to solve because there may be no analytical solution due to the use of low-order controller and furthermore. the zeros of controller just appear in the zeros of feedback system. The key idea of our method is to impose a constraint on the controller parameters so that the zeros of resulting controller are distant from the dominant pole of closed-loop system to the left as far as the given interval. Two methods realizing the idea are suggested. We have employed the characteristic ratio assignment (CRA) in order to deal with the time response specifications. It is noted that the proposed methods are accomplished only in parameter space. Several illustrative examples are given.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제55권1호
• /
• pp.20-23
• /
• 2006

This paper presents a new approach to the problem of designing a cascaded three-parameters controller for a given linear time invariant (LTI) plant in unity feedback system. We consider a proportional-integral-derivative (PID) and a first-order controller with the specified overshoot and settling time. This problem is difficult to solve because there may be no analytical solution due to the use of low-order controller. Furthermore, the zeros of controller just appear in the zeros of feedback system. The key idea of our method is to impose a constraint on the controller parameters so that the zeros of resulting controller are distant from the dominant pole of closed-loop system to the left as far as the given interval. Two methods realizing the idea are suggested. We have employed the characteristic ratio assignment (CRA) in order to deal with the time response specifications. It is noted that the proposed methods are accomplished only in parameter space. Several illustrative examples are given.

• 한국정보처리학회논문지
• /
• 제4권8호
• /
• pp.2143-2151
• /
• 1997

대규모 집적회로의 공정 기술의 발달로 전선 간의 간격이 가까와 짐에 따라서, 전선 간에 발생하는 결합 캐패시턴스가 접지 캐패시턴스에 비하여 급격히 증가하게 되었다. 그에 따라, 레이아웃의 설계과정에서 결합 캐패시턴스로 유발되는 혼신을 중요한 요인으로 고려할 필요가 있게 되었다. 본 논문에서는 3개 이상의 배선 층을 사용하는 배선 영역, 특히 채널 배선 영역에서 혼신을 최소화시킬 수 있는 배선 층 할당 방법을 다룬다. 제안된 방법은 배선 층 할당 문제를 0/1 정수 선형 프로그래밍 문제로 형식화하여 해결하는 것이다. 또한, 비용 함수에 대한 상한을 추정함으로써 효율을 향상시키는 방법을 제안한다. 실험을 통하여 제안된 방법이 혼신을 효과적으로 개선함을 보인다.

• Industrial Engineering and Management Systems
• /
• 제4권1호
• /
• pp.82-93
• /
• 2005

Facility layout problems (FLP) are usually treated as design problems. Lack of systematic and objective tools to compare design alternatives results in decision-making to be dominated by the experiences or preferences of designers or managers. To increase objectivity and effectiveness of decision-making in facility layout selections, a decision support model is necessary. We proposed a decision model, which regards the FLP as a multi-attribute decision making (MADM) problem. We identify sets of attributes crucial to layout selections, quantitative indices for attributes, and methods of ranking alternatives. For a requested facility layout design, many alternatives could be developed. The enormous alternatives, various attributes, and comparison of assigned qualitative values to each attribute, form a complicated decision problem. To treat facility layout selection problems as a MADM problem, we used the linear assignment method to rank before selecting those high ranks as candidates. We modelled the application of the Nemawashi process to simulate the group decision-making procedure and help efficiently achieve agreement. The electronics manufacturing service (EMS) industry has frequent and costly facility layout modifications. Our models are helpful to them. We use an electronics manufacturing service company to illustrate the decision-making process of our models.

• 한국컴퓨터정보학회논문지
• /
• 제20권9호
• /
• pp.105-111
• /
• 2015

This paper suggests O(n) linear-time algorithm for car sequencing problem (CSP) that has been classified as NP-complete because of the polynomial-time algorithm to solve the solution has been unknown yet. This algorithm applies maximum options-equiped car type first production rule to decide the car sequencing of n meet the r:s constraint. This paper verifies thirteen experimental data with the six data are infeasible. For thirteen experimental data, the proposed algorithm can be get the solution for in all cases. And to conclude, This algorithm shows that the CSP is not NP-complete but the P-problem. Also, this algorithm proposes the solving method to the known infeasible cases. Therefore, the proposed algorithm will stand car industrial area in good stead when it comes to finding a car sequencing plan.

• 한국인터넷방송통신학회논문지
• /
• 제13권5호
• /
• pp.173-181
• /
• 2013

본 논문은 복합상품 운송 문제의 최적해를 구하는 단순한 발견적 방법을 제안한다. 제안 알고리즘은 첫 번째로, 복합상품 중개운송 문제인 경우 일반적인 운송 문제로 변환시킨다. 이 과정에서 중개지를 공급지로, 중개지의 수용량 제약조건을 공급량으로 치환한다. 다음으로 단일 상품으로 분해한다. 두 번째로, 복합상품 운송문제인 경우 상품별로, 복합상품 중개운송 문제인 경우는 직접 열 (수요지) 기준으로 최소 비용을 선택한다. 행 (공급지) 기준으로 선택된 비용 오름차순으로 공급량, 수용량과 요구량 제약조건을 만족하도록 수송량을 배정한다. 주어진 요구량을 모두 만족할 때까지 이 과정을 반복한다. 이렇게 얻은 초기해에 대해 세 번째로, 수송비용을 감소시킬 수 있는 조건을 만족하면 배정량을 조정한다. 이와 같이 단순한 알고리즘을 2개의 복합상품 운송 문제와 3개의 복합상품 중개운송 문제에 적용한 결과, 선형계획법으로 최적해를 제시한 3개 문제 중 2개 문제에서 최적해를 개선하는 효과를 얻었다. 결국, 제안된 알고리즘은 선형계획법을 적용하는 방법보다 좋은 알고리즘으로 판명되었다.

• 한국정보통신학회:학술대회논문집
• /
• 한국정보통신학회 2022년도 추계학술대회
• /
• pp.459-461
• /
• 2022

Network-on-Chip (NoC) 이 오프칩 네트워크 기반의 기존 병렬처리 시스템과 가장 크게 다른 점은 데이터 패킷 라우팅을 중앙 제어 방식(Centralized control scheme)으로 수행한다는 점이다. 이러한 환경에서 Best-effort 패킷 라우팅 문제는 데이터 패킷이 해당 코어에 도달 및 처리되는 시간을 Cost 로 하는 실시간 최소화 할당 문제(Assignment problem)가 된다. 본 논문에서는 할당 문제의 선형 대수 방정식에 대한 대표적인 연산 복잡도 저감 알고리즘인 헝가리안 알고리즘을 하드웨어 가속기 형태로 구현하였다. TSMC 0.18um 표준 셀라이브러리를 이용하여 논리 합성한 결과 헝가리안 알고리즘의 연산과정을 그대로 구현한 하드웨어 회로보다 Cost 분포에 대한 Case 분석을 통하여 구현한 것이 면적은 약 16%, Propagation delay는 약 52% 감소한 것으로 나타났다.