• Advances in Computational Design
• /
• v.2 no.1
• /
• pp.71-87
• /
• 2017

This study focuses on the efficiency and applicability of dynamic relaxation methods in form-finding of membrane structures. Membrane structures have large deformations that require complex nonlinear analysis. The first step of analysis of these structures is the form-finding process including a geometrically nonlinear analysis. Several numerical methods for form-finding have been introduced such as the dynamic relaxation, force density method, particle spring systems and the updated reference strategy. In the present study, dynamic relaxation method (DRM) is investigated. The dynamic relaxation method is an iterative process that is used for the static equilibrium analysis of geometrically nonlinear problems. Five different examples are used in this paper. To achieve the grading of the different dynamic relaxation methods in form-finding of membrane structures, a performance index is introduced. The results indicate that viscous damping methods show better performance than kinetic damping in finding the shapes of membrane structures.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2000.04b
• /
• pp.61-68
• /
• 2000

In general, the design of membrane structures takes three steps. The first is shape finding analysis which is determination of initial equilibrium geometry with uniform stresses. The second step involve the computation of the stress-deformation to get completed membrane under various load conditions. The third step is to divide the membrane structures into several plan strips from the initial equilibrium states. This procedure is needed because of the initial shape has usually undevelopable curved surface and is called as "cutting patterns generation". By introducing this work, the deformation due to the initial stress is removed and approximate cutting patterns are generated. In this approach, however, material properties is not considered, therefore the error between the design stresses and actual stresses during the fabrication of plan strips should be occurred. In this paper, actual equilibrium shape analysis procedure for HP shape models is presented. The deviations of stresses between the design stresses and actual stresses are estimated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.38 no.4
• /
• pp.1-9
• /
• 2013

We propose a heuristic algorithm for war-game model that is appropriate for warfare in which the maneuver of the attacker is relatively certain. Our model is based on a multi-weapon extention of the Lanchester's square law. However, instead of dealing with the differential equations, we use a multi-period linear approximation which not only facilitates a solution method but also reflects discrete natures of warfare. Then our game model turns out to be a continuous game known to have an ${\varepsilon}$-Nash equilibrium for all ${\varepsilon}{\geq}0$. Therefore, our model approximates an optimal warfare strategies for both players as well as an efficient reinforcement of area defense system that guarantees a peaceful equilibrium. Finally, we report the performance of a practical best-response type heuristic for finding an ${\varepsilon}$-Nash equilibrium for a real-scale problem.

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

In models of imperfect competition of deregulated electricity markets, the key task is to find the Nash equilibrium(NE). The approaches for finding the NE have had two major bottlenecks: computation of mixed strategy equilibrium and treatment of multi-player games. This paper proposes a payoff matrix approach that resolves these bottlenecks. The proposed method can efficiently find a mixed strategy equilibrium in a multi-player game. The formulation of the m condition for a three-player game is introduced and a basic computation scheme of solving nonlinear equalities and checking inequalities is proposed. In order to relieve the inevitable burden of searching the subspace of payoffs, several techniques are adopted in this paper. Two example application problems arising from electricity markets and involving a Cournot and a Bertrand model, respectively, are investigated for verifying the proposed method.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.33B no.10
• /
• pp.80-89
• /
• 1996

This paper proposes a new COA (center of area) defuzzifier that is working in the accurate and fast manner. The proposed COA defuzzifier involves both membership values and the spans of membership functions in clauclating a crisp value. In additon, it avoid division by replacing the COA calculation with the searching of the momentum equilibrium point. The moment equilibrium point is searched in the coarse-to-fine manner such that the moment computing points during the coarse searching are moved in the interval of fuzzy terms until they are reached at two adjacent fuzzy terms searching method accerlates the finding of the moment equilibrium point by O(M) mazimally when compared iwth the equal interval searching method of ruitz. In order to verify the accuracy of the proposed COA defuzzifier, the crisp values obtained form the proposed coarse-to-fine searching are compared with the precise crisp values from the arithmetic calculation. Application to the truck backer-upper control problem of the proposed COA defuzzifier is presented. The control performance is compared with that of the conventional COA defuzzifier in tems of the average tracing distance.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.52 no.1
• /
• pp.62-67
• /
• 2003

An important aspect of the study of power system markets involves the assessment of strategic behavior of participants for maximizing their profits. In models of imperfect competition of a deregulated electricity system, the key task is to find the Nash equilibrium. In this paper, the bimatrix approach for finding Nash equilibria in electricity markets is investigated. This approach determines pure and mixed equilibria using the complementarity pivot algorithim. The mixed equilibrium in the matrix approach has the equal number of non-zero property. This property makes it difficult to reproduce a smooth continuous distribution for the mixed equilibrium. This paper proposes an algorithm for adjusting the quantization value of discretization to reconstruct a continuous distribution from a discrete one.

• East Asian mathematical journal
• /
• v.28 no.3
• /
• pp.305-320
• /
• 2012

The purpose of this paper is to introduce a hybrid projection method for finding a common element of the set of solutions of a generalized equilibrium problem, the set of solutions of a variational inclusion problem and the set of common fixed points of a finite family of strict pseudo-contractions in Hilbert spaces.

• Journal of Korean Association for Spatial Structures
• /
• v.2 no.1 s.3
• /
• pp.75-84
• /
• 2002

In this study, the 'force density method' for shape finding of cable net structures is presented. This concept is based on the force-length ratios or force densities which are defined for each branch of the net structures. This method renders a simple linear 'analytical form finding' possible. If the free choice of the force densities is restricted by further condition, the linear method is extended to a nonlinear one. The nonlinear one can be applied to the detailed computation of networks. In this paper, the general inverse matrix is introduced to solve the nonlinear equilibrium equation including Jacobian matrix which is rectangular matrix. Several examples for linear and nonlinear analysis applied additional constraints are presented. It is shown that the force density method is suitable for form finding of cable net and the general inverse matrix can be applied to solve the nonlinear equation without Lagrangian factors.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.04a
• /
• pp.175-182
• /
• 1998

The object of this study is shape finding and cutting pattern generation of membrane structures under the following assumptions : (1) material is linearly elastic (2) stress state is plane stress. Cable and membrane structures should introduce the nonlinear analysis considering geometric nonlinearity because these structures deform largely under the external loads. The analysis procedure is consisted of three steps considering geometric nonlinearity unlike any other structures. First step is the shape finding analysis to determine the initial equilibrium shape. Second step is the stress-deformation analysis to investigate the behaviors of structures under various external loads. Once a satisfactory shape has been found, a cutting pattern based on the shape finding analysis may be generated from the view point of construction. In this paper, (1) shape finding analysis formulation and an example, (2) cutting pattern determination procedure using weighted least-square minimization flattening method and some results are presented.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1998.10a
• /
• pp.266-273
• /
• 1998

The object of this study is shape finding and cutting pattern generation of membrane structures under the following assumptions: (1) material is linearly elastic (2) stress state is plane stress. Cable and membrane structures should introduce the nonlinear analysis considering geometric nonlinearity because these structures deform largely under the external loads. The analysis procedure is consisted of three steps considering geometric nonlinearity unlike any other structures. First step is the shape finding analysis to determine the initial equilibrium shape. Second step is the stress-deformation analysis to investigate the behaviors of structures under various external loads. Once a satisfactory shape has been found, a cutting pattern based on the shape finding analysis may be generated from the view point of construction. In this paper, after shape finding analysis, cutting pattern determination procedure using weighted least-square minimization flattening method and some results are presented.