• 한국추진공학회:학술대회논문집
• /
• 한국추진공학회 2011년도 제37회 추계학술대회논문집
• /
• pp.618-623
• /
• 2011

가스발생기의 압력 제어기법을 제안하였다. 모델기반 제어법칙을 설계하기 위하여 Robert 식과 보존방정식을 이용하여 가스발생기의 모델을 구성하였고, 연소시험을 통하여 모델의 정확성을 검증하였다. 모델은 연소 공간이 증가함에 따라 시스템의 고유 특성이 변화하게 되는데, 이러한 특성으로 인한 폐루프 구조에서 나타나는 응답특성을 평가하기 위하여 PID 및 비선형 적응 제어법칙을 설계하였다. 수치 시뮬레이션 결과 두 방법이 각각 제어 성능과 실제 시스템 적용에 문제가 있음을 알 수 있었고, 이를 극복하기 위한 새로운 제어기법을 제안하였다. 새롭게 제안된 이득계획 제어기법의 수치 시뮬레이션 결과 외란 및 측정 잡음의 영향에서도 우수한 제어 응답성능을 보였다.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.127-133
• /
• 2006

Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product quality. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems. Also, we developed a web based scheduling and monitoring system for a zinc alloy production process using the developed heuristic algorithm. By using this system, we could find a monthly zinc alloy production schedule that significantly reduces the total number of setup changes.

• 전자공학회논문지
• /
• 제51권4호
• /
• pp.210-217
• /
• 2014

본 논문에서는 한 바퀴 구동 이동로봇, GYROBO,에 대한 제어를 실험적으로 수행하였다. 이전 자이로보는 제자리에서 밸런싱을 할 경우, 내부의 짐벌이 한 쪽으로 계속 회전하는 현상이 발생하여 결국 넘어지게 되는 결과를 초래하였다. 이 구조적 문제를 보완하여 균형 제어에 대한 실험적 연구를 수행하였다. 실험을 통해 구한 게인값을 사용하는 게인 스케줄링 방법을 통해 쏠리는 현상에 대한 해결방법을 찾았고, 자세제어를 더 안정화 시켰다. 또한 주행이 가능한지를 확인하기 위해 직선 경로 주행실험을 하였다.

• 전자공학회논문지C
• /
• 제34C권9호
• /
• pp.22-32
• /
• 1997

This paper proposes an imprecise compuitation model for DCT considering QOS of images and a two dimensional DCT architecture for imprecise computations. In case that many processes are scheduling in a hard real time system, the system resources are shared among them. Thus all processes can not be allocated enough system resources (such as processing power and communication bandwidth). The imprecise computtion model can be used to provide scheduling flexibility and various QOS(quality of service)levels, to enhance fault tolerance, and to ensure service continuity in rela time systems. The DCT(discrete cosine transform) is known as one of popular image data compression techniques and adopted in JPEG and MPEG algorithms since the DCT can remove the spatial redundancy of 2-D image data efficiently. Even though many commercial data compression VLSI chips include the DCST hardware, the DCT computation is still a very time-consuming process and a lot of hardware resources are required for the DCT implementation. In this paper the DCT procedure is re-analyzed to fit to imprecise computation model. The test image is simulated on teh base of this model, and the computation time and the quality of restored image are studied. The row-column algorithm is used ot fit the proposed imprecise computation DCT which supports pipeline operatiions by pixel unit, various QOS levels and low speed stroage devices. The architecture has reduced I/O bandwidth which could make its implementation feasible in VLSI. The architecture is proved using a VHDL simulator in architecture level.

• 한국컴퓨터정보학회논문지
• /
• 제13권6호
• /
• pp.233-241
• /
• 2008

최근 IP 멀티캐스팅 대신에 각광을 받고 있는 오버레이 멀티캐스팅은 다수의 사용자를 위하여 서버의 자원과 네트워크의 대역폭을 효율적으로 활용할 수 있는 스케줄링 기법이 필요하다. 따라서 본 논문에서는 효율적인 멀티미디어 서비스를 위하여 오버레이 멀티캐스팅 환경에서의 복합스트림 토폴로지 정책을 제안한다. 본 논문의 성능 평가를 위하여 본 논문과 유사성을 가진 Overcast[5]와 비교하여 멀티캐스트에 참여한 노드들의 RTT(Round Trip Time) 수치, 트리 구축시간에 따른 대역폭 소모량 측정, 그리고 수행시간에 따른 MOR 영향 실험을 하였다. 그 결과 약 $8{\sim}20%$의 성능의 향상을 보여 주었다.

• 산업경영시스템학회지
• /
• 제30권2호
• /
• pp.44-50
• /
• 2007

This paper deals with the problem of scheduling jobs and rate-modifying activities on parallel machines. A rate-modifying activity is an activity that changes the production rate of equipment such as maintenance and readjustment. If a job is scheduled after the rate-modifying activity, then the processing time varies depending on the modifying rate of the activity. In this study, we extend the single machine problem to parallel machines problem and propose algorithms is to schedule the rate-modifying activities and jobs to minimize the makespan on parallel machines which is NP-hard. We propose a branch and bound algorithm with three lower bounds to solve medium size problems optimally. Also we develop three heuristics, Modified Longest Processing Time, Modified MULTIFIT and Modified COMBINE algorithms to solve large size problems. The test results show that branch and bound algorithm finds the optimal solution in a reasonable time for medium size problems (up to 15 jobs and 5 machines). For large size problem, Modified COMBINE and Modified MULTIFIT algorithms outperform Modified LPT algorithm in terms of solution quality.

• 설비공학논문집
• /
• 제29권12호
• /
• pp.638-644
• /
• 2017

Optimal cooling operation algorithm was developed based on a simulation case of a single family house model equipped with renewable energy facility. EnergyPlus simulation results were used as virtual test data. The model contained three energy storage elements: thermal heat capacity of the living room, chilled water storage tank, and battery. Their charging and discharging schedules were optimized so that daily electricity bill became minimal. As an optimization tool, linear programming was considered because it was possible to obtain results in real time. For its adoption, EnergyPlus-based house model had to be linearly approximated. Results of this study revealed that dynamic cooling load of the living room could be approximated by a linear RC model. Scheduling based on the linear programming was then compared to that by a nonlinear optimization algorithm which was made using GenOpt developed by a national lab in USA. They showed quite similar performances. Therefore, linear programming can be a practical solution to optimal operation scheduling if linear dynamic models are tuned to simulate their real equivalents with reasonable accuracy.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1996년도 하계학술대회 논문집 B
• /
• pp.711-713
• /
• 1996

This paper proposes a unit commitment scheduling method based on Genetic Algorithm(GA). Due to a variety of constraints to be satisfied, the search space of the UC problem is highly nonconvex, so the UC problem cannot be solved efficiently only using the standard GA To efficiently deal with the constraints of the problem and greatly reduce the search space of the GA, the minimum up and down time constraints are embedded in the binary strings that are coded to represent the on-off states of the generating units. The violations of other constraints arc handled by integrating penalty factors. To show the effectiveness of the GA based unit commitment scheduling, test results for system of 5 units are compared with results obtained using Lagrangian Relaxation and Dynamic Programming.

• 한국산학기술학회논문지
• /
• 제10권7호
• /
• pp.1614-1620
• /
• 2009

최근 IP 멀티캐스팅 대신에 각광을 받고 있는 오버레이 멀티캐스팅 기법은 네트워크 응용계층의 서비스로써, 서버의 자원 활용과 네트워크의 대역폭에 대한 비용 면에서 유리하다. 본 논문에서는 효율적인 멀티미디어 서비스를 위하여 오버레이 멀티캐스팅 환경에서의 P2P 조인 스케줄링 정책을 제안한다. 본 논문의 성능 평가를 위하여 본 논문과 유사성을 가진 기법과 비교하여 멀티캐스트에 참여한 노드들의 평균노드 접속 수, 최대 대기 보장 시간의 위배 건수, 그리고 버퍼의 결함 확률을 실험을 하였다. 그 결과 약 15 ${\sim}$20%의 성능의 향상을 보여 주었다.

• 전기학회논문지
• /
• 제60권4호
• /
• pp.717-725
• /
• 2011

In the power system with an electric storage system that can increase utilization rate of the source of such new renewable energy, this paper introduces the approach on the daily unit commitment scheduling that determines simultaneously optimum operational condition and output of thermal generators and electric storage device. The unit commitment is one of the most important issues in economic operation and security of short-term operational plan of the power system. It is to determine on/off status of generator to minimize operational cost during the given period. The committed generator should satisfy various operational limitation such as estimated demand by system, spinning reserve condition within minimum operational cost. In order to determine on/off or charge/discharge/idle condition and output level of units and electric storage system, the MILP(Mixed Integer Linear Programming) is suggested. The proposed approach is the mixed method between LP(Linear Programming) and IP(integer programming) which seeks the value of real number and integer that maximize or minimize function objective within given condition. The daily unit commitment problem with the electric storage system is applied to MILP algorithm through linearization and formulation process. The proposed approach is applied to the test system.