• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.13-13
• /
• 2000

This paper considers delay-dependent guaranteed cost control for uncertain time-delay systems with norm-bounded parametric uncertainties. A new delay-dependent condition for the existence of the guaranteed cost control law is presented in terms of linear matrix inequalities (LMI). An algorithm involving convex optimization is proposed to design a controller which guarantees the suboptimal minimum of the guaranteed cost of the closed-loop system for all admissible uncertainties.

• International Journal of Control, Automation, and Systems
• /
• v.3 no.4
• /
• pp.524-532
• /
• 2005

This paper concerns delay-dependent guaranteed cost control (GCC) problem for a class of linear state-delayed systems with norm-bounded time-varying parametric uncertainties. By incorporating the free weighing matrix approach developed recently, new delay-dependent conditions for the existence of the guaranteed cost controller are presented in terms of matrix inequalities for both nominal state-delayed systems and uncertain state-delayed systems. An algorithm involving convex optimization is proposed to design a controller achieving a suboptimal guaranteed cost such that the system can be stabilized for all admissible uncertainties. Through numerical examples, it is shown that the proposed method can yield less guaranteed cost than the existing delay-dependent methods.

• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.1
• /
• pp.27-31
• /
• 2001

In this paper, we consider the guaranteed cost filtering design method for time-varying delay system with parameter uncertainties by LMI(Linear Matrix Inequality) approach. The objective is to design a stable guaranteed cost filter which minimizes the guaranteed cost fo the closed loop systems in filtering error dynamics. The sufficient conditions for the existence of filter, the guaranteed cost filter design method, and th guaranteed cost upper bound are proposed by LMI technique in terms of all finding variables. Finally, we give an example to check the validity of the proposed method.

• Management Science and Financial Engineering
• /
• v.12 no.1
• /
• pp.1-34
• /
• 2006

In this paper, the impact of information sharing, possibly with some delay, on costs in a simple supply chain in which there are two participants, a single retailer and a single manufacturer, is considered. When participants in the supply chain do not use fully integrated EDI, some delay associated with information sharing is inevitable. A mathematical model that allows us to quantify the cost incurred by the manufacturer in the supply chain under information sharing, possibly with some delay, vs. no information sharing is presented. From this model, some managerial implications are gleaned.

• Journal of the Korea Society for Simulation
• /
• v.16 no.1
• /
• pp.1-9
• /
• 2007

The development of efficient Qualify of Service (QoS) routing algorithms in high speed networks is extremely difficult to achieve, because in order to operate, divergent services require various quality conditions. If the parameter of concern is to measure the delay on a specific link, the routing algorithm obtains the Least Delay (LD) path. Meanwhile, if the parameter is to measure the link cost, the Least Cost (LC) path is calculated. The Delay Constrained Least Cost (DCLC) path problem of the mixed issues on the LD and LC has been shown to be NP-hard. The path cost of LD path is relatively more expensive than that of the LC path, and the path delay of the LC path is relatively higher than that of the LD path in the DCLC problem. In this paper, we introduce the new factor for balancing cost and delay. The simulation result shows that our introduced factor is satisfied to solve the DCLC problem.

• ETRI Journal
• /
• v.22 no.1
• /
• pp.30-37
• /
• 2000

Existing tree construction mechanisms are classified into source-based trees and center-based trees. The source-based trees produce a source-rooted tree with a low delay. However, for the applications with multiple senders, the management overheads for routing tables and resource reservations are too high. The center-based trees are easy to implement and manage, but a priori configuration of candidate center nodes is required, and the optimization mature such as tree cost and delay is not considered. In this paper, we propose a new multicast tree building algorithm. The proposal algorithm basically builds a non-center based shared tree. In particular, any center node is not pre-configured. In the purposed algorithm, a multicast node among current tree nodes is suitably assigned to each incoming user: Such a node is selected in a fashion that tree cost and the maximum end-to-end delay on the tree are jointly minimized. The existing and proposed algorithms are compared by experiments. In the simulation results, it is shown that the proposed algorithm approximately provides the cost saving of 30% and the delay saving of 10%, compared to the existing approaches. In conclusion, we see that the cost and delay aspects for multicast trees can be improved at the cost of additional computations.

• Journal of Internet Computing and Services
• /
• v.8 no.1
• /
• pp.25-31
• /
• 2007

The development of efficient Quality of Service (QoS) routing algorithms in high speed networks is very difficult since divergent services require various quality conditions, If the QoS parameter we concern is to measure the delay on that link, then the routing algorithm obtains the Least Delay (LD) path, Meanwhile, if the parameter is to measure of the link cast, then it calculates the Least Cost (LC) path. The Delay Constrained Least Cast (DCLC) path problem of the mixed issues on LD and LC has been shown to be NP-hard. The path cost of LD path is relatively mere expensive than that of LC path, and the path delay of LC path is relatively higher than that of LD path in DCLC problem. In this paper. we propose the algorithm based on estimated path for the DCLC problem and investigate its performance, It employs a new parameter which is probabilistic combination of cost and delay, We have performed empirical evaluation that compares our proposed algorithm with the DCUR in various network situations.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.17 no.5
• /
• pp.29-38
• /
• 2018

This study aims to propose a method for the estimation of operational delay cost using transportation card data in bus accidents. Average operational delay time from bus accidents was surveyed among 12 bus companies through an interview method. Then, the operational delay cost was estimated using actual traffic accident data and transportation card data. Results showed that average loss time per bus accident was found to be 45 minutes. In addition, total occupancy of 659 was estimated for the accidents investigated using transportation card data, resulting a total loss time of 494.25 hours. An estimated operational delay cost was 186.9 thousand won per accident, which was 6.37% of social agency cost. The magnitude of this number implied that operational delay cost may have a significant impact on traffic accident cost if included.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.62.4-62
• /
• 2001

In this paper, we propose a delay-dependent guaranteed cost controller design method for uncertain linear systems with time delay. The uncertainty is norm bounded and time-varying. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, sufficient condition, which guarantees that the closed-loop system is asymptotically stable and the upper bound value of the closed-loop cost function is not more than a specied one, is derived in terms of Linear Matrix Inequalities(LMIs) that can be solved sufficiently. A convex optimization problem can be formulated to design a guaranteed cost controller, which minimizes the upper bound value of the cost function. Numerical examples show the activeness of the proposed method.

• Proceedings of the KIEE Conference
• /
• 2006.04a
• /
• pp.246-248
• /
• 2006

This paper is concerned with non-fragile guaranteed cost state feedback controller design algorithm for descriptor systems with time-varying delay and static state feedback controller with multiplicative uncertainty. The considered uncertainties are norm-bounded and time delay is time-varying. Under the condition of controller gain variations, conditions for the existence of controller satisfying asymptotic stability and non-fragility and controller design method are derived via LMI approach. Moreover, the measure of non-fragility and the upper bound to minimize guaranteed cost function are given.