• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.3060-3062
• /
• 2000

A fast optimal path planning algorithm using the analog Cellular Nonlinear Circuits (CNC) is proposed. The proposed algorithm compute the optimal path using subgoal-based dynamic programming algorithm. In the algorithm, the optimal paths are computed regardless of the distance between the initial and the goal position. It begins to find subgoals starting from the initial position when the output of the initial cell becomes nonzero value. The suboal is set as the initial position to find the next subgoal until the final goal is reached. Simulations have been done considering the imprecise hardware fabrication and the limitation of the magnitude of input value.

• Proceedings of the KIEE Conference
• /
• 1998.07c
• /
• pp.1140-1142
• /
• 1998

This paper presents object-oriented dynamic programing formulation of the unit commitment problem. This approach features the classification of generating units into related groups so called class. All object which share the same set of attributes and methods are grouped together in classes and designed inheritance hierarchy to minimize the number of unit combination which must be tested without precluding the optimal path. So this programming techniques will maximize the efficiency of unit commitment.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.33 no.1
• /
• pp.71-79
• /
• 2010

This paper addresses capacity expansion planning model of distribution center under usability of public distribution center. For discrete and finite time periods, demands for distribution center increase dynamically. The capacity expansion planning is to determine the capacity expansion size of private distribution center and usage size of public distribution center for each period through the time periods. The capacity expansion of private distribution center or lease usage of public distribution center must be done to satisfy demand increase for distribution center. The costs are capacity expansion cost and excess capacity holding cost of private distribution center, lease usage cost of public distribution center. Capacity expansion planning of minimizing the total costs is mathematically modelled. The properties of optimal solution are characterized and a dynamic programming algorithm is developed. A numerical example is shown to explain the problem.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.30A no.3
• /
• pp.67-75
• /
• 1993

In many practical applications of systolic array, it is common that the problem size(n) is larger than the array size(M). In this case, the problem has to be partitioned into block to fit into the array before it is processed. This paper presents a problem partition method for dynamic programming and 2-dimensional systolic array suitable for it. Designed array has two types of array configur-ation for processing the partitioned problem. The queue is designed for storing and recirculating the intermediate results in the correct location and time. The number of processing elements and queues required are M(3M+1)/2, 4M respectively. The total processing time is 2(M+1)+(n+10M+3)(n/M-1)(n/M-1)/6.

• Journal of Korean Association for Spatial Structures
• /
• v.3 no.1 s.7
• /
• pp.35-46
• /
• 2003

Conventional analysis and design of steel structures are performed using the assumption of a either fully rigid or pinned. However, every steel connection lies in between fully rigid and pinned connection. So, It is important to consider the connection for steel structure design. In this paper Computer-based second-order elastic analysis is used to calculate one story two bay and two story three bay for steel structures with semi-rigid connection. Genetic Algorithms(GAs) and Sequential Unconstrained Minized Technique(SUMT) dynamic programming is used to the method for optimum design of steel structures. The efficiency and validity of the developed continuous and discrete optimum design algorithm was verified by applying the algorithm to optimum design examples.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.10 no.16
• /
• pp.75-80
• /
• 1987

This paper is deals with the preventive replacement for the equipment which fails only when the total amount of damage reaches a prespecified failure level. Most of replacement model use time as their decision variable, but it is not appropriate for the cases in which failures dependent on their cumulative damage levels. In this paper, a new type preventive replacement model is introduced in which an equipment is replaced before failure when the cumulative damage reaches a certain level or replaced on failure, whichever occures first. The optimal replacement damage levels which minimize total expected cost are obtained by the Dynamic programming Method when the number of use of the equipment is finite. A numerical example is also presented. The optimal preventive replacement policy when the equipment will be used for a finite time span is also discussed.

• Journal of Korea Water Resources Association
• /
• v.35 no.4 s.129
• /
• pp.367-374
• /
• 2002

Water supply plan by optimal conjunctive use of surface and ground water is studied to prepare expected water deficit in near future. The optimization model for conjunctive use of surface and ground water is developed using discrete differential dynamic programming technique to maximize net benefit by water supply. As a result of applying the model to Namdaechun river located in Yangyang, it is found that water supply reliability using optimal conjunctive use of surface and ground water is much higher than reliability using surface water alone.

• Water for future
• /
• v.19 no.4
• /
• pp.339-346
• /
• 1986

A real-time single reservoir operation model using the Min-max Dynamic Programming for the flood control of Soyanggang Dam and Choongju Dam is developed. The objective function is to minimize the maximum release from each dam and the constraints are those from ther reservoir and channel characteristics. Control and utilization efficiencies are used to measure the performance of the reservoir operation method (ROM). In comparison with those of simulation models(such as the Rigid ROM, the Technical ROM and the Linear Decision Rule), the efficiencies of the optimization model are superior for all return periods.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.5
• /
• pp.353-360
• /
• 2004

This paper considers reinforcement learning control with the self-organizing map. Reinforcement learning uses the observable states of objective system and signals from interaction of the system and environment as input data. For fast learning in neural network training, it is necessary to reduce learning data. In this paper, we use the self-organizing map to partition the observable states. Partitioning states reduces the number of learning data which is used for training neural networks. And neural dynamic programming design method is used for the controller. For evaluating the designed reinforcement learning controller, an inverted pendulum on the cart system is simulated. The designed controller is composed of serial connection of self-organizing map and two Multi-layer Feed-Forward Neural Networks.

• Journal of Korean Institute of Industrial Engineers
• /
• v.29 no.4
• /
• pp.304-311
• /
• 2003

This paper considers a new variation of scheduling problems where jobs are dispatched in batches. The variation is the case where the batch sequence is fixed. The objective is to minimize the sum of the completion times of the batches. This simple environment has a variety of real world applications such as part kitting and customer order scheduling. We show that this problem is binary NP-complete when there exist two machines. For the same problem, we develop an optimal dynamic programming (DP) algorithm which runs in pseudo-polynomial time. We finally prove the optimality of the DP algorithm.