• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.59.5-59
• /
• 2002

In this paper, we present a robust controller design method that can not only deal with the constant time delay plant but also an uncertain time delay one. For a constant time delay plant. The proposed DTC can independently adjust the set response and the disturbance response without any stability constraint. And in the uncertain time delay case, one can process the control design step with uncertainty norm bound. To verify real effectiveness, theoretical analysis and simulation results are given.

• Journal of the Korean Institute of Telematics and Electronics C
• /
• v.36C no.11
• /
• pp.64-74
• /
• 1999

A new clock skew optimization for clock routing using link-edge insertion is proposed in this paper. It satisfies the given skew bound and prevent the total wire length from increasing. As the clock skew is the major constraint for high speed synchronous ICs, it must be minimized in order to obtain high performance. But clock skew minimization can increase total wire length, therefore clock routing is performed within the given skew bound which can not induce the malfunction. Clock routing under the specified skew bound can decrease total wire length Not only total wire length and delay time minimization algorithm using merging point relocation method but also clock skew reduction algorithm using link-edge insertion technique between two nodes whose delay difference is large is proposed. The proposed algorithm construct a new clock routing topology which is generalized graph model while previous methods uses only tree-structured routing topology. A new cost function is designed in order to select two nodes which constitute link-edge. Using this cost function, delay difference or clock skew is reduced by connecting two nodes whose delay difference is large and distance difference is short. Furthermore, routing topology construction and wire sizing algorithm is developed to reduce clock delay. The proposed algorithm is implemented in C programming language. From the experimental results, we can get the delay reduction under the given skew bound.

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.699-717
• /
• 2012

In this paper, we deal with the robust mixed $H_2/H_{\infty}$ guaranteed-cost control problem involving uncertain neutral stochastic distributed delay systems. More precisely, the aim of this problem is to design a robust mixed $H_2/H_{\infty}$ guaranteed-cost controller such that the close-loop system is stochastic mean-square exponentially stable, and an $H_2$ performance measure upper bound is guaranteed, for a prescribed $H_{\infty}$ attenuation level ${\gamma}$. Therefore, the fast convergence can be fulfilled and the proposed controller is more appealing in engineering practice. Based on the Lyapunov-Krasovskii functional theory, new delay-dependent sufficient criteria are proposed to guarantee the existence of a desired robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which are derived in terms of linear matrix inequalities(LMIs). Furthermore, the design problem of the optimal robust mixed $H_2/H_{\infty}$ guaranteed cost controller, which minimized an $H_2$ performance measure upper bound, is transformed into a convex optimization problem with LMIs constraints. Finally, two simulation examples illustrate the design procedure and verify the expected control performance.

• Journal of Internet Computing and Services
• /
• v.5 no.6
• /
• pp.11-20
• /
• 2004

Proportional Fair (PF) share policy has been adopted as a downlink scheduling scheme in CDMA2000 l×EV-DO standard. Although It offers optimal performance in aggregate throughput conditioned on equal time share among users, it cannot provide a bandwidth guarantee and a strict delay bound. which is essential requirements of real-time (RT) applications. In this study, we propose a new scheduling policy that provides quality-of-service (QoS) guarantees to a variety of traffic types demanding diverse service requirements. In our policy data traffic is categorized Into three classes, depending on sensitivity of Its performance to delay or throughput. And the primary components of our policy, namely, Proportional Fair (PF), Weighted Fair Queuing (WFQ), and delay-based prioritized scheme are intelligently combined to satisfy QoS requirements of each traffic type. In our policy all the traffic categories run on the PF policy as a basis. However the level of emphasis on each of those ingredient policies is changed in an adaptive manner by taking into account the channel conditions and QoS requirements. Such flexibility of our proposed policy leads to offering QoS guarantees effectively and. at the same time, maximizing the throughput. Simulations are used to verify the performance of the proposed scheduling policy. Experimental results show that our proposal can provide guaranteed throughput and maximum delay bound more efficiently compared to other policies.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.2
• /
• pp.128-133
• /
• 1999

This paper presents a new delay-dependent robust stabilization condition for uncertain time-delay systems. An algorithm involving convex optimization is proposed to compute a suboptimal upper bound of the delay such that the system can be stabilized by the controller for all admissible uncertainties. It is illustrated by numerical examples that the proposed delay-dependent controller can be less conservative than previous results. It is also shown that the proposed delay-dependent controller can even capture the delay-independent stability of the system, which is not possible with existing delay-dependent results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.6B
• /
• pp.495-507
• /
• 2006

In wireless local area networks (WLANs), the successful design of scheduling algorithm is a key factor in guaranteeing the various quality of service (QoS) requirements for the stringent real-time constraints of multimedia services. In this paper we propose a multipolling-based dynamic scheduling algorithm for providing delay guarantees to multimedia traffics such as MPEG streams. The dynamic algorithm exploits the characteristics of MPEG stream, and uses mini frames for feedback control in order to deliver dynamic parameters for channel requests from stations to the point coordinator (PC) operating at the access point (AP). In this scheme, the duration of channel time allocated to a station during a superframe is changed dynamically depending on the MPEG frame type, traffic load and delay bound of the frame, etc. Performance of the proposed scheme is investigated by simulation. Our results show that compared to conventional scheme, the proposed scheme is very effective and has high performance while guaranteeing the delay bound.

• 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.

• 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.

• Transactions on Control, Automation and Systems Engineering
• /
• v.2 no.2
• /
• pp.98-103
• /
• 2000

This paper is concerned with a delay-dependent sliding mode scheme for the robust stabilization of input-delay systems with bounded unknown uncertainties. A sliding surface based ona predictor is proposed to minimize the effect of the input delay. Then, a robust control law is derived to ensure the existence of a sliding mode on the surface. In input-delay systems, uncertainties given during te delayed time are not directly controlled by the switching control because of causality prolem of them. They can influence the stability of the system in the sliding mode. Hence, a delay-dependent stability analysis for reduced order dynamics is employed to estimate maximum delay bound such that the system is globally asymptotically stable in the sliding mode. A numerical example is given to illustrate the design procedure.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.16 no.4
• /
• pp.89-96
• /
• 2016

In this paper, we study mobile data collector (MDC) based data-gathering schemes in wireless sensor networks. In Such networks, MDCs are used to collect data from the environment and transfer them to the sink. The majority of existing data-gathering schemes suffer from high data-gathering latency because they use only a single MDC. Although some schemes use multiple MDCs, they focus on maximizing network lifetime rather than minimizing packet delay. In order to address the limitations of existing schemes, this paper focuses on minimizing packet delay for given number of MDCs and minimizing the number of MDCs for a given delay bound of packets. To achieve the minimum packet delay and minimum number of MDCs, two optimization problems are formulated, and traveling distance and traveling time of MDCs are estimated. The interior-point algorithm is used to obtain the optimal solution for each optimization problem. Numerical results and analysis are presented to validate the proposed method.