• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.768-771
• /
• 1997

Geometric probing addresses the problem of determining geometric aspects of a structure from the mathematics and results of a physical measuring device such as a probe. This paper presents a new algorithm to recognize the shape of an unknown object by using a robot hand with a force and torque sensor. The new algorithm is called S.E.P.(Shape Exploration Procedure) which finds the global shape of an unknown object. The proposed method is composed of three major parts, finding contact informations such as contact point, calculation of shape information such as curvature, and expression of global shape from these informations. Comparing with the conventional approaches, the advantages of the proposed method are explained and verified by conducting experiments with a 3-dof SCARA robot.

• Steel and Composite Structures
• /
• 제30권1호
• /
• pp.47-55
• /
• 2019

The aim of this paper is to present new and an efficient optimization algorithm called Jaya for the optimum mass of braced dome structures with natural frequency constraints. Design variables of the bar cross-section area and coordinates of the structure nodes were used for size and shape optimization, respectively. The effectiveness of Jaya algorithm is demonstrated through three benchmark braced domes (52-bar, 120-bar, and 600-bar). The algorithm applied is an effective tool for finding the optimum design of structures with frequency constraints. The Jaya algorithm has been programmed in MATLAB to optimize braced dome.

• 한국해양공학회지
• /
• 제27권5호
• /
• pp.36-42
• /
• 2013

We present the optimum design for the cross-sectional(sizing) and shape optimization of truss structures with natural frequency constraints. The optimum design method used in this paper employs continuous design variables and the Harmony Search Algorithm(HSA). HSA is a meta-heuristic search method for global optimization problems. In this paper, HSA uses the method of random number selection in an update process, along with penalty parameters, to construct the initial harmony memory in order to improve the fitness in the initial and update processes. In examples, 10-bar and 72-bar trusses are optimized for sizing, and 37-bar bridge type truss and 52-bar(like dome) for sizing and shape. Four typical truss optimization examples are employed to demonstrate the availability of HSA for finding the minimum weight optimum truss with multiple natural frequency constraints.

• 전자공학회논문지B
• /
• 제33B권10호
• /
• pp.63-71
• /
• 1996

This paper proposes a method which analyzes facial shape and extracts positions of eyes regardless of the tilt and the size of input iamge. With the extracted feature parameters of facial element by the method, full human faces are recognized by a neural network which BP algorithm is applied on. Input image is changed into binary codes, and then labelled. Area, circumference, and circular degree of the labelled binary image are obtained by using chain code and defined as feature parameters of face image. We first extract two eyes from the similarity and distance of feature parameter of each facial element, and then input face image is corrected by standardizing on two extracted eyes. After a mask is genrated line historgram is applied to finding the feature points of facial elements. Distances and angles between the feature points are used as parameters to recognize full face. To show the validity learning algorithm. We confirmed that the proposed algorithm shows 100% recognition rate on both learned and non-learned data for 20 persons.

• Structural Engineering and Mechanics
• /
• 제90권2호
• /
• pp.159-175
• /
• 2024

In order to solve the problem of calculating the reasonable completed bridge state of a self-anchored hybrid cable-stayed suspension bridge (SA-HCSB), this paper proposes an analytical method. This method simplifies the main beam into a continuous beam with multi-point rigid supports and solves the support reaction forces. According to the segmented catenary theory, it simultaneously solves the horizontal forces of the main span main cables and the stay cables and iteratively calculates the equilibrium force system on the main beam in the collaborative system bridge state while completing the shape finding of the main span main cable and stay cables. Then, the horizontal forces of the side span main cables and stay cables are obtained based on the balance of horizontal forces on the bridge towers, and the shape finding of the side spans are completed according to the segmented catenary theory. Next, the difference between the support reaction forces of the continuous beam with multiple rigid supports obtained from the initial and final iterations is used to calculate the load of ballast on the side span main beam. Finally, the axial forces and strains of each segment of the main beam and bridge tower are obtained based on the loads applied by the main cable and stay cables on the main beam and bridge tower, thereby obtaining analytical data for the bridge in the reasonable completed state. In this paper, the rationality and effectiveness of this analytical method are verified through a case study of a SA-HCSB with a main span of 720m in finite element analysis. At the same time, it is also verified that the equilibrium force of the main beam under the reasonably completed bridge state can be obtained through iterative calculation. The analytical algorithm in this paper has clear physical significance, strong applicability, and high accuracy of calculation results, enriching the shape-finding method of this bridge type.

• 대한기계학회논문집A
• /
• 제29권1호
• /
• pp.45-52
• /
• 2005

A general approximate optimization technique by sequential design domain(SDD) did not save response values for getting an approximate function in each step. It has a disadvantage at aspect of an expense. In this paper, previous response values are recycled for constructing an approximate function. For this reason, approximation function is more accurate. Accordingly, even if we did not determine move limit, a system is converged to the optimal design. Size and shape optimization using approximate optimization technique is carried out with SDD. Algorithm executing Pro/Engineer and ANSYS are automatically adopted in the approximate optimization program by SDD. Convergence criterion is defined such that optimal point must be located within SDD during the three steps. The PLBA(Pshenichny-Lim-Belegundu-Arora) algorithm is used to solve approximate optimization problems. This algorithm uses the second-order information in the direction finding problem and uses the active set strategy.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2002년도 ITC-CSCC -1
• /
• pp.462-465
• /
• 2002

This paper presents a basic theory of information flow from single sending point to multiple receiving points, where new theories of algebraic system called "Hybrid Vector Space" and flow vector space play important roles. Based on the theory, a new algorithm for finding maximum homogenous information flow is proposed, where homogenous information flow means the flow of the same contents of information delivered to multiple clients at a time. Effective multi-routing algorithms fur tree-shape delivery rout search are presented.

• 한국정밀공학회지
• /
• 제19권2호
• /
• pp.151-159
• /
• 2002

The method of accumulating a sequence of focused images is usually used for reconstruction of 3D object\\`s shape. To acquire a focused image, the conventional methods must calculate the focus measures of all pixels resulting in a long measurement time. This paper proposes a new method of reducing the computation time spent for deciding the focused pixels in the input image, which predicts the area in the image to calculate the focus measure based on a priori information on the object to be measured. The proposed algorithm estimates the area to consider in the next measurement based on the focused area in the present measurement. As the focus measure, Laplacian measure was used in this paper and the experiments have shown that the preposed algorithm may significantly reduce the calculation time. Although, as implied, this algorithm can be applied to only simple objects at this stage, advanced representation schemes will eliminate the restrictions on application domain.

• 전자공학회논문지B
• /
• 제33B권3호
• /
• pp.79-87
• /
• 1996

A new method for recognizing and locating partially occluded or overlapped two-dimensional objects regardless of their size, translation, and rotation, is presented. Dominant points approximating occuluding contoures of objects are generated by finding local maxima of smoothed k-cosine function, and then used to guide the contour segment matching procedure. Primitives between the dominant points are produced by projecting the local contours onto the line between the dominant points. Robust classification of primitives. Which is crucial for reliable partial shape matching, is performed using adaptive resonance theory (ART2). The matched primitives having similar scale factors and rotation angles are detected in the hough space to identify the presence of the given model in the object scene. Finally the translation vector is estimated by minimizing the mean squred error of the matched contur segment pairs. This model-based matching algorithm may be used in diveerse factory automation applications since models can be added or changed simply by training ART2 adaptively without modifying the matching algorithm.

• ETRI Journal
• /
• 제36권3호
• /
• pp.333-342
• /
• 2014

Most hyper-ellipsoidal clustering (HEC) approaches use the Mahalanobis distance as a distance metric. It has been proven that HEC, under this condition, cannot be realized since the cost function of partitional clustering is a constant. We demonstrate that HEC with a modified Gaussian kernel metric can be interpreted as a problem of finding condensed ellipsoidal clusters (with respect to the volumes and densities of the clusters) and propose a practical HEC algorithm that is able to efficiently handle clusters that are ellipsoidal in shape and that are of different size and density. We then try to refine the HEC algorithm by utilizing ellipsoids defined on the kernel feature space to deal with more complex-shaped clusters. The proposed methods lead to a significant improvement in the clustering results over K-means algorithm, fuzzy C-means algorithm, GMM-EM algorithm, and HEC algorithm based on minimum-volume ellipsoids using Mahalanobis distance.