• 오토저널
• /
• 제13권5호
• /
• pp.73-80
• /
• 1991

Air/fuel ratio control system for gasoline engines has been analyzed to determine the control gain of the system. In this analysis the engine is modelled to be a simple time delaying element and the ramp-and-jump method is used to control air/fuel ratio. The result shows that it is necessary to measure the air flow rate accurately to enhance the control performance. And also it is shown that the control gain must be determined in some bounded region to meet the fast dynamic response and high catalyst conversion efficiency together.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 B
• /
• pp.641-643
• /
• 1998

This paper deals with the stability of discrete time linear systems with time - varying delays in state. In this paper, the magnitude of time - varying delays is assumed to be upper-bounded. The stability of discrete time linear systems with time - varying delays in state is related with the stability of discrete time linear systems with constant time delay in state. To show this, a new Lyapunov function is proposed. Using this Lyapunov function, a sufficient condition for the asymptotic stability is derived.

• Journal of Communications and Networks
• /
• 제4권3호
• /
• pp.246-255
• /
• 2002

Constrained minimum Steiner tree (CMST) problem is a key issue in multicast routing with quality of service (QoS) support. Bounded shortest path algorithm (BSMA) has been recognized as one of the best algorithms for the CMST problem due to its excellent cost performance. This algorithm starts with a minimumdelay tree, and then iteratively uses a
-shortest-path (KSP) algorithm to search for a better path to replace a “superedge” in the existing tree, and consequently reduces the cost of the tree. The major drawback of BSMA is its high time complexity because of the use of the KSP algorithm. For this reason, we investigate in this paper the possibility of more efficient implementations of BSMA by using different methods to locate the target path for replacing a superedge. Our experimental results indicate that our methods can significantly reduce the time complexity of BSMA without deteriorating the cost performance.

• 산업경영시스템학회지
• /
• 제40권3호
• /
• pp.66-75
• /
• 2017

Priority disciplines are an important scheme for service systems to differentiate their services for different classes of customers. (N, n)-preemptive priority disciplines enable system engineers to fine-tune the performances of different classes of customers arriving to the system. Due to this virtue of controllability, (N, n)-preemptive priority queueing models can be applied to various types of systems in which the service performances of different classes of customers need to be adjusted for a complex objective. In this paper, we extend the existing (N, n)-preemptive resume and (N, n)-preemptive repeat-identical priority queueing models to the (N, n)-preemptive repeat-different priority queueing model. We derive the queue-length distributions in the M/G/1 queueing model with two classes of customers, under the (N, n)-preemptive repeat-different priority discipline. In order to derive the queue-length distributions, we employ an analysis of the effective service time of a low-priority customer, a delay cycle analysis, and a joint transformation method. We then derive the first and second moments of the queue lengths of high- and low-priority customers. We also present a numerical example for the first and second moments of the queue length of high- and low-priority customers. Through doing this, we show that, under the (N, n)-preemptive repeat-different priority discipline, the first and second moments of customers with high priority are bounded by some upper bounds, regardless of the service characteristics of customers with low priority. This property may help system engineers design such service systems that guarantee the mean and variance of delay for primary users under a certain bounds, when preempted services have to be restarted with another service time resampled from the same service time distribution.

• 한국정보처리학회논문지
• /
• 제4권11호
• /
• pp.2822-2831
• /
• 1997

ATM을 기반으로 하는 B-ISDN 망은 다양한 트래픽 특성과 서비스 요구사항을 가진 여러가지 종류의 서비스를 지원해야한다. ATM 계층에는 link 계층간의 흐름 제어나 에러 제어가 없다. 그러나 다양한 종류의 각종 서비스를 위해 각기 다른 다른 흐름／에러 제어 기법이 AAL 계층이나 상위 계층(예를 들어 OSI 7 계층의 4번 전송 계층)에서 수행될 수 있다. 전통적인 데이타망에서는 에러 제어 기법이 결합된 윈도우 흐름 제어 기법이 널리 사용되었다. 그러나 윈도우 흐름 제어 기법은 전파 전달 지연(Propagation delay)이 전송률(Transmission rate)에 비해 상대적으로 너무 크기 때문에 ATM 망에서 유용하지 않을 수 있다. 본 논문에서는 양단간(end-to-end) 자료 전송을 위한 매우 간단한 흐름제어 기법인 RCT (Rate Control for end-to-end Transport)를 제안한다. RCT는 평균 과부하(Overload) 기간의 분포가 특정 시간대에 편중되어 있을 때에 높은 성능을 보인다．

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 1998년도 가을 학술발표논문집 Vol.25 No.2 (3)
• /
• pp.287-289
• /
• 1998

실시간 스케줄러는 대역폭, 필요 버퍼량 등과 같은 네트워크 자원을 효율적으로 이용하면서 한정된 통신지연(bounded delay)을 제공해야 한다. 최근 이러한 제한 조건을 만족시키기 위해서 많은 스케줄링 방법론이 제시되었다. 그중EDF 스케줄링 방법론이 최적의 성능을 갖는 것으로 알려져있다. 그러나 EDF스케줄링 방법론은 "sort"나 "search"와 같은 연산작업을 수행함으로서, 과다한 오버헤드를 발생시킨다. Rotating Priority Queues(RPQ) 스케줄러는 EDF 연산 작업 없이 EDF스케줄러에 근접한 성능을 갖는 스케줄러이다. 그러나 RPQ스케줄러는 과다한 버퍼량을 필요로 한다. 본 논문에서는 이러한 문제저？ㄹ 해결하기위해서 Multiple Rotating Priority Queues(MRPQ)스케줄러를 제시한다. MRPQ스케줄러는"blick queue"라는 새로운 개념을 이용하여 회전 우선 순위 queue를 다중 계츨으로 구성한다. 이렇게 구성된 MRPQ 스케줄러는 RPQ스케줄러에서 필요한 버퍼량의 반정도의 버퍼량만을 사용하여 RPQ스케줄러와 동일한 동작을 수행한다. 또한 MRPQ스케줄러는 RPQ스케줄러와 동일한 최대 지연시간을 제공한다.러는 RPQ스케줄러와 동일한 최대 지연시간을 제공한다.

• 전기학회논문지
• /
• 제66권9호
• /
• pp.1364-1372
• /
• 2017

In this paper, a problem of event-triggered model predictive control is investigated for continuous-time Takagi-Sugeno (T-S) fuzzy systems with input quantization. To efficiently utilize network resources, event-trigger is employed, which transmits limited signals satisfying the condition that the measurement of errors is over the ratio of a certain level. Considering sampling and quantization, continuous Takagi-Sugeno (T-S) fuzzy systems are regarded as a sector bounded continuous-time T-S fuzzy systems with input delay. Then, a model predictive controller (MPC) based on parallel distributed compensation (PDC) is designed to optimally stabilize the closed loop systems. The proposed MPC optimize the objective function over infinite horizon, which can be easily calculated and implemented solving linear matrix inequalities (LMIs) for every event-triggered time. The validity and effectiveness are shown that the event triggered MPC can stabilize well the systems with even smaller average sampling rate and limited actuator signal guaranteeing optimal performances through the numerical example.

• 제어로봇시스템학회논문지
• /
• 제15권8호
• /
• pp.823-830
• /
• 2009

For developing automotive parts and telematics devices the real car test often shows limitation because it needs high cost, much time and has the possibility of the accident. Therefore, a Vehicle Driving Simulator (VDS) instead of the real-car test has been used by some automotive manufactures, research centers, and universities. The VDS is a virtual reality device which makes a human being feel as if one drives a vehicle actually. Unlike actual vehicle, the simulator has limited kinematic workspace and bounded dynamic characteristics. So it is difficult to simulate dynamic motions of a multi-body vehicle model fully. In order to overcome these problems, a washout algorithm which restricts workspace of the simulator within the kinematic limits is needed, and analysis of dynamic characteristics is required also. However, a classical washout algorithm contains several problems such as time delay and generation of wrong motion signal caused by characteristics of filters. Specially, the classical washout algorithm has the simulator sickness when driver hardly turns brakes and accelerates the VDS. In this paper, a new washout algorithm is developed to enhance the motion sensitivity and improve the simulator sickness by using the vehicle tilt signal which is generated in the real time vehicle dynamic model.

• 제어로봇시스템학회논문지
• /
• 제3권1호
• /
• pp.101-108
• /
• 1997

The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

• 제어로봇시스템학회논문지
• /
• 제14권1호
• /
• pp.88-94
• /
• 2008

In this paper, a design method of a missile guidance command is presented considering the dynamics of missile control systems. The design of a new guidance command is based on the well-known PNG(propotional navigation guidance) laws. The missile control system dynamics cause the time-delays of the PN guidance command and degrade the performance of original guidance laws which are designed under the assumption of the ideal missile control systems. Using a backstepping method, these time-delay effects can be compensated. In order to implement the guidance command developed by the backstepping procedure, it is required to measure or calculate the successive time-derivatives of the original guidance command, PNG and other kinematic variables such as the relative distance. Instead of directly using the measurements of these variables and their successive derivatives, a simple disturbance observer technique is employed to estimate a guidance command described by them. Using Lyapunov method, the performance of a newly developed guidance command is analyzed against a target maneuvering with a bounded and time-varying acceleration.