• 제어로봇시스템학회논문지
• /
• 제7권1호
• /
• pp.1187-1195
• /
• 2001

This paper presents a sweeping path planning algorithm for an autonomous smearing robot. An automatic planner generates a sweeping path pattern by proposed five basic procedures. This algorithm rocog-nizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the track-ing points in such a way that(1) the connected line segments should not be crossed, (2) the total tracking points should be as short as possible, and (3) the tracking line should not pass through the obstacle, Feasibility of the developed techniques has been demonstrated on a real architectural CAD draft.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제52권11호
• /
• pp.650-656
• /
• 2003

A high speed Viterbi decoder with a circularly connected 2-dimensional analog processing ceil array Is proposed. The proposed Viterbi .decoder has a 2-dimensional parallel processing structure in which an analog processing cell is placed at each node of a trellis diagram, the output column of the analog processing cells is connected to the decoding column, and thus, the output(last) column becomes a column right before the decoding(first) column. The reference input signal given at a decoding column is propagated to the whole network while Its magnitude is reduced by the amount of a error metric on each branch. The circuit-based decoding is done by adding a trigger signals of same magnitudes to disconnect the path corresponding to logic 0 (or 1) and by observing its effect at an output column (the former column of the decoding column). The proposed Viterbi decoder has advantages in that it is operated with better performance of error correction, has a shorter latency and requires no path memories. The performance of error correction with the proposed Viterbi decoder is tested via the software simulation.

• 대한기계학회논문집A
• /
• 제20권6호
• /
• pp.1827-1835
• /
• 1996

This paper addresses the problem of a torch path generation for the 2D laser cutting of a stock plate nested with resular or irregular parts. Under the constaint of the relative positions of parts enforced by nesting, the developed torch path algorithm generate feasible cutting path. In this paper, the basic object is a polygon( a many-slide figure) with holes. A part may be represented as a number of line segments connected end-to-end in counterclockwise order, and formed a closed contour as requied for cutting paths. The objective is to tranverse this cutting contours with a minimum path length. This paper proposes a simulated annealing based dtorch path algorithm, that is an improved version of previously suggested TSP models. Since everypiercing point of parts is not fixed in advance, the algorithm solves as relazed optimization problem for the constraint, thich is one of the main features of the proposed algorithm. For aolving the torch path optimization problem, an efficient generation mechanism of neighborhood structure and as annealing shedule were introduced. In this way, a global solution can be obtained in a reasonable time. Seveeral examples are represented to ilustrate the method.

• 대한조선학회논문집
• /
• 제50권5호
• /
• pp.298-306
• /
• 2013

Nowadays, a transporter manager plans the schedule of the block transportation by considering the experience of the manager, the production process of the blocks and the priority of the block transportation in shipyard. The schedule planning of the block transportation should be rearranged for the reflection of the path blocking cases occurred by unexpected obstacles or delays in transportation. In this paper, the optimal block transportation path planning system is developed for rearranging the schedule of the block transportation by considering the damaged path. $A^*$ algorithm is applied to calculate the new shortest path between the departure and arrival of the blocks transported through the damaged path. In this algorithm, the first node of the damaged path is considered as the starting position of the new shortest path, and then the shortest path calculation is completed if the new shortest path is connected to the one of nodes in the original path. In addition, the data structure for the algorithm is designed. This optimal block transportation path planning system is applied to the Philippine Subic shipyard and the ability of the rapid path modification is verified.

• 전력전자학회논문지
• /
• 제27권1호
• /
• pp.9-17
• /
• 2022

The series-connected semiconductor devices structure is one way to achieve a high voltage rating. However, a problem with voltage imbalance exists in which different voltages are applied to the series-connected switches. This paper proposed a new voltage balancing technique that controls the turn-off delay time of the switch by adding one bipolar junction transistor to the gate turn-off path. The validity of the proposed method is proved through simulation and experiment. The proposed active gate driver not only enables voltage balancing across a variety of current ranges but also has a greater voltage balancing performance compared with conventional RC snubber methods.

• Journal of applied mathematics & informatics
• /
• 제30권1_2호
• /
• pp.245-252
• /
• 2012

In this paper we present a necessary and sufficient conditions for an infinite VAP-free plane graph to be a 3LV-graph as well as an LV-graph. We also introduce and investigate the concept of the order and the kernel of an infinite connected graph containing no one-way infinite path.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 1999년도 하계종합학술대회 논문집
• /
• pp.800-804
• /
• 1999

An intelligent path planning algorithm for an autonomous cleaning robot is presented. This algorithm recognizes obstacle on the architectural CAD draft and generates subgoals as tracking points which executes the area filling task based on heuristic approach. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.

• 조명전기설비학회논문지
• /
• 제25권5호
• /
• pp.34-38
• /
• 2011

The shorter the electric power line is, the less its cost becomes. In this paper, the Steiner tree is applied to find the shortest path of the electric power line to obtain resultant cost reduction. Up to 18.3[%] of length reduction can be expected compared to conventional method when the lines are connected through the Steiner points, which also can result in appreciable cost reduction.

• 산업경영시스템학회지
• /
• 제23권59호
• /
• pp.1-10
• /
• 2000

The traveling salesman problem is a representative NP-Complete problem. It needs lots of time to get a solution as the number of city increase. So, we need an efficient heuristic algorithm that gets good solution in a short time. Almost edges that participate in optimal path have somewhat low value cost. This paper discusses the property of nearest neighbor and 3-opt. This paper uses nearest neighbor's property to select candidate edge. Candidate edge is a set of edge that has high probability to improve cycle path. We insert edge that is one of candidate edge into intial cycle path. As two cities are connected. It does not satisfy hamiltonian cycle's rule that every city must be visited and departed only one time. This paper uses 3-opt's method to sustain hamiltonian cycle while inserting edge into cycle path. This paper presents a highly efficient heuristic algorithm verified by numerous experiments.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 1999년도 추계학술대회 논문집 - 한국공작기계학회
• /
• pp.539-543
• /
• 1999

This paper describes a sweeping path planning algorithm for an autonomous smearing robot on commercial autoCAD system. An automatic planner generates a sweeping path pattern by proposed five basic procedures, (1) interfacing architectural CAD system, (2) off-line obstacle map building, (3) scanning the whole workspace for subgoals of sweeping line, (4) tracking sequence of the subgoals, and (5) obstacle avoiding. A sweeping path is planned by sequentially connecting the tracking points in such a way that (1) the connected line segments should be crossed, (2) the total tracking points should be as short as possible, (3) the tracking line should not pass through the obstacle. Feasibility of the developed techniques has been demonstrated on real architectural CAD draft.