• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2021.10a
• /
• pp.94-96
• /
• 2021

In this paper, we develop a new navigation algorithm for industrial mobile robots to arrive at the destination in unknown environment. To achieve this, we suggest a navigation algorithm that combines Dynamic Window Approach (DWA) and Dijkstra path planning algorithm. We compare Local Dynamic Window Approach (LDWA), Global Dynamic Window Approach(GDWA), Rapidly-exploring Random Tree (RRT) Algorithm. The navigation algorithm using Dijkstra algorithm combined with LDWA and GDWA makes mobile robots to reach the destination. and obstacles faced during the path planning process of LDWA and GDWA. Then, we compare on time taken to arrive at the destination, obstacle avoidance and computation complexity of each algorithm. To overcome the limitation, we seek ways to use the optimized navigation algorithm for industrial use.

• Journal of applied mathematics & informatics
• /
• v.41 no.4
• /
• pp.861-868
• /
• 2023

Nonlinear network creates complex homotopy structural communication in wireless network medium because of complex distribution approach. Due to this multicast topological connection structure, the queuing probability was non regular principles to create routing structures. To resolve this problem, we propose a Co-cluster homotopy queuing model (Co-CHQT) for Nonlinear Algebraic Topological Structure (NLTS-) for improving poison distribution network communication. Initially this collects the routing propagation based on Nonlinear Distance Theory (NLDT) to estimate the nearest neighbor network nodes undernon linear at x_(a,b)→ax²+bx² = c. Then Quillen Network Decomposition Theorem (QNDT) was applied to sustain the non-regular routing propagation to create cluster path. Each cluster be form with co variance structure based on Two unicast 2(n+1)-Z2(n+1)-Z network. Based on the poison distribution theory X_(a,b) ≠ µ(C), at number of distribution routing strategies weights are estimated based on node response rate. Deriving shorte;'l/st path from behavioral of the node response, Hilbert -Krylov subspace clustering estimates the Cluster Head (CH) to the routing head. This solves the approximation routing strategy from the nonlinear communication depending on Max- equivalence theory (Max-T). This proposed system improves communication to construction topological cluster based on optimized level to produce better performance in distance theory, throughput latency in non-variation delay tolerant.

• Steel and Composite Structures
• /
• v.49 no.4
• /
• pp.393-405
• /
• 2023

In this paper, the energy absorption capability of a novel cruciform composite lattice structure was evaluated through the simulation of compression tests. For this purpose, several test samples of Polylactic acid cellular reinforced with continuous glass fibers were prepared for compression testing using the additive manufacturing method of material extrusion. Using a conventional path design for material extrusion, multiple debonding is probable to be occurred at the joint regions of adjacent cells. Therefore, an innovative printing path design was proposed for the cruciform lattice structure. Afterwards, quasistatic compression tests were performed to evaluate the energy absorption behaviour of this structure. A finite element model based on local material property degradation was then developed to verify the experimental test and extend the virtual test method. Accordingly, different combinations of unit cells' dimensions using the design of the experiment were numerically proposed to obtain the optimal configuration in terms of the total absorbed energy. Having brilliant energy absorption properties, the studied cruciform lattice with its optimized unit cell dimensions can be used as an energy absorber in crashworthiness applications. Finally, a cellular structure will be suitable with optimal behavior in crush load efficiency and high energy absorption.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.37 no.4
• /
• pp.350-358
• /
• 2009

This paper describes a result of the guidance and control for re-entry vehicle during TAEM phase. TAEM phase (Terminal Aerial Energy Management phase) has many conditions, such as density, velocity, and so on. Under these conditions, we have optimized trajectory and other states for guidance in TAEM phase. The optimized states consist of 7 variables, down-range, cross range, altitude, velocity, flight path angle, vehicle's azimuth and flight range. We obtained the optimized reference trajectory by DIDO tool, and used feedback linearization with neural network for control re-entry vehicle. By back propagation algorithm, vehicle dynamics is approximated to real one. New command can be decided using the approximated dynamics, delayed command input and plant output, NARMA-L2. The result by this control law shows a good performance of tracking onto the reference trajectory.

• Journal of Periodontal and Implant Science
• /
• v.48 no.4
• /
• pp.202-212
• /
• 2018

Purpose: Bone-to-implant contact (BIC) is difficult to measure on micro-computed tomography (CT) because of artifacts that hinder accurate differentiation of the bone and implant. This study presents an advanced algorithm for measuring BIC in micro-CT acquisitions using a spiral scanning technique, with improved differentiation of bone and implant materials. Methods: Five sandblasted, large-grit, acid-etched implants were used. Three implants were subjected to surface analysis, and 2 were inserted into a New Zealand white rabbit, with each tibia receiving 1 implant. The rabbit was sacrificed after 28 days. The en bloc specimens were subjected to spiral (SkyScan 1275, Bruker) and round (SkyScan 1172, SkyScan 1275) micro-CT scanning to evaluate differences in the images resulting from the different scanning techniques. The partial volume effect (PVE) was optimized as much as possible. BIC was measured with both round and spiral scanning on the SkyScan 1275, and the results were compared. Results: Compared with the round micro-CT scanning, the spiral scanning showed much clearer images. In addition, the PVE was optimized, which allowed accurate BIC measurements to be made. Round scanning on the SkyScan 1275 resulted in higher BIC measurements than spiral scanning on the same machine; however, the higher measurements on round scanning were confirmed to be false, and were found to be the result of artifacts in the void, rather than bone. Conclusions: The results of this study indicate that spiral scanning can reduce metal artifacts, thereby allowing clear differentiation of bone and implant. Moreover, the PVE, which is a factor that inevitably hinders accurate BIC measurements, was optimized through an advanced algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.1
• /
• pp.91-102
• /
• 1996

The multicast routing algorithm is necessary to transmit multimedia traffic efficiently in ATM (asynchronous transfer mode) networks. In this paper, we propose the multicast routing algorithm which is based on VP/VC characteristic. The proposed algorithm is based on VP tree concept and using cost function which is based on VP/VC switching. The cost funication is composed of link cost, delay and weighting factor on delay and the weighting factor is calculated by delay sensitivity of the traffic. The proposed algorithm can choose delay bounded path which satisfies delay constraint, moreover it can choose optimal path among VPs which has the same link cost and satisfying delay constraint. With controlling weighting factor, proposed algorithm can set-up efficient path. When the weighting factor sets to be between 0.8 and 1, experimental results show that the perforance of proposed scheme is approximated to that of cost optimal algorithm and strongly delay optimized algorithm.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.34 no.2
• /
• pp.617-626
• /
• 2014

Lately, losses and damage from natural disasters have been increasing. Researchers across various fields in Korea are trying to come up with a response plan, but research for evacuation plans is still far from satisfactory. Hence this paper proposes a model that could find an optimized evacuation route for when disasters occur over wide areas. Development of the model used methods including the Dijkstra shortest path algorithm, feasible path method, genetic algorithm, and pareto efficiency. Computations used parallel computing (SPMD) for high performance. In addition, the developed model is applied to a virtual network to check the validity. Finally the adaptability of the model is verified on a real network by computating for Gumi 1stNational Industrial Complex. Computation results proved that this model is valid and applicable by comparison of the fitness values for before optimization and after optimization. This research can contribute to routing for responder vehicles as well as planning for evacuation by objective when disasters occur.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2711-2733
• /
• 2018

Minimizing power consumption in bandwidth limited optical traffic grooming networks is presented as a two-objective optimization problem. Since the main objective is to route a connection, the network throughput is maximized first, and then the minimum power consumption solution is found for this maximized throughput. Both transparent IP over WDM (Tp-IPoWDM) and translucent IP over WDM (Tl-IPoWDM) network may be applied to examine such bi-objective algorithms. Simulations show that the bi-objective algorithms are more energy-efficient than the single objective algorithms where only the throughput is optimized. For a Tp-IPoWDM network, both link based ILP (LB-ILP) and path based ILP (PB-ILP) methods are formulated and solved. Simulation results show that PB-ILP can save more power than LB-ILP because PB-ILP has more path selections when lightpath lengths are limited. For a Tl-IPoWDM network, only PB-ILP is formulated and we show that the Tl-IPoWDM network consumes less energy than the Tp-IPoWDM network, especially under a sparse network topology. For both kinds of networks, it is shown that network energy efficiency can be improved by over-provisioning wavelengths, which gives the network more path choices.

• The Journal of the Korea Contents Association
• /
• v.12 no.12
• /
• pp.46-53
• /
• 2012

The traffic in research network for the new structure of the network and new service research has the various properties. From the perspective of a specific traffic point of view, transmission of traffic with different requirements using a single routing protocol is an obstacle to satisfy requirements. In this study, we classify the properties of the traffic into two types. We propose the way that we can get the overall optimization effect, the experiment proves it by providing independent multiple forwarding path by applying optimized algorithm by types. In order to distinguish each type of traffic we use the ports on the switch and in order to implement independent path we apply OpenFlow system. In other words, we present the measure that can be implemented to improve the satisfaction of the traffic by making multiple paths by OpenFlow controller according to the type of traffic and by enforcing in Forwarder.

• Journal of KIISE:Information Networking
• /
• v.32 no.3
• /
• pp.310-317
• /
• 2005

In opposition to conventional networks, mobile ad hoc networks usually do not offer trust about nodes or online access through certificate authorities or centralized servers. But, nodes in those systems need process that can search path as well as trust each other to exchange data in safety For these reasons, traditional security measures that require online trusted authorities or certificate storages are not well-suited for securing ad hoc networks. In this paper, I propose a secure and effective method to search the optimized path using profitable flooding techniques on certificate chains in MANETS(Mobile Ad hoc NETworks). This system includes not only using routing protocols that are generally broadcasting packets but also finding nodes securely and verifing the process through tiust relationships between nodes that are searched.