• 동력기계공학회지
• /
• 제8권3호
• /
• pp.58-66
• /
• 2004

The sway motion control problem of a container hanging on the trolly is considered in the paper. In the container crane control problem, suppressing the residual swing motion of the container at the end of acceleration, deceleration or the case of that the unexpected disturbance input exists is main issue. For this problem, in general, many trolley motion control strategies are introduced and applied. In this paper, we introduce and synthesize a swing motion control system in which a small auxiliary mass is installed on the spreader made by ourselves. In this control system, the actuator reacting against the auxiliary mass applies inertial control forces to the container to reduce the swing motion in the desired manner. Especially, we apply the $H_{\infty}$ based gain-scheduling control technique the anti-sway control system design problem of the controlled plant. In this control system, the controller dynamics are adjusted in real-time according to time-varying plant parameters. And the simulation result shows that the proposed control strategy is shown to be useful to the case of time-varying system and, robust to disturbances like winds and initial sway motion.

• 정보처리학회논문지A
• /
• 제18A권3호
• /
• pp.93-98
• /
• 2011

최근 배터리로 동작하는 임베디드 시스템의 사용이 급격히 증가하고 있지만, 현재 배터리 기술의 발전 속도는 임베디드 시스템의 전력 사용량의 증가를 따라가지 못하여, 장시간 사용을 위해서는 배터리의 크기가 커져야 하는 단점이 있다. 내장형 시스템에서 소모하는 전력량은 시스템을 구성하는 하드웨어와 시스템을 구동하는 소프트웨어에 의해 결정된다. 그러나 하드웨어적으로 저전력을 지원하더라도 운영체제 등 소프트웨어 수준에서 이를 활용하지 못하면 절전 효과를 극대화할 수 없다. 따라서 본 논문에서는 모바일 임베디드 시스템 환경에서 멀티미디어 애플리케이션 구동시 BET(Break Even Time)기반 태스크 분할을 이용하여 소비 전력을 감소시키는 스케줄링 기법을 제안한다.

• 한국CDE학회논문집
• /
• 제14권6호
• /
• pp.424-433
• /
• 2009

In order to improve productivity and efficiency of ship production process, production technology converged with Information Technology can be considered. Mid-term scheduling based on long-term schedule of ship building and execution planning based on short-term production schedule have an important role in ship production processes and techniques. However, data used in the scheduling are from the experiences of the past, cognitive, and often inaccurate, moreover the updates of the data by formatted documents are not being performed efficiently. This paper designs the tracking and monitoring system for the curved plates forming process with shop level. At first step to it, we redefine and analyze the curved plates forming process by using SysML. From the definition and analysis of the curved plates forming process, we design the system with respect to operational view considering operational environment and interactions between systems included and scenario about operation, and with respect to system view considering functionalities and interfaces of the system. In order to study the feasibility of the system designed, a prototype of the system has been implemented with 13.56 MHz RHD hardware and application software.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1995년도 하계학술대회 논문집 B
• /
• pp.559-561
• /
• 1995

The cogeneration system has a strong merit in providing thermal and electrical energy simultaneously. Nowadays, cogeneration system is widely used in the point of efficient use of the energy resources And the installation of the system is expected to be greatly increased in each year. So, we need to develop an optimal operation planning for those systems. In this paper, we are used to result what studed at the my power system of room because it is in order to solve maintenance scheduling problem. Also we added a constraints to the proposed maintenance model for optimal maintenance rate. In the case study, we construct an multi-machine generated example system which operated in topping cycle, and calculate the yearly optimal production cost, marginal maintenance cost, and maintenance scheduling of the example system respectively.

• Journal of Communications and Networks
• /
• 제6권4호
• /
• pp.352-361
• /
• 2004

In this paper, we study how to achieve the maximum capacity under delay constraints for large mobile wireless networks. We develop a systematic methodology for studying this problem in the asymptotic region when the number of nodes n in the network is large. We first identify a number of key parameters for a large class of scheduling schemes, and investigate the inherent tradeoffs among the capacity, the delay, and these scheduling parameters. Based on these inherent tradeoffs, we are able to compute the upper bound on the maximum per-node capacity of a large mobile wireless network under given delay constraints. Further, in the process of proving the upper bound, we are able to identify the optimal values of the key scheduling parameters. Knowing these optimal values, we can then develop scheduling schemes that achieve the upper bound up to some logarithmic factor, which suggests that our upper bound is fairly tight. We have applied this methodology to both the i.i.d. mobility model and the random way-point mobility model. In both cases, our methodology allows us to develop new scheduling schemes that can achieve larger capacity than previous proposals under the same delay constraints. In particular, for the i.i.d. mobility model, our scheme can achieve (n-1/3/log3/2 n) per-node capacity with constant delay. This demonstrates that, under the i.i.d. mobility model, mobility increases the capacity even with constant delays. Our methodology can also be extended to incorporate additional scheduling constraints.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제8권8호
• /
• pp.2607-2625
• /
• 2014

Previous studies on multiuser multiple-input multiple-output (MIMO) mostly assume a homogeneous signal-to-noise ratio (SNR), where each user has the same average SNR. However, real networks are more likely to feature heterogeneous SNRs (a random-valued average SNR). Motivated by this fact, we analyze a multiuser MIMO downlink with a zero-forcing (ZF) receiver in a heterogeneous SNR environment. A transmitter with Mantennas constructs M orthonormal beams and performs the SNR-based proportional fairness (S-PF) scheduling where data are transmitted to users each with the highest ratio of the SNR to the average SNR per beam. We develop a new analytical expression for the sum throughput of the multiuser MIMO system. Furthermore, simply modifying the expression provides the sum throughput for important special cases such as homogeneous SNR, max-rate scheduling, or high SNR. From the analysis, we obtain new insights (lemmas): i) S-PF scheduling maximizes the sum throughput in the homogeneous SNR and ii) under high SNR and a large number of users, S-PF scheduling yields the same multiuser diversity for both heterogeneous SNRs and homogeneous SNRs. Numerical simulation shows the interesting result that the sum throughput is not always proportional to M for a small number of users.

• International Journal of Aeronautical and Space Sciences
• /
• 제17권1호
• /
• pp.89-100
• /
• 2016

Given the unpredictability of the space environment, satellite communications are manually performed by exchanging telecommands and telemetry. Ground support for orbiting satellites is given only during limited periods of ground antenna visibility, which can result in conflicts when multiple satellites are present. This problem can be regarded as a scheduling problem of allocating antenna support (task) to limited visibility (resource). To mitigate unforeseen errors and costs associated with manual scheduling and mission planning, we propose a novel method based on a genetic algorithm to solve the ground support problem of multiple satellites and antennae with visibility conflicts. Numerous scheduling parameters, including user priority, emergency, profit, contact interval, support time, remaining resource, are considered to provide maximum benefit to users and real applications. The modeling and formulae are developed in accordance with the characteristics of satellite communication. To validate the proposed algorithm, 20 satellites and 3 ground antennae in the Korean peninsula are assumed and modeled using the satellite tool kit (STK). The proposed algorithm is applied to two operation modes: (i) telemetry, tracking, and command and (ii) payload. The results of the present study show near-optimal scheduling in both operation modes and demonstrate the applicability of the proposed algorithm to actual mission control systems.

• 컴퓨터교육학회논문지
• /
• 제10권3호
• /
• pp.49-56
• /
• 2007

그리드는 과학이나 공학 분야에서 대규모 연산을 효율적으로 수행하기 위한 플랫폼으로 제공된다. 이러한 환경에서 자원관리나 태스크 스케줄링은 다루기가 매우 복잡하다. 본 논문에서는 웹 기반의 그리드 컴퓨팅 환경에서 시스템을 모델링하고 스케줄링 기법을 시뮬레이션 할 수 있는 스케줄링 툴킷(GridTool)을 설계하고 구현하였다. 구현한 웹 기반 그리드 스케줄링 툴킷은 자바 환경의 툴킷인 GridSim을 시뮬레이션 도구로 활용하였으며, 자원 모델링, 작업 모델링, 알고리즘 컴파일, 시뮬레이션, 성능분석을 웹 환경에서 효율적으로 수행할 수 있다. 본 논문에서 구현한 스케줄링 툴킷은 향후 그리드 연구에 기반구조로 활용될 수 있으며, 스케줄링 알고리즘의 성능 분석을 위한 도구로 사용될 수 있다.

• 한국기계가공학회지
• /
• 제16권4호
• /
• pp.113-118
• /
• 2017

As the demand for industrial robots and Automated Guided Vehicles (AGVs) increases, higher performance is also required from them. Fuzzy controllers, as part of an intelligent control system, are a direct control method that leverages human knowledge and experience to easily control highly nonlinear, uncertain, and complex systems. This paper uses a $LabVIEW^{(R)}-based$ fuzzy controller with gain scheduling to demonstrate better performance than one could obtain with a fuzzy controller alone. First, the work area was set based on forward kinematics and inverse kinematics programs. Next, $LabVIEW^{(R)}$ was used to configure the fuzzy controller and perform the gain scheduling. Finally, the proposed fuzzy gain scheduling controller was compared with to controllers without gain scheduling.

• 한국통신학회논문지
• /
• 제25권10B호
• /
• pp.1665-1674
• /
• 2000

This paper treats the interworking of LAN-based networks like TCP over the ATM protocol stack in an ATM multicast session. Multicast connection will cause CIP since multicast group members form a connection tree by some tree methods and share the connected tree. The paper solve the CIP problem through a block-by-block transmission using ABT/IT method. ABT/IT RM cell is modified and block scheduling algorithm considering the traffic types is applied to each ATM switch using the enhanced RM cell. Block scheduling algorithm will avoid the indiscriminate discard of UBR traffic when congestion occurs and it can provide an efficient and fair service. The paper builds a block scheduler system and suggests the block scheduling algorithm for a multicast session in an ATM switch. UBR traffics arriving at the switch trough each VC is classified by the traffic type and stored at class buffer and thereafter indisciminately transmitted. When block scheduling algorithm is applied it will improve the UBR traffic performance such as end-to-end delay cell block loss ration etc. This paper evaluated the performance of block scheduling algorithm through the simulation using the C language and data structure.