• Journal of Korean Society of Transportation
• /
• v.22 no.6
• /
• pp.121-131
• /
• 2004

The K-shortest path algorithms are largely classified into two groups: oneis for finding loopless path (simple path), another loop paths. In terms of cimputational complexities, in general the loop-paths-finding ones are considered more efficient and easier to be handled than the loopless-paths-finding. The entire path deletion methods have been known as the best efficient algorithms among the proposed K-shortest path algorithms. These algorithms exploit the K-th network transformation to prevent the same path, which was already selected as the (K-1)th path, from being redetected. Nevertheless, these algorithms have a critical limitationto be applied in the practical traffic networks because the loops, in which the same modes and links can be unlimitedly repeated, are not preventable. This research develops a way to be able to selectively control loop-paths by applying link-label. This research takes an advantage of the link-based shortest path algorithms that since the algorithms can take care of two links simultaneouslyin the searching process, the generation of loops can be controlled in the concatenation process of the searched link and the preceded link. In concatenation of two links, since the precede link can be treated a sub-shortest to this link from the origination, whether both the node and the link of the searched link were already existed or not can be evaluated. Terefore, both the node-loopless path, in which the same node is not appeared, and the link-loopless, in which the same link is not appeared, can be separately controlled. Especially, the concept of the link-loopless path is expended to take into consideration reasonable route choice behaviors such as U-Turn, P-Turn, and Turn-Penalty, which are frequently witnessed in urban traffic network with intersections. The applicability of the proposed method is verified through case studies.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.8 no.6
• /
• pp.584-590
• /
• 1984

This study is to develop a program, with which the motion of the system can be simulated in view of kinematics and dynamics, and then evaluate functional capabilities of many robots in order to select the most suitable one for any given working conditions. According to the theory of Denavit & Hartenberg, rectangular coordinate is set at each joint in the robot of six joints, as this one is the major concern, and transformation matrices are derived between any two coordinates. The necessary displacement of each joint for executing a given a work is obtained from the position and posture transformation and the in-stantaneous velocity of the joint is got from given velocity distribution of the path. The necessary torque of each joint is finally calculated by Newton-Euler Method. This simulation program is applied to a robot with six rotational joints, Rotational angle and torque to time which has a given motion trajectory are figured and also torque to r.p.m.

• Journal of the Korean Society for Precision Engineering
• /
• v.20 no.9
• /
• pp.197-204
• /
• 2003

This study proposes a method to reduce errors in scanning object and registration using a laser scanner. The method consists of 3 stages. First, there is an error induced by the difference of the distance between the probe and the object. It is possible to reduce the error by planning a scanning strategy: object setting, scan path. Second, the scan data of the tooling ball affects calculating the tooling ball center. A z-direction compensation is given to calculate more accurate registration points. Third, three points are used to determine a coordinate transformation on each frame. The maximum error usually lies on the third tooling ball in the conventional merging method. LSM (Least Square Method) is applied to a coordinate transformation to reduce the registration error.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.629-632
• /
• 1999

In this paper, color coordinate system transformation based visual servo controller has been considered. Mobile robot always has a position error and an orientation error resulted from wheel slipping etc.. Even more, the errors have accumulative properties. So feedback from environments is important. In this paper, by using color model faster land mark extraction can be achieved. And the global position and the orientation of mobile robot can be known by only two land marks positions in image coordinate system. Finally, the adoption of visual information in path tracking problem makes visual servo control.

• Korean Journal of Mathematics
• /
• v.7 no.2
• /
• pp.151-158
• /
• 1999

Let (X, G) be a transformation group and ${\sigma}(X,x_0,G)$ the fundamental group of (X, G). In this paper, we prove that the Reidemeister number $R(f_G)$ for an endomorphism $f_G:(X,G){\rightarrow}(X,G)$ is a homotopy invariant. In particular, when any self-map $f:X{\rightarrow}X$ is homotopic to the identity map, we give some calculation of the lower bound of $R(f_G)$. Finally, we discuss commutativity and product formula for the Reidemeister number $R(f_G)$.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 2002.10a
• /
• pp.393-398
• /
• 2002

This study proposes a method to reduce error scanning data of laser scanner. The method co of 3 stages. First, there is an error indu difference of the distance between the prob the object. It is possible to reduce the e planning a scanning strategy: object settin path. Second, the scan data loss of the tooli affects calculating the tooling ball con z-direction compensation is given to calculat accurate registration points. Third, three p used to determine a transformation matrix on frame. As merging, the maximum error usually on the third tooling ball in the conven method, which select a point among three po randomly. We find the centroid of 3 points apply it to determine a new transformation mat

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.591-595
• /
• 2000

In this paper color coordinate system transformation based visual servo controller has been considered Mobile robot always has a position error and an orientation error resulted from wheel slipping etc.. Even more, the errors have accumulative properties. So feedback from environments is important. In this paper by using color model faster land mark extraction can be achieved. And the global position and the orientation of mobile robot can be known by only two land mark positions in image coordinate system. Finally, the adoption of visual information in path tracking problem makes visual servo control.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.151-155
• /
• 2001

Mobile agent technology has been the subject of much attention in the last few years, mainly due to the proliferation of distributed software technologies combined with the distributed AI research field. In this paper, we present a design of communication networks of agents that cooperate with each other for forwarding messages to the specific mobile agent in order to make the overall system location transparent. In order to make the material accessible to general intelligent system researchers, we present the general ideas abstractly in terms of the graph theory. In particular, a proxy network is defined as a directed acyclic graph satisfying some structural conditions. In turns out that the definition ensures some kind of reliability of the network, in the sense that as long as at most one proxy agent is abnormal, there agent exists a communication path, from every proxy agent to the target agent, without passing through the abnormal proxy. As the basis for the implementation of this scheme, an appropriate initial proxy network is specified and the dynamic nature of the network is represented by a set of graph transformation rules. It is shown that those rules are sound, in the sense that all graphs created from the initial proxy network by zero or more applications of the rules are guaranteed to be proxy networks. Finally, we will discuss some implementation issues.

• Journal of the Korean Society of Visualization
• /
• v.20 no.1
• /
• pp.11-17
• /
• 2022

Among the various factors that cause the performance decrease of heat exchangers used in many industries, flow path blocking is one of the important and serious factor. In order to solve this problem, proper maintenance and management of the heat exchanger is important and emphasized. In this study, we developed and algorithm that can quantitatively determine and diagnose the normal and blocked areas of fin-tube heat exchanger using pattern analysis, Gaussian Edge Detection, Image Processing and Affine Transformation techniques. The developed algorithms was applied to the actual heat exchanger and the performance was evaluated by comparing with the manual results. From these results, it was proved that the developed algorithm is effective in evaluating the pollution ratio of the fin-tube heat exchanger.

• Journal of the Economic Geographical Society of Korea
• /
• v.10 no.1
• /
• pp.1-18
• /
• 2007

This study examines the development direction of Ulsan automobile cluster and suggests strategic interventions, based on the possibility of system transformation in the open economic system. The spatial characteristics of global, national and local production and R&D networks were analyzed to investigate the conditions of Ulsan automobile cluster. And the agglomeration process of automobile industry and the capabilities accumulated in Ulsan were analyzed and alternative developmental path and policy suggestions were proposed.