• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1883-1887
• /
• 1991

Identification theory for linear discrete system has been presented by a great many reference, but research works for identification of continuous-time system are less than preceding identification. In fact, a great man), systems for engineering are continuous-time systems, hence, research for identification of continuous-time system has important meaning. This paper offers the following results: 1. Corresponding relations for the parameters of continuous-time model and discrete model may be shown, when single input-output system has general characteristic roots. 2. To do identification of single variable continuity linear system with stability constraints from samples of input-output data, it is necessary to use optimization with stability constraints. 3. Main results of this paper may be explained by a simple example.

• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.680-684
• /
• 2005

This paper presents a data-based stability analysis of a MIMO linear time-invariant discrete-time system, as an extension of the previous results for a SISO system. In the MIMO case, a similar discussion as in the case of a SISO system is also applied, except that an augmented input and output space is considered whose dimension is determined in relation to both the orders of the input and output vectors and the numbers of inputs and outputs. As certain subspaces of the input and output space, both output data space and closed-loop data space are defined, which contain all the behaviors of a system, respectively, with zero input in open-loop and with a control input in closed-loop. Then, we can derive the data-based stability conditions, in which the open-loop stability can be checked by using a data matrix whose column vectors span the output data space and the closed-loop stability can also be checked by using a data matrix whose column vectors span the closed-loop data space.

• 제어로봇시스템학회:학술대회논문집
• /
• 2004.08a
• /
• pp.1993-1998
• /
• 2004

This paper proposes a new framework for control system design, called the data-based control approach or data space approach, in which the input and output data of a dynamical system is directly and solely used to analyze or design a control system without the employment of any mathematical models like transfer functions, state space equations, and kernel representations. Since, in this approach, most of the analysis and design processes are carried out in the domain of the data space, we introduce some notions of geometrical objects, e.g., the openloop and closed-loop data spaces, which serve as the system representations in the data space. In addition, we establish a relationship between the open-loop and closed-loop data spaces that the closed-loop data space is contained in the open-loop data space as one of its subspaces. By using this relationship, we can derive the data-based stabilization condition for a linear time-invariant discrete-time system, which leads to a linear matrix inequality with a rank constraint.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.2
• /
• pp.35-44
• /
• 1994

In this paper, an observer for linear discrete systems with unknown inputs is presented. The suggested observer can estimate the system state vector and the unknown inputs simultaneously. As an extension of the observer, a new fault diagnosis observer for linear discrete systems with structured uncertainty is presented. The fault diagnosis observer can detect and identify the actuator and the sensor faults as well. The stability conditionsand the design methods of the each observers are presented and the usability of the observers is shown via numerical examples.

• Journal of the Korean Statistical Society
• /
• v.35 no.3
• /
• pp.281-303
• /
• 2006

In an earlier work, we investigated the problem of using linear programming to bound performance measures in a discrete time Jackson network. There it was assumed that the system evolution is controlled by the early arrival scheme. This assumption implies that the system can't be modelled by a Markov chain. This problem was resolved and performance bounds were calculated. In the present work, we use a modification of the early arrival scheme (without corrupting it) in order to make the system evolves as a Markov chain. This modification enables us to obtain explicit expressions for certain moments that could not be calculated explicitly in the pure early arrival scheme setting. Moreover, this feature implies a reduction in the linear program size as well as the computation time. In addition, we obtained tighter bounds than those appeared before due to the new setting.

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

This paper considers a stochastic discrete algebraic Riccati equation, which is a generalized version of the well-known standard discrete algebraic Riccati equation, and has additional linear terms. Under controllability, observability and the assumption that the additional terms are not too large, the existence of a positive definite solution is guaranteed. It is shown that it arises in optimal control of a linear discrete-time system with multiplicative White noise and quadratic cost. A numerical example is given.

• 제어로봇시스템학회:학술대회논문집
• /
• 1989.10a
• /
• pp.884-889
• /
• 1989

In this paper, a new procedure for selecting weighting matrices in linear discrete time quadratic optimal control problem (LQ-problem) is proposed. In LQ-problems, the quadratic weighting matrices are usually decided on trial and error in order to get a good response. But using the proposed method, the quadratic weights are decided in such a way that all poles of the closed loop system are located in a desired region for good responses as well as for stability and values of the quadratic cost function are kept less then a specified value.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.3
• /
• pp.1255-1263
• /
• 2015

In the previous work, the authors studied the problem of robust discretization of linear time-invariant systems with polytopic uncertainties, where linear matrix inequality (LMI) conditions were developed to find an approximate discrete-time (DT) model of a continuous-time (CT) system with uncertainties in polytopic domain. The system matrices of obtained DT model preserved the polytopic structures of the original CT system. In this paper, we extend the previous approach to solve the problem of robust discretization of polytopic uncertain systems with aperiodic sampling. In contrast with the previous work, the sampling period is assumed to be unknown, time-varying, but contained within a known interval. The solution procedures are presented in terms of unidimensional optimizations subject to LMI constraints which are numerically tractable via LMI solvers. Finally, an example is given to show the validity of the proposed techniques.

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

In this paper, a discrete-time variable structure controller for linear time-varying systems with time-varying disturbances is proposed. The proposed method guarantees that the system state is globally uniformly ultimately bounded (G,U.U.B.) under the existence of external disturbances.

• Journal of the Institute of Electronics Engineers of Korea SC
• /
• v.39 no.2
• /
• pp.95-103
• /
• 2002

This paper deals with the H$_{\infty}$ control problems for discrete-time linear systems with time-varying delays in states. The existence condition and the design method of the H$_{\infty}$ state feedback controller are given. In this paper, the H$_{\infty}$ control law is assumed to be a memoryless state feedback, and the upper-bound of time-varying delay and S-procedure are used. Through some changes of variables and Schur complement, the obtained sufficient condition can be rewritten as an LMI(linear matrix inequality) form in terms of all variables.