• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1780-1783
• /
• 2005

In this paper ZMP was considered in order to get a walking stability, so the gait in the stable domain was realized through putting the stability margin in the sole domain of a foot. It is assumed that the robot's legs have 12 joints to operate a open-loop drive and there was no external disturbance under walking phases, additionally, the robot is walking on the flat plane. It was observed that the robot's walking trajectory, locus of COM and ZMP after imposing the motion to each joint. For realizing the simulation considering ZMP and movement of mass center, it was checked if it is stable for the constraint robot model to walk in stability and the feasibility was estimated about its dynamic gait. Eventually it was shown that a constraint gait algorithm is able to realize. To verify the proper walking process, ZMP(Zero Moment Point) theory is applied and the simulation has been done by ADAMS.

• Journal of Ocean Engineering and Technology
• /
• v.26 no.6
• /
• pp.80-85
• /
• 2012

The methods of robust design optimization (RDO) and reliability-based robust design optimization (RBRDO) were implemented in the present study. RBRDO is an integrated method that accounts for the design robustness of an objective function and for the reliability of constraints. The objective function in RBRDO is expressed in terms of the mean and standard deviation of an original objective function. Thus, a multi-objective formulation is employed. The regressive approximate models are generated via the moving least squares method (MLSM) and constraint-feasible moving least squares method (CF-MLSM), which make it possible to realize the feasibility regardless of the multimodality/nonlinearity of the constraint function during the approximate optimization processes. The regression model based RBRDO is newly devised and its numerical characteristics are explored using the design of an actively controlled ten bar truss structure.

• ETRI Journal
• /
• v.27 no.4
• /
• pp.341-354
• /
• 2005

The adaptation of video according to the heterogeneous and dynamic resource constraints on networks and devices, as well as on user preferences, is a promising approach for universal access and consumption of video content. For optimal adaptation that satisfies the constraints while maximizing the utility that results from the adapted video, it is necessary to devise a systematic way of selecting an appropriate adaptation operation among multiple feasible choices. This paper presents a general conceptual framework that allows the formulation of various adaptations as constrained optimization problems by modeling the relations among feasible adaptation operations, constraints, and utilities. In particular, we present the feasibility of the framework by applying it to a use case of rate adaptation of MPEG-4 video with an explicit modeling of adaptation employing a combination of frame dropping and discrete cosine transform coefficient dropping, constraint, utility, and their mapping relations. Furthermore, we provide a description tool that describes the adaptation-constraint-utility relations as a functional form referred to as a utility function, which has been accepted as a part of the terminal and network quality of service tool in MPEG-21 Digital Item Adaptation (DIA).

• Structural Engineering and Mechanics
• /
• v.85 no.5
• /
• pp.607-620
• /
• 2023

The classical optimal control (COC) method has been widely used for linear quadratic regulator (LQR) problems of structural control. However, the equation of motion of the structure is incorporated into the optimization model as the constraint condition for the LQR problem, which needs to be solved through the Riccati equation under certain assumptions. In this study, an explicit optimal control (EOC) method is proposed based on the explicit time-domain method (ETDM). By use of the explicit formulation of structural responses, the LQR problem with the constraint of equation of motion can be transformed into an unconstrained optimization problem, and therefore the control law can be derived directly without solving the Riccati equation. To further optimize the weighting parameters adopted in the control law using the gradient-based optimization algorithm, the sensitivities of structural responses and control forces with respect to the weighting parameters are derived analytically based on the explicit expressions of dynamic responses of the controlled structure. Two numerical examples are investigated to demonstrate the feasibility of the EOC method and the optimization scheme for weighting parameters involved in the control law.

• Journal of Korean Society of Water and Wastewater
• /
• v.21 no.5
• /
• pp.609-619
• /
• 2007

The objective of this paper is to evaluate the feasibility of conjunctive Operation between Multi-regional water supply networks from multiple source as a effective way to meet two conditions: to minimize the electric cost for providing water demanded and meet the water flow rate for satisfying customers. EPAnet Model is used to calculate a hydraulic water distribution condition based on an integrated operation of water supply systems located in short distance. The modeling was conducted on several simulation cases including the individual operation by existing inter-regional water supply networks within short distance, the conjunctive operation of more than two existing networks with valve fully closed and full open constraint. As a study distribution system, water supplying systems of the Geojae-city in the Geongsang Namdo Province was selected and investigated. It was found that a well-allocated water supply scheme based on a conjunctive operation promises to save the electric cost and satisfy all operational goals such as stability and revenues during the period. The result such as unit district costs, pareto optimum pump combination sets will be applied to the optimization for a conjunctive operation of existing inter-regional water supply networks within short distance.

• Transactions of the Korean Society for Noise and Vibration Engineering
• /
• v.16 no.2 s.107
• /
• pp.115-123
• /
• 2006

A feasibility of using the topology optimization method for structural damage identification is investigated for the first time. The frequency response functions (FRFs) are assumed to be constructed by the finite element models of damaged and undamaged structures. In addition to commonly used resonances, antiresonances are employed as the damage identifying modal parameters. For the topology optimization formulation, the modal parameters of the undamaged structure are made to approach those of the damaged structure by means of the constraint equations, while the objective function is an explicit penalty function requiring clear black-and-white images. The developed formulation is especially suitable for damage identification problems dealing with many modal parameters. Although relatively simple numerical problems were considered in this investigation, the possibility of using the topology optimization method for structural damage identification is suggested through this research.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.6
• /
• pp.2859-2872
• /
• 2019

Interference alignment (IA) has been a powerful approach to achieve the maximum degree of freedom (DoF) for K users multiple-input-multiple-output (MIMO) interference channels. However, due to the feasibility constraint, aligning all the interference signals at each receiver is impractical for large K without symbol extension. In this paper, we propose two best-effort interference alignment (BEIA) schemes that the network selects the maximum number of interfering transmitters to align their signals given the feasibility conditions when each transmitter-receiver pair has a constant number of data streams. Besides, in case of not all interfering signals aligned at each receiver, an upper bound of the average throughput is derived. Simulation results show that the proposed schemes have superiority over the traditional methods, such as time division multiple access (TDMA) and cluster IA(CIA), in low and moderate signal-to-noise ratio (SNR) region in terms of average user throughput. In addition, the proposed max-min relative interference distance alignment scheme outperforms the proposed scheme of equal interfering transmitters number alignment in terms of both average user throughput and minimum user throughput.

• Proceedings of the Korea Water Resources Association Conference
• /
• 2020.06a
• /
• pp.171-171
• /
• 2020

Decision making strategies should consider both adaptiveness and robustness in order to deal with two main characteristics of climate change: non-stationarity and deep uncertainty. Especially, robust strategies are different from traditional optimal strategies in the sense that they are satisfactory over a wider range of uncertainty and may act as a key when confronting climate change. In this study, a new framework named Robust Stochastic Dynamic Programming (R-SDP) is proposed, which couples previously developed robust optimization (RO) into the objective function and constraint of SDP. Two main approaches of RO, feasibility robustness and solution robustness, are considered in the optimization algorithm and consequently, three models to be tested are developed: conventional-SDP (CSDP), R-SDP-Feasibility (RSDP-F), and R-SDP-Solution (RSDP-S). The developed models were used to derive optimal monthly release rules in a single reservoir, and multiple simulations of the derived monthly policy under inflow scenarios with varying mean and standard deviations are undergone. Simulation results were then evaluated with a wide range of evaluation metrics from reliability, resiliency, vulnerability to additional robustness measures. Evaluation results were finally visualized with advanced visualization tools that are used in multi-objective robust decision making (MORDM) framework. As a result, RSDP-F and RSDP-S models yielded more risk averse, or conservative, results than the CSDP model, and a trade-off relationship between traditional and robustness metrics was discovered.

• International Journal of Automotive Technology
• /
• v.6 no.1
• /
• pp.71-77
• /
• 2005

This paper presents a systematic approach which determines the optimal period to minimize performance measure subject to the schedulability constraints of a real-time control system by formulating the scheduling problem as an optimal problem. The performance measure is derived from the summation of end-to-end response times of processed I/Os scheduled by the static cyclic method. The schedulability constraint is specified in terms of allowable resource utilization. At first, a uniprocessor case is considered and then it is extended to a distributed system connected through a communication link, local-inter network, UN. This approach is applied to the design of an automotive body control system in order to validate the feasibility through a real example. By using the approach, a set of optimal periods can easily be obtained without complex and advanced methods such as branch and bound (B&B) or simulated annealing.

• Journal of Institute of Control, Robotics and Systems
• /
• v.10 no.5
• /
• pp.415-420
• /
• 2004

We present a new algorithm for the calibration of a camera and the recovery of 3D scene structure up to a scale from image sequences using known angles between lines in the scene. Traditional method for calibration using scene constraints requires various scene constraints due to the stratified approach. Proposed method requires only one type of scene constraint of known angle and also it directly recovers metric structure up to an unknown scale from projective structure. Specifically, we recover the matrix that is the homography between the projective structure and the Euclidean structure using angles. Since this matrix is a unique one in the given set of image sequences, we can easily deal with the problem of varying intrinsic parameters of the camera. Experimental results on the synthetic and real images demonstrate the feasibility of the proposed algorithm.