• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.10
• /
• pp.997-1005
• /
• 2010

Most motion control systems consist of a desired trajectory generator, a motion controller such as a conventional PID controller, and a plant to be controlled. The desired trajectory generator as well as the motion controller is very important to achieve a good tracking performance. Especially, if the desired trajectory is generated actively utilizing the maximum velocity, acceleration, jerk and snap as given system specifications, the tracking performance would be better. For this, we make use of the properties of convolution operator in order to generate a smooth (S-curve) trajectory satisfying the system specifications. Also, the proposed trajectory generation method is extended to more general cases with arbitrary initial and terminal conditions. In addition, the suggested trajectory generator can be easily realized for real-time implementation. Finally, the effectiveness of the suggested method is shown through numerical simulations.

• Proceedings of the KIEE Conference
• /
• 1997.11a
• /
• pp.146-148
• /
• 1997

An LMI-based parameterization of all $\gamma$-suboptimal reduced-order unbiased $H_{\infty}$ filters is provided in terms of a free matrix, using the unbiasedness condition, bounded real lemma and the general solution of the basic LMI. Also, by sequentially solving the generalized eigenvalue minimization and basic LMI problem, the optimal filter coefficient matrix can be obtained with the best achievable performance.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.61 no.3
• /
• pp.466-471
• /
• 2012

In this paper, we consider the problem of a robust passive filtering with low-order for discrete-time singular systems with polytopic uncertainties. A BRL(bounded real lemma) for robust passivity with a dissipativity of discrete-time uncertain singular systems is derived. A low-order robust passive filter design method is proposed by new reduced-order method and LMI(linear matrix inequality) technique on the basis of the obtained BRL. Finally, illustrative examples are presented to show the applicability of the proposed method.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.1
• /
• pp.193-198
• /
• 2009

In this paper, we consider the design problem of delay-dependent robust $H{\infty}$ controller of discrete-time descriptor systems with parameter uncertainties and interval time-varying delays in state and control input by delay-dependent LMI (linear matrix inequality) technique. A new delay-dependent bounded real lemma for discrete-time descriptor systems with time-varying delays is derived. The condition for the existence of robust $H{\infty}$ controller and the robust $H{\infty}$ state feedback control law are proposed by LMI approach. A numerical example is demonstrated to show the validity of the design method.

• Proceedings of the KIEE Conference
• /
• 2007.04a
• /
• pp.92-94
• /
• 2007

This paper considers an optimal control problem for a remote control to an electrical drive system with a DC motor. Since it is a linear control system with time-delay subject to unknown but bounded disturbance, we construct a worst-case feedback control policy. This policy can guarantee that, for all admissible uncertain disturbances, the real system state should be in a prescribed neighborhood of a desired value, and the cost functional takes the best guarantee value. The worst-case feedback control policy is allowed to be corrected at one correction point between the initial to the final time, which is equivalent to solving a 1-level min-max problem. Since the min-max problem at the stage does not yield a simple analytical solution, we consider an approximate control policy, which is equivalent and can be solved explicitly m the numerical experiments.

• Journal of the Korean Mathematical Society
• /
• v.34 no.1
• /
• pp.181-193
• /
• 1997

The enumeration of various classes of paths in the real plane has an important implications in the area of combinatorics wit statistical applications. In 1887, D. Andre [3, pp. 21] first solved the famous ballot problem, formulated by Berttand [2], by using the well-known reflection principle which contributed tremendously to resolve the problems of enumeration of various classes of lattice paths in the plane. First, it is necessary to state the definition of NSEW-paths in the palne which will be employed throughout the paper. From [3, 10, 11], we can find results concerning many of the basics discussed in section 1 and 2.

• Bulletin of the Korean Mathematical Society
• /
• v.51 no.5
• /
• pp.1551-1559
• /
• 2014

We consider functions that map the open unit disc conformally onto the complement of an unbounded convex set with opening angle ${\pi}{\alpha}$, ${\alpha}{\in}(1,2]$, at infinity. We derive the exact interval for the variability of the real Taylor coefficients of these functions and we prove that the corresponding complex Taylor coefficients of such functions are contained in certain discs lying in the right half plane. In addition, we also determine generalized central functions for the aforesaid class of functions.

• Journal of Korea Multimedia Society
• /
• v.20 no.7
• /
• pp.1030-1037
• /
• 2017

Traffic flows of real-time multimedia services such as Internet phone and IPTV are bounded on the end-to-end delay. Packets violating their delay limits will be dropped at a router because of not useful anymore. Service providers promise the quality of their providing services in terms of SLA(Service Level Agreement), and they, especially, have to guarantee the packet loss rates listed in the SLA. This paper is about a method to guarantee the required packet loss rate of each traffic flow keeping the high network resource utilization as well. In details, it assures the required loss rate by adjusting adaptively the timestamps of packets of the flow according to the difference between the required and measured loss rates in the lossy Weighted Fair Queuing(WFQ) scheduler. The proposed method is expected to be highly applicable because of assuring the packet loss rates regardless of the fluctuations of offered traffic load in terms of quality of services and statistical characteristics.

• Proceedings of the KIEE Conference
• /
• 1999.11b
• /
• pp.200-202
• /
• 1999

This paper describes the optimization problem of real power rescheduling and present an algorithm based linear programming for studying the load-shedding and generation reallocation problem when a portion of the transmission system is disabled and at power flow solution cannot be obtained for the overload of some lines. And in case initial is infeasible, solution could not be converge. So this paper gives an algorithm being lie infeasible quantities within limit. The paper describes a LP-based algorithm to obtain the solution in power dispatch related to overload situations in power system and it is easily extened under various objective. The optimization procedures is based in linear programming with bounded variables and use the multi-segment curve method for a objective function and the validity of the algorithm is verified with two examples : 10-bus system and 57-bus system.

• The Pure and Applied Mathematics
• /
• v.27 no.1
• /
• pp.13-24
• /
• 2020

In this article, we investigate the solvability of nonlinear fractional integro-differential equations of the Hammerstein type. The results are obtained using the technique of measure of noncompactness and the Darbo theorem in the real Banach space of continuous and bounded functions in the interval [0, a]. At the end, an example is presented to illustrate the effectiveness of the obtained results.