• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.1
• /
• pp.41-47
• /
• 2002

Path setup considering QoS is one of the main problems to solve in Internet traffic engineering. In network restoration that is one of the traffic engineering components, to establish a backup path or backup path for a working path to be protected is the main task. The backup path should have enough bandwidth to guarantee the working paths. Thus this work requires the QoS routing solution that is to set up a backup path as well as a working path at the same time provisioning enough bandwidth. In this paper, we propose an algorithm to setup a backup path that shares the bandwidth of other backup paths whose working path does not pass along the same link with the working path we are considering. In this way we can reduce much bandwidth consumption caused by setting up backup paths. We also analyze the disjoint path computation algorithms. Finally we show simulation results how the algorithm can reduce the bandwidth consumption and how it will affect blocking when we setup paths.

• The Journal of Korea Robotics Society
• /
• v.6 no.3
• /
• pp.255-262
• /
• 2011

Many intelligent robots have to be given environmental information to perform tasks. In this paper an intelligent robot, that is, a cleaning robot used a sensor fusing method of two sensors: LRF and StarGazer, and then was able to obtain the information. Throughout wall following using laser displacement sensor, LRF, the working area is built during the robot turn one cycle around the area. After the process of wall following, a path planning which is able to execute the work effectively is established using flow network algorithm. This paper describes an algorithm for minimal turning complete coverage path planning for intelligent robots. This algorithm divides the whole working area by cellular decomposition, and then provides the path planning among the cells employing flow networks. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The proposed algorithm is applied to two different working areas, and verified that it is an optimal path planning method.

• Restorative Dentistry and Endodontics
• /
• v.45 no.2
• /
• pp.22.1-22.10
• /
• 2020

Objectives: This study investigated the influence of glide path size and operating kinetics on the time to reach the working length and the fracture resistance of Twisted File (TF) and Endostar E3 files. Materials and Methods: A total of 120 mandibular single-rooted premolars were selected. Two methods of kinetic motion (TF adaptive and continuous rotary motion) and file systems (TF and Endostar E3) were employed. The files were used in root canals prepared to apical glide path sizes of 15, 20, and 25. The time taken to reach the working length and the number of canals used before the instrument deformed or fractured were noted. Fractured instruments were examined with scanning electron microscopy. Results: The TF system took significantly more time to reach the working length than the Endostar E3 system. Both systems required significantly more time to reach the working length at the size 15 glide path than at sizes 20 and 25. A greater number of TFs than Endostar E3 files exhibited deformation, and a higher incidence of instrument deformation was observed in adaptive than in continuous rotary motion; more deformation was also observed with the size 15 glide path. One TF was fractured while undergoing adaptive motion. Conclusions: No significant difference was observed between continuous rotary and adaptive motion. The TF system and adaptive motion were associated with a higher incidence of deformation and fracture. Apical glide path sizes of 20 and 25 required significantly less time to reach the working length than size 15.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3098-3100
• /
• 1999

A genetic algorithm for global and local path planning and collision avoidance of mobile robot in dynamic working environment is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

• Management Science and Financial Engineering
• /
• v.11 no.2
• /
• pp.85-103
• /
• 2005

In this paper, we consider the routing and wavelength assignment problem in survivable WDM transport network without wavelength conversion. We assume the single-link failure and a path protection scheme in optical layer. When a physical network and a set of working paths are given, the problem is to select a link-disjoint protection path for each working path and assign a wavelength for each working and protection path. We give an integer programming formulation of the problem and propose an algorithm to solve it. Though the formulation has exponentially many variables, we solve the linear programming relaxation of it by using column generation technique. We devise a branch-and price algorithm to solve the column generation problem. After solving the linear programming relaxation, we apply a variable fixing procedure combined with the column generation to get an integral solution. We test the proposed algorithm on some randomly generated data and test results show that the algorithm gives very good solutions.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2022.04a
• /
• pp.144-145
• /
• 2022

Since the marking robot draws lines by point-to-point operation, the robot's shifting path greatly affects the working time and productivity. Therefore, it is required to analyze the movement method based on the robot's motion and plan to minimize the movement time. Therefore, this study proposes a method that can optimize the robot's shifting path to minimize the working time of the marking robot. Through the results of this study, it is expected that the non-working time of the marking robot will be reduced and the efficient operation will be possible.

• Restorative Dentistry and Endodontics
• /
• v.43 no.4
• /
• pp.41.1-41.7
• /
• 2018

Objectives: The purpose of the present study was to compare the mean preparation times and frequency with which Reciproc and Reciproc Blue instruments reached the full working length in mandibular molars, with or without glide path preparation. Materials and Methods: Previously untreated mesiobuccal and mesiolingual canals with completely formed apices were randomly divided into 6 groups (n = 50) depending on the usage of Reciproc (RC; VDW), Reciproc Blue (RC Blue; VDW), C-Pilot (CP; VDW), and R-Pilot (RP; VDW) files: RC, RC Blue, RC + C-Pilot (RC-CP), RC-Blue + C-Pilot (RC Blue-CP), RC+R-Pilot (RC-RP), and RC Blue + R-Pilot (RC Blue-RP). A glide path was prepared using the hand-operated C-Pilot or the machine-operated R-Pilot instruments, respectively. The ${\chi}^2$ test, analysis of variance, and the Tukey post hoc test were used for statistical comparisons. Results: No statistically significant differences were observed in the distribution of the frequency of reaching the full working length in the RC (94%), RC Blue (88%), RC-CP (94%), RC Blue-CP (90%), RC-RP (96%), and RC Blue-RP (92%) groups (p > 0.05). Conclusions: Preparation of a glide path did not have a significant effect on reaching the full working length using these systems.

• Current Optics and Photonics
• /
• v.1 no.4
• /
• pp.315-324
• /
• 2017

In recent years, multicast services such as high-definition television (HDTV), video conferencing, interactive distance learning, and distributed games have increased exponentially, and wavelength-division multiplexing (WDM) networks are considered to be a promising technology due to their support for multicast applications. Multicast survivability in WDM networks has been the focus of extensive attention since a single-link failure in an optical network may result in a massive loss of data. But the improvement of network survivability increases energy consumption due to more resource allocation for protection. In this paper, an energy-efficient multicast algorithm (EEMA) is proposed to reduce energy consumption in WDM networks. Two cost functions are defined based on the link state to determine both working and protection paths for a multicast request in WDM networks. To increase the number of sleeping links, the link cost function of the working path aims to integrate new working path into the links with more working paths. Sleeping links indicate the links in sleep mode, which do not have any working path. To increase bandwidth utilization by sharing spare capacity, the cost function of the protection path is defined to use sleeping fibers for establishing new protection paths. Finally, the performance of the proposed algorithm is evaluated in terms of energy consumption, and also the blocking probability is evaluated under various traffic environments through OPNET. Simulation results show that our algorithm reduces energy consumption while maintaining the quality of service.

• The Journal of Korea Robotics Society
• /
• v.5 no.2
• /
• pp.120-126
• /
• 2010

This paper presents to study the path tracking method of AGV(autonomous guided vehicle) which has a laser guidance system. An existing automatic guided vehicles(AGVs) which were able to drive on wired line only had a automatic guidance system. However, the automatic guidance systems that those used had the high cost of installation and maintenance, and the difficulty of system change according to variation of working environment. To solve such problems, we make the laser guidance system which is consisted of a laser navigation and gyro, encoder. That is robust against noise, and flexible according to working environment through sensor fusion. The laser guidance system can do a perfect autonomous driving. However, the commercialization of perfect autonomous driving system is difficult, because the perfect autonomous driving system must recognize the whole environment of working space. Hence, this paper studied the path tracking of AGV using laser guidance system without wired line. The path tracking method is consisted of virtual path generation method and driving control method. To experiment, we use the fork-type AGV which is made by ourselves, and do a path tracking experiments repeatedly on same experimental environment. In result, we verified that proposed system is efficient and stable for actual fork-type AGV.

• Restorative Dentistry and Endodontics
• /
• v.40 no.2
• /
• pp.123-127
• /
• 2015

Objectives: Glide path preparation is recommended to reduce torsional failure of nickel-titanium (NiTi) rotary instruments and to prevent root canal transportation. This study evaluated whether the repetitive insertions of G-files to the working length maintain the apical size as well as provide sufficient lumen as a glide path for subsequent instrumentation. Materials and Methods: The G-file system (Micro-Mega) composed of G1 and G2 files for glide path preparation was used with the J-shaped, simulated resin canals. After inserting a G1 file twice, a G2 file was inserted to the working length 1, 4, 7, or 10 times for four each experimental group, respectively (n = 10). Then the canals were cleaned by copious irrigation, and lubricated with a separating gel medium. Canal replicas were made using silicone impression material, and the diameter of the replicas was measured at working length (D0) and 1 mm level (D1) under a scanning electron microscope. Data was analysed by one-way ANOVA and post-hoc tests (p = 0.05). Results: The diameter at D0 level did not show any significant difference between the 1, 2, 4, and 10 times of repetitive pecking insertions of G2 files at working length. However, 10 times of pecking motion with G2 file resulted in significantly larger canal diameter at D1 (p < 0.05). Conclusions: Under the limitations of this study, the repetitive insertion of a G2 file up to 10 times at working length created an adequate lumen for subsequent apical shaping with other rotary files bigger than International Organization for Standardization (ISO) size 20, without apical transportation at D0 level.