• International Journal of Control, Automation, and Systems
• /
• v.1 no.2
• /
• pp.178-183
• /
• 2003

This work is a modified version of an earlier work that was based on ellipsoidal type feasible sets. Unlike the earlier work, polyhedral types of invariant and feasible sets are adopted to deal with input constraints. The use of polyhedral sets enables the formulation of on-line algorithm in terms of QP (Quadratic Programming), which can be solved more efficiently than semi-def algorithms. A simple numerical example shows that the proposed method yields larger stabilizable sets with greater bounds on disturbances than is the case in the earlier approach.

• Journal of applied mathematics & informatics
• /
• v.20 no.1_2
• /
• pp.595-602
• /
• 2006

Determinations of conformal map from the unit disk onto a Jordan region are reduced to solve the Theodorsen equation which is an integral equation for the boundary correspondence function. Among numerical conformal maps the Wegmann's method is well known as a Newton efficient one for solving Theodorsen equation. However this method has not so wide class of convergence. We proposed as an improved method for convergence by applying a low frequency filter to the Wegmann's method. In this paper, we investigate error analysis and propose an automatic algorithm based on this analysis.

• Journal of applied mathematics & informatics
• /
• v.5 no.3
• /
• pp.701-716
• /
• 1998

In this paper we develop algorithms in programming lan-guage SCHEME for implementation of the main first order gradient techniques for unconstrained optimization. Implementation of the de-scent techniques which use non-optimal descent steps as well as imple-mentation of the optimal descent techniques are described. Also we investigate implementation of the global problem called optimization along a line. Developed programs are effective and simpler with re-spect to the corresponding in the procedural programming languages. Several numerical examples are reported.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.2
• /
• pp.97-102
• /
• 2009

In this paper, the problem of stability analysis for networked control systems with norm-bounded parameter uncertainties is investigated. By construction Lyapunov's functional, a new delay-dependent stability criterion for uncertain networked control system is established in terms of LMIs (linear matrix inequalities) which can be easily by various convex optimization algorithms. One numerical example is included to show the effectiveness of proposed criterion.

• Journal of Industrial Technology
• /
• v.12
• /
• pp.69-76
• /
• 1992

An attempt has been made to determination the NC milling machine's tool-path through the adaptive parabolic interpolation method & the adaptive linear-parabolic interpolation method in consideration of the economical machining time. The algorithms for the above-mentioned interpolation methods have been designed and the numerical experiments for these methods have been conducted with the existing adaptive linear interpolation methods for comparision.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.1014-1020
• /
• 1990

Iterative algorithms for detecting the collision of convex objects whose motion is characterized by a path in configuration space are described. They use as an essential substep the computation of the distance between the two objects. When the objects are polytopes in either two or three dimensional space, an algorithm is given which terminates in a finite number of iterations. It determines either that no collision occurs or the first collision point on the path. Extensive numerical experiments for practical problems show that the computational time is short and grows only linearly in the total number of vertices of the two polytopes.

• Proceedings of the KSR Conference
• /
• 2000.11a
• /
• pp.720-726
• /
• 2000

The advance of traction motor control technology and the complexity of the traction power supply system makes the simulation essential in determining the dimension of the traction power supply system. The conventional method, use of the simplified and/or empirical equations, becomes inadequate in optimization of the design. The simulator presented in this paper is a numerical time based simulator running on a PC. The input to the simulator includes the track data, the train characteristic, network data and operating data. Basically the simulator conducts train running simulation and loadflow study repeatedly. The principle algorithms and its output is discussed in the paper.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2000.05a
• /
• pp.570-573
• /
• 2000

A control law for a SCARA robot manipulator is designed using recursive torque methods. This scheme uses previous torques and error dynamics to generate torque controls at the present time and adopts relatively simple numerical and control algorithms that can be easily realizable. In order to evaluate the performance and robustness of the suggested control system, the 2-link SCARA robot manipulator is practically implemented using a dSPACE interface. It is found that the recursive controller has a good tracking performance in spite of the presence of payload disturbances.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.983-994
• /
• 2000

We consider the problem of determining the circle of best fit to a set of data points in the plane. In [1] and [2] several algorithms already have been given for fitting a circle in least squares sense of minimizing the geometric distances to the given data points. In this paper we present another new descent algorithm which computes a parametric represented circle in order to minimize the sum of the squares of the distances to the given points. For any choice of starting values our algorithm has the advantage of ensuring convergence to a local minimum. Numerical examples are given.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.813-831
• /
• 2000

In recent years, the theory of Wiener-Hopf equations has emerged as a novel and innovative technique for developing efficient and powerful numerical methods for solving variational inequalities and complementarity problems. In this paper, we provide an account of some of the fundamental aspects of the Wiener-Hopf equations with major emphasis on the formulation, computational algorithms, various generalizations and their applications. We also suggest some open problems for further research with sufficient information and references.