• Journal of Institute of Control, Robotics and Systems
• /
• v.5 no.7
• /
• pp.777-786
• /
• 1999

This work is concerned with the assignment of the desired eigenstructure for linear time-varying systems such as missiles, rockets, fighters, etc. Despite its well-known limitations, gain scheduling control appeared to be the focus of the research efforts. Scheduling of frozen-time, frozen-state controller for fast time-varying dynamics is known to be mathematically fallacious, and practically hazardous. Therefore, recent research efforts are being directed towards applying time-varying controllers. In this paper, ⅰ) we introduce a differential algebraic eigenvalue theory for linear time-varying systems, and ⅱ) we also propose an eigenstructure assignment scheme for linear time-varying systems via the differential Sylvester equation based upon the newly developed notions. The whole design procedure of the proposed eigenstructure assignment scheme is very systematic, and the scheme could be used to determine the stability of linear time-varying systems easily as well as provides a new horizon of designing controllers for the linear time-varying systems. The presented method is illustrated by a numerical example.

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

In this paper, we propose a new stability criterion and a controller design method for switched linear systems. The proposed stability criterion is applicable to each subsystem independently without the need to consider the overall system. The controller can be easily designed through geometric relations between eigenvalues of each subsystem matrix. The proposed methods provide a systematic and simple pole assignment approach for switched linear systems. Illustrative examples are given.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.22 no.5
• /
• pp.159-164
• /
• 2022

The linear assignment problem (LAP) and linear bottleneck assignment problem (LBAP) has been unknown the algorithm to solve the optimal solution within polynomial-time. These problems are classified by NP-hard. Therefore, we can be apply metaheuristic methods or linear programming (LP) software package or Hungarian algorithm (HA) with O(m⁴) computational complexity. This paper suggests polynomial time algorithm with O(mn)=O(m²),m=n time complexity to LAP and LBAP. The select-delete method is simply applied to LAP, and the delete-select method is used to LBAP. For the experimental data without the unique algorithm can be apply to whole data, the proposed algorithm can be obtain the optimal solutions for whole data.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1994.04a
• /
• pp.236-243
• /
• 1994

In this paper we consider the part-machine cell formation decision of the generalized Group Technology(GT) problem in which multiple process routes can be generated for each part. The existing p-median model and similarity coefficient algorithm can solve only small-sized or well-structured cases. We suggest an assignment method for the cell formation problem. This method uses an assignment model which is a simple linear programming. Numerical examples show that our assignment method provides good separable cells formation even for large-sized and ill-structured problems.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.1
• /
• pp.131-138
• /
• 2016

In this paper, we propose a simple linear bottleneck assignment problems (LBAP) algorithm to find the optimal solution. Generally, the LBAP has been solved by threshold or augmenting path algorithm. The primary characteristic of proposed algorithm is derived the optimal solution of LBAP from linear sum assignment problem (LSAP). Firstly, we obtains the solution for LSAP from the selected minimum cost of rows and moves the duplicated costs in row to unselected row with minimum increasing cost in direct and indirect paths. Then, we obtain the optimal solution of LBAP according to the maximum cost of LSAP can be move to less cost. For the 29 balanced and 7 unbalanced problem, this algorithm finds optimal solution as simple.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.601-604
• /
• 1997

In this paper, a pole assignment problem in the unit disk for a linear discrete system is discussed. The analysis is based on the Luenberger's canonical form and Gershgorin's disk. The proposed method for pole assignment is convenient for a linear time invariant discrete system.

• 전기의세계
• /
• v.31 no.3
• /
• pp.209-217
• /
• 1982

This paper considers a finite spectrum assignment Problem for a functional retarded linear differential system with delays in control only. In this problem, by generalizing from an abstract linear system characterized by Semigroups on a Hilbert space to a finite dimensional linear system, we unify the relationship between a control-delayed system and its non-delayed system, and then by using the spectrum of the generator-decomposition of Semigroup, we try to get a feedback law which yields a finite spectrum of the closed-loop system, located at an arbitrarily preassigned sets of n points in the complex plane. The comparative examinations between the standard spectrum assignment method and the method of spectral projection for the feedback law which consists of proportional and finite interval terms over present and past values of control variables are also considered. The analysis is carry down to the elementary spectral projection level because, in spite of all the research efforts, so far there has been no significant attempt to obtain the feedback implementation directly from the abstract representation forms in the case of multivariables.

• Journal of IKEEE
• /
• v.23 no.4
• /
• pp.1353-1359
• /
• 2019

It is presented in this paper that the static output feedback (SOF) pole-assignment problem of some linear time-invariant systems can be completely resolved by parametrization in real Grassmann space. For the real Grassmannian parametrization, the so-called Plucker matrix is utilized as a linear matrix formula formulated from the SOF variable's coefficients of a characteristic polynomial constrained in Grassmann space. It is found that the exact SOF pole assignability is determined by the linear independency of columns of Plucker sub-matrix and by full-rank of that sub-matrix. It is also presented that previous diverse pole-assignment methods and various computation algorithms of the real SOF gains for 2-input, 2-output, 4^th order systems are unified in a deterministic way within this real Grassmannian parametrization method.

• Journal of Korean Institute of Industrial Engineers
• /
• v.24 no.4
• /
• pp.591-600
• /
• 1998

The scheduling of parallel computing systems consists of two procedures, the assignment of tasks to each available processor and the ordering of tasks in each processor. The assignment procedure is same with a clustering. The clustering is classified into linear or nonlinear according to the precedence relationship of the tasks in each cluster. The parallel computing system can be modeled with a Directed Acyclic Graph(DAG). By the granularity theory, DAG is categorized into Coarse Grain Type(CDAG) and Fine Grain Type(FDAG). We suggest the linear clustering method for the scheduling of CDAG using the genetic algorithm. The method utilizes a properly that the optimal schedule of a CDAG is one of linear clustering. We present the computational comparisons between the suggested method for CDAG and an existing method for the general DAG including CDAG and FDAG.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.8
• /
• pp.641-646
• /
• 2001

Eigenstructure assignment is a typical method with the capability of consideration of the time-domain specifications in designing a linear control system. In this paper, we propose a new method for eigenstructure to achieve desired eigenvectors more precisely than with the conventional method. In the proposed method, the conventional eigenstructure assignment problem is interpreted as a constrained optimization one, and it converted into an unconstrained optimization problem to deal with the problem easily. Numerical examples are presented to illustrate the proposed flexible eigenstructure assignment method.