• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.29 no.3 s.234
• /
• pp.369-386
• /
• 2005

Various aspects of structural optimization techniques under transient loads are extensively reviewed. The main themes of the paper are treatment of time dependent constraints, calculation of design sensitivity, and approximation. Each subject is reviewed with the corresponding papers that have been published since 1970s. The treatment of time dependent constraints in both the direct method and the transformation method is discussed. Two ways of calculating design sensitivity of a structure under transient loads are discussed - direct differentiation method and adjoint variable method. The approximation concept mainly focuses on re- sponse surface method in crashworthiness and local approximation with the intermediate variable Especially, as an approximated optimization technique, Equivalent Static Load method which takes advantage of the well-established static response optimization technique is introduced. And as an application area of dynamic response optimization technique, the structural optimization in flexible multibody dynamic systems is re- viewed in the viewpoint of the above three themes

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.327-331
• /
• 2006

This paper considers an integrated inventory-distribution system with a fleet of heterogeneous vehicles employed where a single warehouse distributes a single type of products to many spatially distributed retailers to satisfy their dynamic demands and the product is provided to the warehouse via procurement ordering from any manufacturing plant or market The Problem is formulated as an Mixed Integer Programming with the objective function of minimizing the sum of inventory holding cost (at the warehouse and retailers), and transportation cost and procurement ordering cost at the warehouse, subject to inventory-balancing constraints, ordering constraints, vehicle capacity constraints and transportation time constraints. The problem is Proven to be NP-hard. Accordingly, a Lagrangean heuristic procedure is derived and tested for its effectiveness through computational experiments with some numerical instances.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.164-166
• /
• 2006

Wien Automatic System Planning Package (WASP) which is used to draw out generation expansion planning applies Dynamic Programming in Korea power system panning. While this package has an advantage that computes annual capacity, it has a disadvantage that can't consider environmental constraints. With the effectuation of the Kyoto Protocol in February, 2005, it is expected that CO2 emission has a severe effect on Korean power system. Therefore, as the most important issue, the generation expansion planning considering environmental constraints is rising in power system. This paper develops a mathematic model including not only generation expansion planning but transmission planning and considering regional supply-demand and environmental constraints, especially CO2 emission, and verifies propriety through the case study.

• Journal of Korean Society of Transportation
• /
• v.19 no.3
• /
• pp.101-113
• /
• 2001

Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.536-539
• /
• 1997

This paper presents a three dimensional modeling and a trajectory generation for minimized impact walking of the biped robot. Inverse dynamic analysis and forward dynamic analysis are performed considering impact force between the foot and ground for determining the actuator capacity and for simulating the proposed biped walking robot. Double support phase walking is considered for close to human's with adding the kinematic constraints on the one of the single support phase.

• 전기의세계
• /
• v.23 no.3
• /
• pp.53-59
• /
• 1974

The purpose of this paper is to use hydraulic sources optimally on the hydro-thermal power coordination in power system of Korea by means of Multiple Dynamic Programming. Four principal hydraulic power plans of Korea; Whachon, Chunchon, Uiam and Chong-pyong which are located on Han river side are treated in this research. For the illustrative purpose, a case study was made on the year round monthy optimal water control under the given load distribution and constraints.

• Korean Journal of Geomatics
• /
• v.3 no.1
• /
• pp.23-32
• /
• 2003

Rigorous sensor and dynamic modeling techniques are required if spatial information is to be accurately extracted from video imagery. First, a mathematical model for an uncalibrated video camera and a description of a bundle adjustment with added parameters, for purposes of general block triangulation, is presented. This is followed by the application of invariance-based techniques, with constraints, to derive initial approximations for the camera parameters. Finally, dynamic modeling using the Kalman Filter is discussed. The results of various experiments with real video imagery, which apply the developed techniques, are given.

• The Journal of the Acoustical Society of Korea
• /
• v.3 no.1
• /
• pp.25-35
• /
• 1984

This paper analysis the Dynamic Time Warping algorithms for time normalization of speech pattern and discusses the Dynamic Programming algorithm for spoken Korean isolated digits recognition. In the DP matching, feature vectors of the reference and test pattern are consisted of first three formant frequencies extracted by power spectrum density estimation algorithm of the ARMA model. The major differences in the various DTW algorithms include the global path constrains, the local continuity constraints on the path, and the distance weighting/normalization used to give the overall minimum distance. The performance criterias to evaluate these DP algorithms are memory requirement, speed of implementation, and recognition accuracy.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.18 no.8
• /
• pp.1974-1984
• /
• 1994

This paper presents a relative coordinate formulation for constrained mechanical systems. Relative coordinates are defined along degrees of freedom of a joint. Graph theoretic analyses are performed to identify topological paths in mechanical systems. Cut constraints are generated to handle closed loop systems. Equations of motion are derived in the Cartesian space and transformed to the joint space. Relative generalized coordinates are corrected to satisfy the cut constraints by a parametrizatiom method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1995.04a
• /
• pp.758-759
• /
• 1995

In large-scale industry such as shipbuilding, aircraft manufacturing, and construction industry etc., it is required to consider two or three-dimensional spatial availability as one of bottlenecked resource constraints. We call this kind of scheduling a spatial scheduling, which considers the dynamic spatial layouts of objects as well as the traditional resource constraints. Since 1991, we have researched on the spatial scheduling for shipbuilding plant (Lee & Lee, 1992; Lee et al., 1994, Lee et al., 1995). In this paper, we present the various issues of spatial scheduling for the researchers and developers attacking spatial scheduling problems.