• Journal of Welding and Joining
• /
• v.27 no.3
• /
• pp.67-72
• /
• 2009

The flux cored arc welding (FCAW) process is one of the most frequently employed and important welding process due to high productivity and excellent workability. The process is performed either as an automated process or as a semi-automatic process. In FCAW process, welding voltage has been considered as a qualitative indication of arc length. But it is necessary to let welding operators know, maintain and manage the arc length directly by estimating and displaying it. In this study, to develop arc length estimation technique, we measured a welding circuit resistance($R_sc$) and then we calculated welding circuit voltage drop($V_sc$). Also, we measured arc peak voltage($V_ap$). By subtracting $V_sc$ from $V_arc$, we can easily calculate net arc voltage drop($V_arc$). Consequently, we suggested arc length estimating equation and basic algorithm by regressive analyzing the relationship between net arc voltage drop($V_arc$) and real arc length(Larc) measured by high speed camera. Therefore, arc length can be predicted by just monitoring welding current and voltage.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.58 no.7
• /
• pp.1294-1303
• /
• 2009

This paper presents a new numerical algorithm for fault discrimination and fault location estimation when occur to arcing ground and arcing line to line on transmission lines. The object of this paper is developed from new numerical algorithm to calculate the fault distance and simultaneously to make a distinction between transient and permanent faults. so the first of object for propose algorithm would be distinguish the permanent from the transient faults. This arcing fault discrimination algorithm is used if calculated value of arc voltage amplitude is greater than product of arc voltage gradient and the length of the arc path, which is equal or greater than the flashover length of a suspension insulator string[1-3]. Also, each algorithm is separated from short distance and long distance. This is difference to with/without capacitance between short to long distance. To test the validity of the proposed algorithms, the results of algorithm testing through various computer simulations are given. The test was simulated in EMTP/ATP simulator under a number of scenarios and calculate of algorithm was used to MATLAB.

• Computational Structural Engineering
• /
• v.9 no.3
• /
• pp.107-114
• /
• 1996

The performance for the algorithm of the arc length method has been examined in terms of the choice of the tangential stiffness matrix through the analysis for the snap buckling phenomenon of the arch beam. The curved beam element with 2 nodes including shear effect has been formed by strain element technique and then it has been used in this nonlinear analysis. Snap-through characteristics has been examined with respect to the ratios of the arch beam length to hight.

• Journal of Welding and Joining
• /
• v.15 no.1
• /
• pp.66-80
• /
• 1997

This paper describes a newly developed arc-sensing algorithm of seam-tracking for FCA W (flux-cored arc welding) horizontal fillet welding. In this algorithm, arc current and the Weighted-Are-Current (WAC) are used to adjust the position of a weld torch in directions of bead throat and weaving, respectively. The WAC, which is newly devised in this study, means that arc current in the vicinity of weaving end is more emphasized than that in the center of weaving. The reason of this is because there usually exists much noise in the center of weaving due to abrupt change of arc length in case some empty gaps exist in a fillet joint Variance analysis was performed in order to check the effect of weld parameters on arc current and the WAC. As a result, the relationships between tip-to-workpiece distance and arc current, and between weaving offset and the WAC were established.To check "the validity of the algorithm, seam-tracking experiments were performed ;mder various welding condition. The result of experiments showed a satisfactory tracking performance in the presence of empty gaps in a horizontal fillet joint.et joint.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.2701-2706
• /
• 2003

This paper describes weld seam tracking and error compensation methods of automatic plasma arc welding system designed for the corrugation panel that consists of a linear section and a curved section with various curvatures. Realizing automatic welding system, we are faced with two problems. One is a precise seam tracking and the other is an arc length control. Due to the complexity of the panel shape, it is difficult to find a seam and operate a torch manually in the welding process. So, laser vision sensor for seam tracking is equipped for sensing the seam position and controlling the height of a torch automatically. To attain more precise measurement of an arc length, we measure the 3D shape of the panel and analyze error factors according to the various panel states and caused errors are predicted through the welding process. Using that result, compensation algorithm is added to that of arc length control and real time error compensation is achieved. The result shows that these two methods work effectively.

• Korea-Australia Rheology Journal
• /
• v.21 no.1
• /
• pp.13-16
• /
• 2009

We investigate time-temperature superposition from the viewpoint of geometry. The arc length of viscoelastic plots provides powerful resolution for check of the validity of time-temperature superposition. We also suggest a new algorithm for determination of shift factor which is base on the minimization of the total arc length and does not assume any functional form of viscoelastic function.

• Journal of applied mathematics & informatics
• /
• v.17 no.1_2_3
• /
• pp.1-23
• /
• 2005

The shortest-paths problem is a fundamental problem in graph theory and finds diverse applications in various fields. This is why shortest path algorithms have been designed more thoroughly than any other algorithm in graph theory. A large number of optimization problems are mathematically equivalent to the problem of finding shortest paths in a graph. The shortest-path between a pair of vertices is defined as the path with shortest length between the pair of vertices. The shortest path from one vertex to another often gives the best way to route a message between the vertices. This paper presents an $O(n^2)$ time sequential algorithm and an $O(n^2/p+logn)$ time parallel algorithm on EREW PRAM model for solving all pairs shortest paths problem on circular-arc graphs, where p and n represent respectively the number of processors and the number of vertices of the circular-arc graph.

• Korean Management Science Review
• /
• v.15 no.2
• /
• pp.229-237
• /
• 1998

This paper presents a new algorithm for the K Shortest Paths Problem which is developed with a Double Shortest Arborescence and an inward arc breaking method. A Double Shortest Arborescence is made from merging a forward shortest arborescence and a backward one with Dijkstra algorithm. and shows us information about each shorter path to traverse each arc. Then K shorter paths are selected in ascending order of the length of each short path to traverse each arc, and some paths of the K shorter paths need to be replaced with some hidden shorter paths in order to get the optimal paths. And if the cross nodes which have more than 2 inward arcs are found at least three times in K shorter path, the first inward arc of the shorter than the Kth shorter path, the exposed path replaces the Kth shorter path. This procedure is repeated until cross nodes are not found in K shorter paths, and then the K shortest paths problem is solved exactly. This algorithm are computed with complexity o($n^3$) and especially O($n^2$) in the case K=3.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.34 no.3
• /
• pp.90-96
• /
• 2011

Finding the critical path (or the longest path) on acyclic directed graphs, which is well-known as PERT/CPM, the ambiguity of each acr's length can be modeled as a range or an interval, in which the actual length of arc may realize. In this case, the min-max regret criterion, which is widely used in the decision making under uncertainty, can be applied to find the critical path minimizing the maximum regret in the worst case. Since the min-max regret critical path problem with the interval arc's lengths is known as NP-hard, this paper proposes a heuristic algorithm to diminish the maximum regret. Then the computational experiments shows the proposed algorithm contributes to the improvement of solution compared with the existing heuristic algorithms.

• Journal of Astronomy and Space Sciences
• /
• v.35 no.4
• /
• pp.295-308
• /
• 2018

In this study, orbit determination (OD) simulation for the Korea Pathfinder Lunar Orbiter (KPLO) was accomplished for investigation of the observational arc-length effect using a sequential estimation algorithm. A lunar polar orbit located at 100 km altitude and $90^{\circ}$ inclination was mainly considered for the KPLO mission operation phase. For measurement simulation and OD for KPLO, the Analytical Graphics Inc. Systems Tool Kit 11 and Orbit Determination Tool Kit 6 software were utilized. Three deep-space ground stations, including two deep space network (DSN) antennas and the Korea Deep Space Antenna, were configured for the OD simulation. To investigate the arc-length effect on OD, 60-hr, 48-hr, 24-hr, and 12-hr tracking data were prepared. Position uncertainty by error covariance and orbit overlap precision were used for OD performance evaluation. Additionally, orbit prediction (OP) accuracy was also assessed by the position difference between the estimated and true orbits. Finally, we concluded that the 48-hr-based OD strategy is suitable for effective flight dynamics operation of KPLO. This work suggests a useful guideline for the OD strategy of KPLO mission planning and operation during the nominal lunar orbits phase.