• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• pp.1432-1435
• /
• 1996

This paper obtains maximum allowable delay bounds for stability of network-based control systems and presents a network scheduling method which makes the network-induced delay be less than the maximum allowable delay bound. The maximum allowable delay bounds are obtained using the Lyapunov theorem. Using the network scheduling method, the bandwidth of a network can be allocated to each node and the sampling period of each sensor and controller can be determined. The presented method can handle three kinds of data (periodic, real-time asynchronous, and non real-time asynchronous data) and guarantee real-time transmissions of real-time synchronous data and periodic data, and possible transmissions of non real-time asynchronous data. The proposed method is shown to be useful by examples in two types of network protocols such as the token control and the central control.

• Architectural research
• /
• 제9권1호
• /
• pp.31-37
• /
• 2007

This study presents the so-called Modified Allowable Stress Design (MASD) method for structural designs. The objective of this study is to qualitatively estimate uncertainties of tensile steel member's cross-sectional structural designs and find the optimal resulting design which can resist all uncertainty cases. The design parameters are assumed to be interval associated with lower and upper bounds and consequently interval methods are implemented to non-stochastically produce design results including the structural uncertainties. By seeking optimal uncertainty combinations among interval parameters, engineers can qualitatively describe uncertain design solutions which were not considered in conventional structural designs. Under the assumption that structures have basically uncertainties like displacement responses, the safety range of resulting designs is represented by lower and upper bounds depending on given tolerance error and structural parameters. As a numerical example uncertain cross-sectional areas of members that can resist applied loads are investigated and it demonstrates that the present design method is superior to conventional allowable stress designs (ASD) with respect to a reliably structural safety as well as an economical material.

• 제어로봇시스템학회논문지
• /
• 제5권7호
• /
• pp.794-799
• /
• 1999

This study deals with robustness bounds estimation for uncertain linear systems with structured perturbations where the eigenvalues of the perturbed systems are guaranteed to stay in a prescribed region. Based upon the Lyapunov approach, new theorems to estimate allowable perturbation parameter bounds are derived. The theorems are referred to as the zero-order or first-order asymmetric robustness measure depending on the order of the P matrix in the sense of Taylor series expansion of perturbed Lyapunov equation. It is proven that Gao's theorem for the estimation of stability robustness bounds is a special case of proposed zero-order asymmetric robustness measure for eigenvalue assignment. Robustness bounds of perturbed parameters measured by the proposed techniques are asymmetric around the origin and less conservative than those of conventional methods. Numerical examples are given to illustrate proposed methods.

• 제어로봇시스템학회논문지
• /
• 제2권3호
• /
• pp.158-164
• /
• 1996

In this paper, we consider the problem of robust stability of discretd time-delay systems subjected to perturbations. Two classes of perturbations are treated. The first one is the nonlinear norm-bounded perturbation, and the second is the structured time-varying parametric perturbation. Based on the discrete-time Lyapunov stability theory, several new sufficient conditions for robust stability of the system are presented. From these conditions, we can estimate the maximum allowable bounds of the perturbations which guarantee the stability. Finally, numerical examples are given to demonstrate the effectiveness of the results.

• 제어로봇시스템학회논문지
• /
• 제18권10호
• /
• pp.895-901
• /
• 2012

The stability robustness problem of linear discrete systems with time-varying unstructured uncertainty of delayed states with time-varying delay time is considered. The proposed conditions for stability can be used for finding allowable bounds of timevarying uncertainty and delay time, which are solved by using LMI (Linear Matrix Inequality) and GEVP (Generalized Eigenvalue Problem) known as powerful computational methods. Furthermore, the conditions can imply the several previous results on the uncertainty bounds of time-invariant delayed states. Numerical examples are given to show the effectiveness of the proposed algorithms.

• 제어로봇시스템학회논문지
• /
• 제12권7호
• /
• pp.719-727
• /
• 2006

This paper proposes a new method to obtain a maximum allowable delay bound for a scheduling of networked discrete control systems and event-based scheduling method. The proposed method is formulated in terms of linear matrix inequalities and can give a much less conservative delay bound than the existing methods. A network scheduling method is presented based on the delay obtained through the proposed method, and it can adjust the sampling period to allocate same utilization to each control loop. The presented method can handle three types of data (sporadic, emergency data, periodic data and non real-time message) and guarantees real-time transmission of periodic and sporadic emergency data using modified EDF scheduling method.

• Management Science and Financial Engineering
• /
• 제19권2호
• /
• pp.19-29
• /
• 2013

Refuse collection network design, one of major decision problems in reverse logistics, is the problem of locating collection points and allocating refuses at demand points to the opened collection points. As an extension of the previous models, we consider capacity and maximum allowable distance constraints at each collection point. In particular, the maximum allowable distance constraint is additionally considered to avoid the impractical solutions in which collection points are located too closely. Also, the additional distance constraint represents the physical distance limit between collection and demand points. The objective is to minimize the sum of fixed costs to open collection points and variable costs to transport refuses from demand to collection points. After formulating the problem as an integer programming model, we suggest an optimal branch and bound algorithm that generates all feasible solutions by a simultaneous location and allocation method and curtails the dominated ones using the lower bounds developed using the relaxation technique. Also, due to the limited applications of the optimal algorithm, we suggest two heuristics. To test the performances of the algorithms, computational experiments were done on a number of test instances, and the results are reported.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 1996년도 추계학술대회발표논문집; 고려대학교, 서울; 26 Oct. 1996
• /
• pp.295-298
• /
• 1996

We consider a nonpreemptive single-machine scheduling problem to minimize the mean squared deviation(MSD) of job completion times about a common due date d with a maximum tardiness constraint, i.e., maximum tardiness is less than or equal to the given allowable amount, .DELTA.(MSD/T$_{max}$ problem). We classify the .DELTA.-unconstrained cases in the MSD/T$_{max}$ problem. We provide bounds to discern each case for the problem. It is also shown that the .DELTA.-unconstrained MSD/T$_{max}$ problem is equivalent to the unconstrained MSD problem and the tightly .DELTA.-constrained MSD/T$_{max}$ problem with n jobs and a maximum allowable tardiness .DELTA. can be converted into the constrained MSD problem with a common due date .DELTA. and n-1 jobs. Finally, the solution procedure for MSD/T$_{max}$ problem is provided. provided.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.172.1-172
• /
• 2001

In this paper we show the stability analysis of the discrete nonlinear system with average bounded variation of the input. This is the discrete counterpart of that continuous one. We use the Lyapunov stability to prove the boundedness of the steady-state error. Also the allowable maximum variation bounds and the region of attraction are given as the function of the system parameters. Moreover, we prove the uniform convergence for the constant input.

• 산업기술연구
• /
• 제11권
• /
• pp.107-114
• /
• 1991

This paper deals with the robustness of closed-loop poles of a linear time-invariant system with uncertain parameters. A new method is presented to calculate the perturbation of a pole-located region due to parameter uncertainties. A method to calculate allowable bounds on parameter uncertainties is also presented to retain closed-loop poles in a specified region. Based on Lyapunov equations and norm operations, they provide useful measures on the robustness of closed-loop poles. An example is given to illustrate proposed methods.