• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10a
• /
• pp.248-251
• /
• 1991

A robust monitor AGC(Automatic Gauge Control) system for a hot strip mill plant of POSCO Is designed by minimizing the H.inf. norm of a so called mixed sensitivity function. In order to solve the mininizatlon problem, a polynomial approach proposed by Kwakernaak[5] is used. The controller performance is tested by a computer simulation under various circumstances.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.3
• /
• pp.205-215
• /
• 2004

The characteristic ratio assignment (CRA) method〔1〕 is new polynomial approach which allows to directly address the transient responses such as overshoot and speed of response time in time domain specifications. The method is based on the relationships between time response and characteristic ratios($\alpha_i$ ) and generalized time constant (T), which are defined in terms of coefficients of characteristic polynomial. However, even though the CRA can apply to developing a linear controller that meets good transient responses, there are still some fundamental questions to be explored. For the purpose of this, we have analyzed several sensitivities of a linear system with respect to the changes of coefficients itself and $\alpha_i$ of denominator polynomial. They are (i) the unnormalized root sensitivity : to determine how the poles change as $\alpha_i$ changes, and (ii) the function sensitivity to determine the sensitivity of step response to the change of o, and to analyze the sensitivity of frequency response as o, changes. As an other important result, it is shown that, under any fixed T and coefficient of the lowest order of s in denominator, the step response is dominantly affected merely by $\alpha_1, alpha_2 and alpha_3$ regardless of the order of denominator higher than 4. This means that the rest of the$\alpha_i$ s have little effect on the step response. These results provide some useful insight and background theory when we select $\alpha_i$ and T to compose a reference model, and in particular when we design a low order controllers such as PID controller.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.4
• /
• pp.156-166
• /
• 2014

As of 2014, KARI (Korea Aerospace Research Institute) operates two high-resolution satellites such as Kompsat-2 and Kompsat-3. Kompsat-3 has capability of in-track stereo images acquisition but it is quite limited because the stereo mode lowers the spatial coverage in a trajectory. In this paper we analyze the epipolar geometry from the heterogeneous Kompsat-2 and Kompsat-3 image combination to epipolar resample them for 3D spatial data acquisition. The analysis was carried out using the piecewise approach with RPCs (Rational Polynomial Coefficients) and the result showed the parabolic epipolar curve pattern. We also concluded that the third order polynomial transformation is required for epipolar image resampling. The resampled image pair showed 1 pixel level of y-parallax and can be used for 3D display and digitizing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.5
• /
• pp.2375-2393
• /
• 2016

Key agreement is paramount in secure wireless communications. A promising approach to address key agreement schemes is to extract secure keys from channel characteristics. However, because channels lack randomness, it is difficult for wireless networks with stationary communicating terminals to generate robust keys. In this paper, we propose a Robust Secure Key Agreement (RSKA) scheme from Received Signal Strength (RSS) in stationary wireless networks. In order to mitigate the asymmetry in RSS measurements for communicating parties, the sender and receiver normalize RSS measurements and quantize them into q-bit sequences. They then reshape bit sequences into new l-bit sequences. These bit sequences work as key sources. Rather than extracting the key from the key sources directly, the sender randomly generates a bit sequence as a key and hides it in a promise. This is created from a polynomial constructed on the sender's key source and key. The receiver recovers the key by reconstructing a polynomial from its key source and the promise. Our analysis shows that the shared key generated by our proposed RSKA scheme has features of high randomness and a high bit rate compared to traditional RSS-based key agreement schemes.

• Proceedings of the Korean Society of Near Infrared Spectroscopy Conference
• /
• 2001.06a
• /
• pp.1041-1041
• /
• 2001

Removal of variability in spectra data before the application of chemometric modeling will generally result in simpler (and presumably more robust) models. Particularly for sparsely sampled data, such as typically encountered in diode array instruments, the use of Savitzky-Golay (S-G) derivatives offers an effective method to remove effects of shifting baselines and sloping or curving apparent baselines often observed with scattering samples. The application of these convolution functions is equivalent to fitting a selected polynomial to a number of points in the spectrum, usually 5 to 25 points. The value of the polynomial evaluated at its mid-point, or its derivative, is taken as the (smoothed) spectrum or its derivative at the mid-point of the wavelength window. The process is continued for successive windows along the spectrum. The original paper, published in 1964 [1] presented these convolution functions as integers to be used as multipliers for the spectral values at equal intervals in the window, with a normalization integer to divide the sum of the products, to determine the result for each point. Steinier et al. [2] published corrections to errors in the original presentation [1], and a vector formulation for obtaining the coefficients. The actual selection of the degree of polynomial and number of points in the window determines whether closely situated bands and shoulders are resolved in the derivatives. Furthermore, the actual noise reduction in the derivatives may be estimated from the square root of the sums of the coefficients, divided by the NORM value. A simple technique to evaluate the actual convolution factors employed in the calculation by the software will be presented. It has been found that some software packages do not properly account for the sampling interval of the spectral data (Equation Ⅶ in [1]). While this is not a problem in the construction and implementation of chemometric models, it may be noticed in comparing models at differing spectral resolutions. Also, the effects on parameters of PLS models of choosing various polynomials and numbers of points in the window will be presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.168-173
• /
• 2003

In this paper, we will present a deeper look on optimal design methods that are related to path-planning for a mobile robot. To control the motion of a mobile robot in a clustered environment, it's necessary to know a suitable trajectory assuming certain start and goal point. Up to now, there are many literatures that concern optimal path planning for an obstacle avoided mobile robot. Among those literatures, we have chosen 2 novel methods for our further analysis. The first approach [4] is based on HJB(Hamilton-Jacobi-Bellman) equation whose solution is the return-function that helps to generate a shortest path to the goal. The later [5] is called polynomial-path-planning approach, in this method, a shortest polynomial-shape path would become a solution if it was a collision-free path. The camera network plays the role as sensors to generate updated map which locates the static and dynamic objects in the space. Therefore, the exhibition of both path planning and dynamic obstacle avoidance by the updated map would be accomplished simultaneously. As we mentioned before, our research will include the motion control of a true mobile robot on those optimal planned paths which were generated by above algorithms. Base on the kinematic and dynamic simulation results, we can realize the affection of moving speed to the stable of motion on each generated path. Also, we can verify the time-optimal trajectory through velocity tuning. To simplify for our analysis, we assumed the obstacles are cylindrical circular objects with the same size.

• Korean Journal of Remote Sensing
• /
• v.30 no.4
• /
• pp.505-510
• /
• 2014

Normalized Difference Vegetation Index (NDVI) is a major indicator for monitoring climate change and detecting vegetation coverage. In order to retrieve NDVI, it is preprocessed using cloud masking and atmospheric correction. However, the preprocessed NDVI still has abnormally low values known as noise which appears in the long-term time series due to rainfall, snow and incomplete cloud masking. An existing method of using polynomial regression has some problems such as overestimation and noise detectability. Thereby, this study suggests a simple method using amoving average approach for correcting NDVI noises using SPOT/VEGETATION S10 Product. The results of the moving average method were compared with those of the polynomial regression. The results showed that the moving average method is better than the former approach in correcting NDVI noise.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.14 no.6
• /
• pp.57-65
• /
• 2006

An approximate function approach has been developed using the subsystem synthesis method for real-time multibody vehicle dynamics models. In this approach, instead of solving loop closure constraint equations of the suspension linkage, approximate functions are used. The approximate function represents the functional relationship between dependent coordinates and independent coordinates of the suspension subsystem. This kinematic relationship is also included in the suspension subsystem equations of motion. Different order of polynomial functions are tried to find out the best candidate functions. The proposed method is also compared with the conventional subsystem synthesis method to verify its efficiency and accuracy.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.22 no.4
• /
• pp.811-825
• /
• 1998

An approximate line search is presented for dynamic response optimization with Augmented Lagrange Multiplier(ALM) method. This study empolys the approximate a augmented Lagrangian, which can improve the efficiency of the ALM method, while maintaining the global convergence of the ALM method. Although the approximate augmented Lagragian is composed of only the linearized cost and constraint functions, the quality of this approximation should be good since an approximate penalty term is found to have almost second-order accuracy near the optimum. Typical unconstrained optimization algorithms such as quasi-Newton and conjugate gradient methods are directly used to find exact search directions and a golden section method followed by a cubic polynomial approximation is empolyed for approximate line search since the approximate augmented Lagrangian is a nonlinear function of design variable vector. The numberical performance of the proposed approach is investigated by solving three typical dynamic response optimization problems and comparing the results with those in the literature. This comparison shows that the suggested approach is robust and efficient.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.32 no.4
• /
• pp.51-60
• /
• 2007

In this study, we consider the minimum ADM problem which is the fundamental problem for the cost-effective design of SONET ADM embedded in WDM ring networks. To minimize the number of SONET ADMs, efficient algorithms for the routing and wavelength assignment are needed. We propose a mathematical model based on the graph theory for the problem and propose a branch-and-price approach to solve the suggested model effectively within reasonable time. By exploiting the mathematical structure of ring networks, we developed polynomial time algorithms for column generation subroutine at branch-and-bound tree. In a computer simulation study, the suggested approach can find the optimal solution for sufficient size networks and shows better performance than the greedy heuristic method.