• The Journal of Information Systems
• /
• v.9 no.1
• /
• pp.235-255
• /
• 2000

Facing in very rapidly changing environments via information technologies, we need to study and develop new information technologies in postal delivery service in korea. We study to find the near optimal route for the better postal service between the collection centers. Optimal routing decision for the postal delivery is NP-Hard. The main purpose of this paper is to develop the near optimal simulation technique for the postal routing decision We consider the distance between collection centers, and the quantity of post articles in the collection center to obtain the near optimal route. We use the heuristic algorithm to obtain the near optimal solution for the transportation route of postal articles. Also, we try to show the transportation route by using the map after deciding the near optimal route.

• Proceedings of the Korea Association of Information Systems Conference
• /
• 2000.11a
• /
• pp.45-63
• /
• 2000

Facing in very repidly changing environments via information technologies, we need to study and develop new information technologies in postal delivery service in Korea. We study to find the near optimal route for the better postal service between the collection centers. Optimal routing decision for the postal delivery is NP-Hard. The main purpose of this paper is to develop the near optimal simulation technique for the postal routing decision. We consider the distance between collection centers, and the quantity of post articles in the collection center to obtain the near optimal route. We use the heuristic algorithm to obtain the near optimal solution for the transportation route of postal articles. Also, we try to show the transportation route by using the map after deciding the near optimal route.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.10
• /
• pp.2651-2659
• /
• 2009

In this paper, inverse optimal control for nonlinear systems with structural uncertainty is considered. The first, the bounded of structural uncertainty is introduced and based on the control Lyapunov function, a theorem for the globally asymptotic stability is presented. From this a less conservative condition for the inverse optimal control is derived. The result is used to design an inverse optimal controller for a class of nonlinear systems, that improves and extends the existing results. The class of nonlinear system considered is also enlarger. The simulation results show the effectiveness of the method.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.53 no.11
• /
• pp.610-618
• /
• 2004

With the development of industry and the improvement of living standards, better quality in power electric service is required more than ever before. Under these circumstances, to deliver reasonable voltage regulation methods in distribution systems need to be developed. So, This paper deals with optimal introduction of the line voltage regulator (SVR : Step Voltage Regulator) in power distribution systems. First, This paper investigates characteristics of SVR and performs economic evaluation of SVR's introduction by using Present Worth Method. This paper, also suggests proper location and optimal voltage regulation algorithm. In order to deliver suitable voltages to as many customers as possible, the optimal sending voltage of SVR should be decided by the effective operation of voltage regulators at the distribution feeders. The simulation results using a model distribution system and real distribution systems show that the proposed methods can be a practical tool for the voltage regulation in distribution systems.

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.9
• /
• pp.807-810
• /
• 2015

In this paper, a finite impulse response(FIR) fixed-lag smoother is proposed for discrete-time nonlinear systems. If the actual state trajectory is sufficiently close to the nominal state trajectory, the nonlinear system model can be divided into two parts: The error-state model and the nominal model. The error state can be estimated by adapting the optimal time-varying FIR smoother to the error-state model, and the nominal state can be obtained directly from the nominal trajectory model. Moreover, in order to obtain more robust estimates, the linearization errors are considered as a linear function of the estimation errors. Since the proposed estimator has an FIR structure, the proposed smoother can be expected to have better estimation performance than the IIR-structured estimators in terms of robustness and fast convergence. Additionally the proposed method can give a more general solution than the optimal FIR filtering approach, since the optimal FIR smoother is reduced to the optimal FIR filter by setting the fixed-lag size as zero. To illustrate the performance of the proposed method, simulation results are presented by comparing the method with an optimal FIR filtering approach and linearized Kalman filter.

• Journal of Institute of Control, Robotics and Systems
• /
• v.3 no.1
• /
• pp.101-108
• /
• 1997

The initial token value required to the optimal performance of discrete event systems can be decided by Sum of Delay Time and Synchronic Time ratio, which are new synchronic variables in Timed Place Petri Nets. For the system consisting of two Live-and-Bounded circuits(LB-circuits) fused in common Transition-Transition-Path or common Place-Place-Path, we prove that the Synchronic Time Ratio is the initial token ratio between two LB-circuits to optimally perform system functions. These results are generalized and formulated as a theorem. The initial tokens of a specific place can imply shared resources. Using the theorem, we can decide the minimum number of the shared resources to obtain the optimal performance, and minimize the idling time of resources. As an example, an automated assembly system is modeled by Timed Place Petri Net, and the initial tokens to achieve the optimal system performance are identified. All the values are verified by simulation.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.3
• /
• pp.364-377
• /
• 2008

Due to the difficulty in solving the Hamilton-Jacobi-Isaacs equation, the nonlinear optimal control approach is not very practical in general. To overcome this problem, Ezal et al. (2000) first solved a linear optimal control problem for the linearized model of a nonlinear system given in the strict-feedback form. Then, using the backstepping procedure, a nonlinear feedback controller was designed where the linear part is same as the linear feedback obtained from the linear optimal control design. However, their construction is based on the cancellation of the high order nonlinearity, which limits the application to the smooth ($C^{\infty}$) vector fields. In this paper, we develop an alternative method for backstepping procedure, so that the vector field can be just $C^1$, which allows this approach to be applicable to much larger class of nonlinear systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.1
• /
• pp.165-182
• /
• 2014

An RFID systems employ efficient Anti-Collision Algorithms (ACAs) to enhance the performance in various applications. The EPC-Global G2 RFID system utilizes Frame Slotted Aloha (FSA) as its ACA. One of the common approaches used to maximize the system performance (tag identification efficiency) of FSA-based RFID systems involves finding the optimal value of the frame length relative to the contending population size of the RFID tags. Several analytical models for finding the optimal frame length have been developed; however, they are not perfectly optimized because they lack precise characterization for the timing details of the underlying ACA. In this paper, we investigate this promising direction by precisely characterizing the timing details of the EPC-Global G2 protocol and use it to derive a precise-optimal frame length model. The main objective of the model is to determine the optimal frame length value for the estimated number of tags that maximizes the performance of an RFID system. However, because precise estimation of the contending tags is difficult, we utilize a parametric-heuristic approach to maximize the system performance and propose two simple schemes based on the obtained optimal frame length-namely, Improved Dynamic-Frame Slotted Aloha (ID-FSA) and Exponential Random Partitioning-Frame Slotted Aloha (ERP-FSA). The ID-FSA scheme is based on the tag set estimation and frame size update mechanisms, whereas the ERP-FSA scheme adjusts the contending tag population in such a way that the applied frame size becomes optimal. The results of simulations conducted indicate that the ID-FSA scheme performs better than several well-known schemes in various conditions, while the ERP-FSA scheme performs well when the frame size is small.

• Proceedings of the KSME Conference
• /
• 2001.06d
• /
• pp.732-737
• /
• 2001

The mathematical method was developed and numerical analyses were carried out with various parameters to provide substantial data for optimal design and operation of urban utility systems. The composition of systems and their specifications, such as co-generation system, heat pump system, incineration system and other heating and cooling system could be obtained through these analyses for various resource and energy requirements in urban area. As results the system constituents and operating characteristics, and their economic performances such as the value of objective function, initial and an operating costs were discussed for various load patterns. The effective system design method and the excepted effects of the several unused energy recovery systems were also briefly discussed with the variation of the buildings and facilities species and their capacities.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.6
• /
• pp.325-332
• /
• 2003

The loss minimization is one of the most important problems to save the operational cost in distribution systems. This paper presents an efficient method for optimal feeder reconfiguration of distribution systems. Chaos search algorithm (CSA) is used to reconfigure distribution systems so that active power losses are globally minimized with turning on/off sectionalizing switches. In optimization problem, the CSA searches the global optimal solution on the basis of regularity in chaotic motions and easily escapes from local or near optimal solution. The CSA is tested on 15 buses and 32 buses distribution systems, and the results indicate that it is able to determine appropriate switching options for global optimum reconfiguration.