• 제목/요약/키워드: topology patterns

검색결과 72건 처리시간 0.022초

Optimizing structural topology patterns using regularization of Heaviside function

  • Lee, Dongkyu;Shin, Soomi
    • Structural Engineering and Mechanics
    • /
    • 제55권6호
    • /
    • pp.1157-1176
    • /
    • 2015
  • This study presents optimizing structural topology patterns using regularization of Heaviside function. The present method needs not filtering process to typical SIMP method. Using the penalty formulation of the SIMP approach, a topology optimization problem is formulated in co-operation, i.e., couple-signals, with design variable values of discrete elements and a regularized Heaviside step function. The regularization of discontinuous material distributions is a key scheme in order to improve the numerical problems of material topology optimization with 0 (void)-1 (solid) solutions. The weak forms of an equilibrium equation are expressed using a coupled regularized Heaviside function to evaluate sensitivity analysis. Numerical results show that the incorporation of the regularized Heaviside function and the SIMP leads to convergent solutions. This method is tested using several examples of a linear elastostatic structure. It demonstrates that improved optimal solutions can be obtained without the additional use of sensitivity filtering to improve the discontinuous 0-1 solutions, which have generally been used in material topology optimization problems.

Topology Optimization of Continuum Structures Using a Nodal Volume Fraction Method

  • Lee, Jin-Sik;Lim, O-Kaung
    • Computational Structural Engineering : An International Journal
    • /
    • 제1권1호
    • /
    • pp.21-29
    • /
    • 2001
  • The general topology optimization can be considered as optimal material distribution. Such an approach can be unstable, unless composite materials are introduced. In this research, a nodal volume fraction method is used to obtain the optimum topology of continuum structures. This method is conducted from a composite material model composed of isotropic matter and spherical void. Because the appearance of the chessboard patterns makes the interpretation of the optimal material layout very difficult, this method contains a chessboard prevention strategy. In this research, several topology optimization problems are presented to demonstrate the validity of the present method and the recursive quadratic programming algorithm is used to solve the topology optimization problems.

  • PDF

구조-하중 설계를 고려한 공진화 구조 설계시스템 (Co-evolutionary Structural Design Framework: Min(Volume Minimization)-Max(Critical Load) MDO Problem of Topology Design under Uncertainty)

  • 양영순;유원선;김봉재
    • 한국전산구조공학회논문집
    • /
    • 제16권3호
    • /
    • pp.281-290
    • /
    • 2003
  • Co Evolutionary Structural Design(CESD) Framework is presented, which can deal with the load design and structural topology design simultaneously. The load design here is the exploration algorithm that finds the critical load patterns of the given structure. In general, the load pattern is a crucial factor in determining the structural topology and being selected from the experts어 intuition and experience. However, if any of the critical load patterns would be excluded during the process of problem formation, the solution structure might show inadequate performance under the load pattern. Otherwise if some reinforcement method such as safety factor method would be utilized, the solution structure could result in inefficient conservativeness. On the other hand, the CESD has the ability of automatically finding the most critical load patterns and can help the structural solution evolve into the robust design. The CESD is made up of a load design discipline and a structural topology design discipline both of which have the fully coupled relation each other. This coupling is resolved iteratively until the resultant solution can resist against all the possible load patterns and both disciplines evolve into the solution structure with the mutual help or competition. To verify the usefulness of this approach, the 10 bar truss and the jacket type offshore structure are presented. SORA(Sequential Optimization & Reliability Assessment) is adopted in CESD as a probabilistic optimization methodology, and its usefulness in decreasing the computational cost is verified also.

TOPOLOGY FIELDS, TOPOLOGICAL FLOWS AND TOPOLOGICAL ORGANISMS

  • Kim, Jae-Ryong
    • 충청수학회지
    • /
    • 제26권1호
    • /
    • pp.53-69
    • /
    • 2013
  • Topology may described a pattern of existence of elements of a given set X. The family ${\tau}(X)$ of all topologies given on a set X form a complete lattice. We will give some topologies on this lattice ${\tau}(X)$ using a topology on X and regard ${\tau}(X)$ a topological space. A topology ${\tau}$ on X can be regarded a map from X to ${\tau}(X)$ naturally. Such a map will be called topology field. Similarly we can also define pe-topology field. If X is a topological flow group with acting group T, then naturally we can get a another topological flow ${\tau}(X)$ with same acting group T. If the topological flow X is minimal, we can prove ${\tau}(X)$ is also minimal. The disjoint unions of the topological spaces can describe some topological systems (topological organisms). Here we will give a definition of topological organism. Our purpose of this study is to describe some properties concerning patterns of relationship between topology fields and topological organisms.

구조물의 토폴로지 최적화에 관한 연구 (A study on the topology optimization of structures)

  • 박상훈;윤성기
    • 대한기계학회논문집A
    • /
    • 제21권8호
    • /
    • pp.1241-1249
    • /
    • 1997
  • The problem of structural topology optimization can be relaxed and converted into the optimal density distribution problem. The optimal density distribution must be post-processed to get the real shape of the structure. The extracted shape can then be used for the next process, which is usually shape optmization based on the boundary movement method. In the practical point of view, it is very important to get the optimal density distribution from which the corresponding shape can easily be extracted. Among many other factors, the presence of checker-board patterns is a powerful barrier for the shape extraction job. The nature of checker-board patterns seems to be a numerical locking. In this paper, an efficient algorithm is presented to suppress the checker-board patterns. At each iteration, density is re-distributed after it is updated according to the optimization rule. The algorithm also results in the optimal density distribution whose corresponding shape has smooth boundary. Some examples are presented to show the performance of the density re-distribution algorithm. Checker-board patterns are successfully suppressed and the resulting shapes are considered very satisfactory.

Efficient Logical Topology Design Considering Multiperiod Traffic in IP-over-WDM Networks

  • Li, Bingbing;Kim, Young-Chon
    • Journal of the Optical Society of Korea
    • /
    • 제19권1호
    • /
    • pp.13-21
    • /
    • 2015
  • In recent years energy consumption has become a main concern for network development, due to the exponential increase of network traffic. Potential energy savings can be obtained from a load-adaptive scheme, in which a day can be divided into multiple time periods according to the variation of daily traffic patterns. The energy consumption of the network can be reduced by selectively turning off network components during the time periods with light traffic. However, the time segmentation of daily traffic patterns affects the energy savings when designing multiperiod logical topology in optical wavelength routed networks. In addition, turning network components on or off may increase the overhead of logical topology reconfiguration (LTR). In this paper, we propose two mixed integer linear programming (MILP) models to design the optimal logical topology for multiple periods in IP-over-WDM networks. First, we formulate the time-segmentation problem as an MILP model to optimally determine the boundaries for each period, with the objective to minimize total network energy consumption. Second, another MILP formulation is proposed to minimize both the overall power consumption (PC) and the reconfiguration overhead (RO). The proposed models are evaluated and compared to conventional schemes, in view of PC and RO, through case studies.

A Shared Buffer-Constrained Topology Reconfiguration Scheme in Wavelength Routed Networks

  • Youn, Chan-Hyun;Song, Hye-Won;Keum, Ji-Eun
    • ETRI Journal
    • /
    • 제27권6호
    • /
    • pp.725-732
    • /
    • 2005
  • The reconfiguration management scheme changes a logical topology in response to changing traffic patterns in the higher layer of a network or the congestion level on the logical topology. In this paper, we formulate a reconfiguration scheme with a shared buffer-constrained cost model based on required quality-of-service (QoS) constraints, reconfiguration penalty cost, and buffer gain cost through traffic aggregation. The proposed scheme maximizes the derived expected reward-cost function as well as guarantees the required flow's QoS. Simulation results show that our reconfiguration scheme significantly outperforms the conventional one, while the required physical resources are limited.

  • PDF

A High-Efficiency Bidirectional AC/DC Topology for V2G Applications

  • Su, Mei;Li, Hua;Sun, Yao;Xiong, Wenjing
    • Journal of Power Electronics
    • /
    • 제14권5호
    • /
    • pp.899-907
    • /
    • 2014
  • This paper proposes a single-phase bidirectional AC/DC converter topology applied in V2G systems, which consists of an inverter and a bidirectional non-inverting buck-boost converter. This topology can operate in four modes: buck charging, boost charging, buck discharging and boost discharging with high input current quality and unity input power factor. The inverter switches at line frequency, which is different from conventional voltage source inverters. A bidirectional buck-boost converter is utilized to adapt to a wider charging voltage range. The modulation and control strategy is introduced in detail, and the switching patterns are optimized to reduce the current ripple. In addition, the semiconductor losses are analyzed. Simulation and experimental results demonstrate the validity and effectiveness of the proposed topology.

Topological material distribution evaluation for steel plate reinforcement by using CCARAT optimizer

  • Lee, Dongkyu;Shin, Soomi;Park, Hyunjung;Park, Sungsoo
    • Structural Engineering and Mechanics
    • /
    • 제51권5호
    • /
    • pp.793-808
    • /
    • 2014
  • The goal of this study is to evaluate and design steel plates with optimal material distributions achieved through a specific material topology optimization by using a CCARAT (Computer Aided Research Analysis Tool) as an optimizer, topologically optimally updating node densities as design variables. In typical material topology optimization, optimal topology and layouts are described by distributing element densities (from almost 0 to 1), which are arithmetic means of node densities. The average element densities are employed as material properties of each element in finite element analysis. CCARAT may deal with material topology optimization to address the mean compliance problem of structural mechanical problems. This consists of three computational steps: finite element analysis, sensitivity analysis, and optimality criteria optimizer updating node densities. The present node density based design via CCARAT using node densities as design variables removes jagged optimal layouts and checkerboard patterns, which are disadvantages of classical material topology optimization using element densities as design variables. Numerical applications that topologically optimize reinforcement material distribution of steel plates of a cantilever type are studied to verify the numerical superiority of the present node density based design via CCARAT.

The Design of Self-Organizing Map Using Pseudo Gaussian Function Network

  • Kim, Byung-Man;Cho, Hyung-Suck
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2002년도 ICCAS
    • /
    • pp.42.6-42
    • /
    • 2002
  • Kohonen's self organizing feature map (SOFM) converts arbitrary dimensional patterns into one or two dimensional arrays of nodes. Among the many competitive learning algorithms, SOFM proposed by Kohonen is considered to be powerful in the sense that it not only clusters the input pattern adaptively but also organize the output node topologically. SOFM is usually used for a preprocessor or cluster. It can perform dimensional reduction of input patterns and obtain a topology-preserving map that preserves neighborhood relations of the input patterns. The traditional SOFM algorithm[1] is a competitive learning neural network that maps inputs to discrete points that are called nodes on a lattice...

  • PDF