• Transactions on Control, Automation and Systems Engineering
• /
• v.3 no.3
• /
• pp.139-145
• /
• 2001

In this paper, we consider the H$_2$(or guaranteed cost control) and H$_{\infty}$ controller design methods for singular(or descriptor) systems with input time delay. Also, a mixed H$_2$and H$_{\infty}$ controller design algorithm is treated by combination of the proposed H$_2$and H$_{\infty}$ controller design method. The sufficient conditions for the existence of controllers and controller design methods are introduced at each Lemma and Theorem. Furthermore, we present optimization problems to get the upper bound of performance measures. The proposed methods are checked by examples.

• Transactions on Control, Automation and Systems Engineering
• /
• v.1 no.2
• /
• pp.128-133
• /
• 1999

This paper presents a new delay-dependent robust stabilization condition for uncertain time-delay systems. An algorithm involving convex optimization is proposed to compute a suboptimal upper bound of the delay such that the system can be stabilized by the controller for all admissible uncertainties. It is illustrated by numerical examples that the proposed delay-dependent controller can be less conservative than previous results. It is also shown that the proposed delay-dependent controller can even capture the delay-independent stability of the system, which is not possible with existing delay-dependent results.

• 제어로봇시스템학회:학술대회논문집
• /
• 1995.10a
• /
• pp.424-427
• /
• 1995

In this paper, a control law based on the receding horizon concept which robustly stabilizes time-varying discrete linear systems, is proposed. A dynamic game problem minimizing the worst case performance, is adopted as an optimization problem which should be resolved at every current time. The objective of the proposed control law is to guarantee the closed loop stability and the infinite horizon $H^{\infty}$ norm bound. It is shown that the objective can be achieved by selecting the proper terminal weighting matrices which satisfy the inequality conditions proposed in this paper. An example is included to illustrate the results..

• Journal of Institute of Control, Robotics and Systems
• /
• v.13 no.6
• /
• pp.581-588
• /
• 2007

In this paper, we propose a delayed feedback guaranteed cost controller design method for linear time-delay systems with norm-bounded parameter uncertainties and nonlinear perturbations. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, an LMI optimization problem is formulated to design a controller such that the closed-loop cost function value is not more than a specified upper bound for all admissible system uncertainties and nonlinear perturbations. Numerical example show the effectiveness of the proposed method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.6 no.11
• /
• pp.3008-3025
• /
• 2012

In this paper, the downlink resource allocation of OFDMA system with decode-and-forward (DF) relaying is investigated. A non-convex optimization problem maximizing system throughput with users' satisfaction constraints is formulated with joint relay selection, subcarrier assignment and power allocation. We first transform it to a standard convex problem and then solve it by dual decomposition. In particular, an Optimal resource allocation scheme With Time-sharing (OWT) is proposed with combination of relay selection, subcarrier allocation and power control. Due to its poor adaption to the fast-varying environment, an improved version with subcarrier Monopolization (OWM) is put forward, whose performance promotes about 20% compared with that of OWT in the fast-varying vehicular environment. In fact, OWM is the special case of OWT with binary time-sharing factor and OWT can be seen as the tight upper bound of the OWM. To the best of our knowledge, such algorithms and their relation have not been accurately investigated in cooperative OFDMA networks in the literature. Simulation results show that both the system throughput and the users' satisfaction of the proposed algorithms outperform the traditional ones.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.2
• /
• pp.221-227
• /
• 2019

It has long been known that weapon target assignment (WTA) problem is NP-hard. Nonetheless, an exact solution can be found using Brute-Force or branch-and bound method which utilize approximation. Many heuristic algorithms, genetic algorithm particle swarm optimization, etc., have been proposed which provide near-optimal solutions in polynomial time. This paper suggests polynomial time algorithm that can be obtain the optimal solution of WTA problem for the number of total weapons k, the number of weapon types m, and the number of targets n. This algorithm performs k times for O(mn) so the algorithm complexity is O(kmn). The proposed algorithm can be minimize the number of trials than brute-force method and can be obtain the optimal solution.

• Journal of the Society of Naval Architects of Korea
• /
• v.31 no.4
• /
• pp.147-156
• /
• 1994

Though optimization method had been used for long time for the optimal design of ship structure, design variables in the most cases were assumed to be continuous real values or it was not easy to solve the mixed integer optimum design problems using the conventional optimization methods. Thus, it was often tried to use various initial starting points to locate the best optimum paint and to use special method such as branch and bound method to handle the discrete design variables in the optimization problems. Sometimes it had succeed, but the essential problems for dealing with the local optimum and discrete design variables was left unsolved. Hence, in this paper, Genetic Algorithms adopting the biological evolution process is applied to the ship structural design problem where the integer values for the number of stiffen design variables or the discrete values for the plate thickness variables would be more preferable in order to find out their effects on the final optimum design. Through the numerical result comparisons, it was found that Genetic Algorithm could always yield the global optimum for the discrete and mixed integer structural optimization problem cases even though it takes more time than other methods.

• Interaction and multiscale mechanics
• /
• v.5 no.3
• /
• pp.211-228
• /
• 2012

This paper reports the development of a generalized inverse analysis formulation for the parameter estimation of four-parameter Burger model. The analysis is carried out by formulating the problem as a mathematical programming formulation in terms of identification of the design vector, the objective function and the design constraints. Thereafter, the formulated constrained nonlinear multivariable problem is solved with the aid of fmincon: an in-built constrained optimization solver module available in MatLab. In order to gain experience, a synthetic case-study is considered wherein key issues such as the determination and setting up of variable bounds, global optimality of the solution and minimum number of data-points required for prediction of parameters is addressed. The results reveal that the developed technique is quite efficient in predicting the model parameters. The best result is obtained when the design variables are subjected to a lower bound without any upper bound. Global optimality of the solution is achieved using the developed technique. A minimum of 4-5 randomly selected data-points are required to achieve the optimal solution. The above technique has also been adopted for real-time settlement of four oil refineries with encouraging results.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.5
• /
• pp.272-281
• /
• 1988

The problem of optimal transmission system planning is to find the most economical locations and time of transmission line construction under the various constraints such as available rights-of-way, finances, the technical characteristics of power system, and the reliability criterion of power supply, and so on. In this paper the constraint of right-of-way is represented as a finite set of available rights-of-way. And the constructed for a unit period. The electrical constraints are represented in terms of line overload and steady state stability margin. And the reliability criterion is dealt with the suppression of failure cost and with single-contingency analysis. In general, the transmission planning problem requires integer solutions and its objective function is nonlinear. In this paper the objective function is defined as a sum of the present values of construction cost and the minimum operating cost of power system. The latter is represented as a sum of generation cost and failure cost considering the change of yearly load, economic dispatch, and the line contingency. For the calculation of operating cost linear programming is adopted on the base of DC load flow calculation, and for the optimization of main objective function nonlinear Branch-and-Bound algorithm is used. Finally, for improving the efficiency of B & B algorithm a new sensitivity analysis algorithm is proposed.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.11
• /
• pp.13-21
• /
• 2013

The goal of this paper is to provide performance improvement and stability for satellite data correction of some distortions due to cloud or radiance through distributed processing on cluster. To do this, we proposed and implemented SGE(Sun Grid Engine) based distributed processing methods using local storages and a status table. In the verification, the experiment result revealed that the proposed system on seven nodes improved the processing speed by 138.81% as compare to the existing system and provided good stability as well. This result showed that the proposed distributed processing work is more appropriate to process CPU bound jobs than I/O bound jobs. We expect that the proposed system will give scientists improved analysis performance in various fields and near-real time analysis services.