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

This paper provides a new approach to analyze the stability of a general multi-link TCP Vegas, which is a kind of feedback-based congestion algorithm. Whereas the conventional approaches use the approximately linearized model of the TCP Vegas along equilibrium pints, this approach models a multi-link TCP Vegas network in the form of a piecewise linear multiple time-delay system. And then, based on the exactly characterized dynamic model, this paper presents a new stability criterion via a piecewise and multiple delay-dependent Lyapunov-Krasovskii function. Especially, the resulting stability criterion is formulated in terms of linear matrix inequalities (LMIs).

• Journal of Institute of Control, Robotics and Systems
• /
• v.9 no.2
• /
• pp.107-116
• /
• 2003

This paper presents a systematic design methodology for fault tolerant controller against a fault in actuators and sensors of linear stochastic systems with uncertainties. The scheme is based on fault detection and diagnosis(isolation and estimation) using a bank of robust two-stage Kalman filters, and accommodation of the actuator fault by eigenstructure assignment and immediate compensation of the sensor's faulty measurement. In order to clarify the fault feature in test statistics of residual, noise reduction method is given by multi-scale discrete wavelet transform. The effectiveness of our approach Is shown via simulations for a VTOL(vertical take-off and landing) aircraft subjected to parameter variations, external disturbances, process and sensor noises.

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

This paper considers the problem of state estimation in linear continuous-time systems with multi-sensor environment and observation uncertainties. We propose two suboptimal filtering algorithms for these types of systems. The filtering algorithms consist of two steps: The local optimal Kalman estimates are computed at the first step. And, these local estimates are lineally fused at the second step. The implementation of the two-step filtering algorithms needs a lower memory demand than the optimal Kalman and adaptive Lainiotis-Kalman filters. In consequence of parallel structure of the proposed filters, the parallel computers can be used for their design. The examples exhibit the effect of common noise on the performance of fusion of the local Kalman estimates based on observations from different sensors and in the presence of uncertainties.

• 제어로봇시스템학회:학술대회논문집
• /
• 1986.10a
• /
• pp.321-325
• /
• 1986

A new control scheme for the state space model of the robot system using the theory of optimal multi-variable structure is presented in this paper. It is proposed to optimize multi-dimensional variable structure systems for obtaining the required stabilizing signal by minimizing a performance index with respect to the state vector in the sliding mode. It is concluded the proposed variable structure controller yields better system dynamic performance than that obtained by using the only linear optimal controller inthat responses for a step disturbance have a shorter setting time, no matter what overshoot values and rising time.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.16 no.2
• /
• pp.13-24
• /
• 2006

We consider a privacy-preserving cooperative computation protocol evaluating a beneficial function of all participants' secret inputs, such that each party finally holds a share of the function output. We propose a practical privacy-preserving cooperative computation protocol for solving the linear system of equations problem md the linear least-squares problem. Solutions to these problems are widely used in many areas such as banking, manufacturing, and telecommunications. Our multi-party protocol is an efficiently extended version of the previous two-party model.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• v.5 no.1
• /
• pp.85-100
• /
• 2001

In this paper we propose a block-type parallel preconditioner for solving large sparse nonsymmetric linear systems, which we expect to be scalable. It is Multi-Color Block SOR preconditioner, combined with direct sparse matrix solver. For the Laplacian matrix the SOR method is known to have a nondeteriorating rate of convergence when used with Multi-Color ordering. Since most of the time is spent on the diagonal inversion, which is done on each processor, we expect it to be a good scalable preconditioner. Finally, due to the blocking effect, it will be effective for ill-conditioned problems. We compared it with four other preconditioners, which are ILU(0)-wavefront ordering, ILU(0)-Multi-Color ordering, SPAI(SParse Approximate Inverse), and SSOR preconditioner. Experiments were conducted for the Finite Difference discretizations of two problems with various meshsizes varying up to 1024 x 1024, and for an ill-conditioned matrix from the shell problem from the Harwell-Boeing collection. CRAY-T3E with 128 nodes was used. MPI library was used for interprocess communications. The results show that Multi-Color Block SOR and ILU(0) with Multi-Color ordering give the best performances for the finite difference matrices and for the shell problem only the Multi-Color Block SOR converges.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.63 no.8
• /
• pp.1080-1084
• /
• 2014

This paper addresses a design technique for formation tracking controllers of discrete-time Takagi-Sugeno fuzzy multi-agent systems based on consensus. The interconnection topology among the agents is expressed as a digraph. The design condition is represented in terms of linear matrix inequalities. Numerical example demonstrates the effectiveness of the proposed method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.3
• /
• pp.625-631
• /
• 2011

This paper presents a discrete-time output feedback consensus algorithm for Multi-Agent Systems (MAS). Under the assumption that an agent is aware of the relative state information about its neighbors, a state feedback consensus algorithm is designed based on Linear Matrix Inequality (LMI) method. In general, however, it is possible to obtain its relative output information rather than the relative state information. To reconcile this problem, an Unknown Input Observer (UIO) is employed in this paper. To this end, first it is shown that the relative state information can be estimated using the UIO and the measured relative output information. Then a certainty-equivalence type output feedback consensus algorithm is proposed by combining the LMI-based state feedback consensus algorithm with the UIO. Finally, simulation results are given to illustrate that the proposed method successfully achieves the state consensus.

• Journal of Institute of Control, Robotics and Systems
• /
• v.19 no.5
• /
• pp.390-397
• /
• 2013

This paper presents a consensus algorithm for uMAS (uncertain Multi-Agent Systems). Unlike previous results in which only nominal models for agents are considered, it is assumed that the uncertain agent model belongs to a known polytope set. In the middle of deriving the proposed algorithm, a convex set is found which includes all uncertainties in the problem using convexity of the polytope set. This set plays an important role in designing the consensus algorithm for uMAS. Based on the set, a consensus condition for uMAS is proposed and the corresponding consensus design problem is solved using LMI (Linear Matrix Inequality). Simulation result shows that the proposed consensus algorithm successfully leads to consensus of the state of uMAS.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.23 no.2
• /
• pp.133-138
• /
• 2013

This paper addresses a state consensus controller design technique of Takagi-Sugeno fuzzy model-based multi-agent systems in a continuous-time domain. We express the interconnection topology among the agents through graph theory. The design condition is represented in terms of linear matrix inequalities. Numerical example is provided to demonstrate the effectiveness of the proposed method.