• Journal of Institute of Control, Robotics and Systems
• /
• v.1 no.2
• /
• pp.78-82
• /
• 1995

In this paper, we consider the robustness analysis problem in state space models with linear time invariant perturbations. Based upon the discrete-time Lyapunov approach, sufficient conditions are derived for the eigenvalues of perturbed matrix to be located in a circle, and robustness bounds on perturbations are obtained. Spaecially, for the case of a diagonalizable hermitian matrix the bound is given in terms of the nominal matrix without the solution of Lyapunov equation. This robustness analysis takes account not only of stability robustness but also of certain types of performance robustness. For two perturbation classes resulting bounds are shown to be improved over the existing ones. Examples given include comparison of the proposed analysis method with existing one.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.10
• /
• pp.947-955
• /
• 2004

This paper is concerned with a mixed control with aerodynamic fin and side thrust control applied to an agile missile using a dynamic inversion and a time-varying control technique. The nonlinear dynamic inversion method with the weighting function allocates the desired control inputs(aerodynamic fin and side thrust control) to achieve a reference command, and the time-varying control technique plays the role to guarantee the robustness for the uncertainties. The proposed schemes are validated by nonlinear simulations with aerodynamic data.

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

Parallel genetic algorithms are particularly easy to implement and promise substantial gains in performance. Its basic idea is to keep several subpopulations that are processed by genetic algorithms. Furthermore, a migration mechanism produces a chromosome exchange between subpopulation. In this paper, a new selection method based on non-linear fitness assignment presented. The use of proposed ranking selection permits higher local exploitation search, where the diversity of populations is structure. Experimental results show that the relation between local-global search balance and the probabilities of reaching a desired solution.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.9
• /
• pp.105-111
• /
• 2015

This paper suggests O(n) linear-time algorithm for car sequencing problem (CSP) that has been classified as NP-complete because of the polynomial-time algorithm to solve the solution has been unknown yet. This algorithm applies maximum options-equiped car type first production rule to decide the car sequencing of n meet the r:s constraint. This paper verifies thirteen experimental data with the six data are infeasible. For thirteen experimental data, the proposed algorithm can be get the solution for in all cases. And to conclude, This algorithm shows that the CSP is not NP-complete but the P-problem. Also, this algorithm proposes the solving method to the known infeasible cases. Therefore, the proposed algorithm will stand car industrial area in good stead when it comes to finding a car sequencing plan.

• Journal of Electrical Engineering and Technology
• /
• v.13 no.6
• /
• pp.2187-2195
• /
• 2018

In order to realize the multi-objective control of single-input multi-output nonlinear differential algebraic system (NDAS) and to improve the dynamic characteristics and static accuracy, a design method of nonlinear control with multi-objective feedback (NCMOF) is proposed, the principium of this method to arrange system poles, as well as its nature to coordinate dynamic characteristics and static accuracy of the system are analyzed in detail. Through NCMOF design method, the multi-objective control of the system is transformed into linear space, and then it is effectively controlled under the nonlinear feedback control law, the problem to balance all control objectives caused by less input and more output of the system thus is solved. Applying NCMOF design method to generator excitation system, the nonlinear excitation control law with terminal voltage, active power and rotor speed as objective outputs is designed. Simulation results show that NCMOF can not only improve the dynamic characteristics of generator, but also damp the mechanical oscillation of a generator in transient process. Moreover, NCMOF can control the terminal voltage of the generator to the setting value with no static error under typical disturbances.

• Spatial Information Research
• /
• v.5 no.2
• /
• pp.177-183
• /
• 1997

S1he concept of a class in the land-use classification system can be equally applied to a class in the land-use-change classification. The maximum likelihood method using linear discriminant function and Markov transition matrix method were integrated to a synthetic modeling effort in order to project spatial allocation of land-use-change and quantitative assignment of that prediction as a whole. The algorithm of both the multivariate discriminant function and the Markov chain matrix were discussed and the test of synthetic model on the study area was resulted in the projection of '90 year as well as '95 year land -use classification. The accuracy and the issue of modeling improvement were discussed eventually.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.21 no.5
• /
• pp.181-188
• /
• 2021

In preparing a aggregate production plan(APP), the transportation method generally uses a linear planning(LP) software package for TSM(transportation simplex method), which seeks initial solutions with either NCM, LCM, or VAM specialized in transportation issues and optimizes them with either SSM or MODI. On the other hand, this paper proposes a transportation method that easily, quickly, and accurately prepares a APP without software package assistance. This algorithm proposed simply assigned to least cost-first, and minimized the inventory periods. Applying the proposed algorithm to 6-benchmarking data, this algorithm can be obtained better optimal solution than VAM or LP for 4 data, and we obtain the same results for the remained 2 data.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.1
• /
• pp.153-162
• /
• 2013

This paper proposes the most simple method for optimal solution of the transshipment problem. Usually the transshipment problem is solved by direct linear programming or TSM (Transportation Simplex Method). The method using TSM has two steps. First it is to get a initial solution using NCM, LCM, or VAM, second to refine the initial solution using MOD or SSM. However the steps is complex and difficult. The proposed method applies the method that transforms transshipment problem to transportation problem. In the proposed method it simply selects the minimum cost of rows about transportation problem, and then it applies the method that assigns a transported volume as an ascending sort of the costs of rows about the selected costs. Our method makes to be very fast got the initial value. Also we uses the method that controls assignment volume, if a heavy item of cost is assigned to a transported volume and it has a condition to be able to transform to more lower cost. The proposed algorithm simply got the optimal solution with applying to 11 transshipment problem.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2022.10a
• /
• pp.459-461
• /
• 2022

One of the big differences between Network-on-Chip (NoC) and the existing parallel processing system based on an off-chip network is that data packet routing is performed using a centralized control scheme. In such an environment, the best-effort packet routing problem becomes a real-time assignment problem in which data packet arriving time and processing time is the cost. In this paper, the Hungarian algorithm, a representative computational complexity reduction algorithm for the linear algebraic equation of the allocation problem, is implemented in the form of a hardware accelerator. As a result of logic synthesis using the TSMC 0.18um standard cell library, the area of the circuit designed through case analysis for the cost distribution is reduced by about 16% and the propagation delay of it is reduced by about 52%, compared to the circuit implementing the original operation sequence of the Hungarian algorithm.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.31 no.1
• /
• pp.91-103
• /
• 2006

Given a bill of materials (BOM) tree T labeled by the breadth first search (BFS) order from node 0 to node n and a general network ${\Im}=(V,A)$, where V={1,2,...,m} is the set of production facilities and A is the set of arcs representing transportation links between any of two facilities, we assume that each node of T stands for not only a component. but also a production stage which is a possible stocking point and operates under a periodic review base-stock policy, We also assume that the random demand which can be achieved by a suitable service level only occurs at the root node 0 of T and has a normal distribution $N({\mu},{\sigma}^2)$. Then our integrated model of facility location problems and safety stock optimization problem (FLP&SSOP) is to identify both the facility locations at which partitioned subtrees of T are produced and the optimal assignment of safety stocks so that the sum of production cost, inventory holding cost, and transportation cost is minimized while meeting the pre-specified service level for the final product. In this paper, we first formulate (FLP&SSOP) as a nonlinear integer programming model and show that it can be reformulated as a 0-1 linear integer programming model with an exponential number of decision variables. We then show that the linear programming relaxation of the reformulated model has an integrality property which guarantees that it can be optimally solved by a column generation method.