• Magazine of the Korean Society of Agricultural Engineers
• /
• v.44 no.2
• /
• pp.127-135
• /
• 2002

Due to the fact that the design of a reinforced concrete structure changes in accordance with its shape and assigned load, total automation of the design system has not been achieved. For instance, since there is no general rule about setting up reinforcing steel quantity and arrangement location, it is simply not feasible to automatically decide the reinforcing arrangement location. In this study, the ESO(evolutionary structural optimization) technique and its related issues will be discussed. The ESO techniques is determined the reasonable load path which is traveling of load between in-flow and out-flow at a concrete structure using numerical analysis. And the results applied to the steel arrangement in reinforced concrete structures. The optimal algorithm, which determines the terminal criteria during ESO process, has been updated by using the obtained results. And the load path within the member has been determined automatically.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.11C
• /
• pp.1055-1063
• /
• 2002

In this paper, we have studied path selection problem using multiple metric. Current Internet selects a path using only one metric. The path selected by one metric is a best-effort service that can satisfy one requirements. In order to satisfy a call with various Qualify-of-Service(QoS) requirements, the path must satisfy multiple constraints. In many cases, path selection is NP-complete. The proposed algorithm is widest-least cost routing algorithm that selects a path based on cost metric which is basically a delay metric influenced by the network status. The proposed algorithm is a multiple metric path selection algorithm that has traffic distribution ability to select shortest path when network load is light and move traffic to other alternate path when the link load is high. We have compared the results with other routing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.4
• /
• pp.1256-1275
• /
• 2014

As one of the new self-organizing and self-configuration broadband networks, wireless mesh networks are being increasingly attractive. In order to solve the load balancing problem in wireless mesh networks, this paper proposes a novel multi-path routing algorithm based on clustering (Cluster_MMesh) for wireless mesh networks. In the clustering stage, on the basis of the maximum connectivity clustering algorithm and k-hop clustering algorithm, according to the idea of maximum connectivity, a new concept of node connectivity degree is proposed in this paper, which can make the selection of cluster head more simple and reasonable. While clustering, the node which has less expected load in the candidate border gateway node set will be selected as the border gateway node. In the multi-path routing establishment stage, we use the intra-clustering multi-path routing algorithm and inter-clustering multi-path routing algorithm to establish multi-path routing from the source node to the destination node. At last, in the traffic allocation stage, we will use the virtual disjoint multi-path model (Vdmp) to allocate the network traffic. Simulation results show that the Cluster_MMesh routing algorithm can help increase the packet delivery rate, reduce the average end to end delay, and improve the network performance.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.2B
• /
• pp.183-191
• /
• 2004

Single shortest path routing is known to perform poorly for Internet traffic engineering (TE) where the typical optimization objective is to minimize the maximum link load. Splitting traffic uniformly over equal cost multiple shortest paths in OSPF and IS-IS does not always minimize the maximum link load when multiple paths are not carefully selected for the global traffic demand matrix. However, among all the equal cost multiple shortest paths in the network, a set of TE-aware shortest paths, which reduces the maximum link load significantly, can be found and used by IP routers without any change of existing routing protocols and serious configuration overhead. While calculating TE-aware shortest paths. the destination-based forwarding constraint at a node should be satisfied, because an IP router will forward a packet to the next-hop toward the destination by looking up the destination prefix. In this paper, we present a problem formulation of finding a set of TE-aware shortest paths in ILP, and propose a simple heuristic for the problem. From the simulation results, it is shown that TE-aware shortest path routing performs better than default shortest path routing and ECMP in terms of the maximum link load with the marginal configuration overhead of changing the next-hops.

• Journal of Drive and Control
• /
• v.19 no.4
• /
• pp.19-28
• /
• 2022

This paper introduces an automatic steering system for straight traveling capable of being mounted on drivable agricultural machinery which user can handle it such as a tractor, a transplant, etc. The modular automatic steering device proposed in the paper is composed of RTK GNSS, IMU, HMI, hydraulic valve, and wheel sensor. The path generation method of the automatic steering system is obtained from two location information(latitude and longitude on each point) measured by GNSS in advance. From HMI, a straight path(AB line) can be created by connecting latitude and longitude on each point and the device makes the machine able to follow the path. During traveling along the reference path, it acquires the real time position data every sample time(0.1s), compares the reference with them and calculates the lateral deviation. The values of deviation are used to control the steering angle of the machine using hydraulic valve mounted on the axle of front wheel. In this paper, Pure Pursuit algorithm is applied used in autonomous vehicles frequently. For the analysis of traveling characteristics, field tests were executed about these conditions: velocity of 2, 3, 4km/h which is applied to general agricultural work and ground surface of solid(asphalt) and weak condition(soil) such as farmland. In the case of weak ground state, two experiments were executed about no-load(without work) and load(with work such as plowing). The maximum average deviations were presented 2.44cm, 7.32cm, and 11.34cm during traveling on three ground conditions : asphalt, soil without load and with load(plowing).

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.6
• /
• pp.924-931
• /
• 2008

This paper presents a buswise transmission loss allocation algorithm utilizing the transaction strategy. We prove that whatever calculated by any transaction strategy, the total of the allocated transmission losses of each bus, including no-load loss allocation, almost equals the total loss of AC power flow algorithm and the loss is perfectly slackbus-independent. In this paper, the allocated transmission losses of each bus is calculated by the method of integrating loss sensitivities using by the load level parameter ${\lambda}$. The performance of the proposed algorithm is evaluated by the case studies carried out on the WSCC 9-bus and IEEE 14-bus systems.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.9
• /
• pp.3496-3514
• /
• 2015

One of the challenging tasks in Mobile Ad hoc Network is to discover precise optimal routing solution due to the infrastructure-less dynamic behavior of wireless mobile nodes. Ant Colony Optimization, a swarm Intelligence technique, inspired by the foraging behaviour of ants in colonies was used in the past research works to compute the optimal path. In this paper, we propose a Recurrent Ant Colony Optimization (RECACO) that executes the actual Ant Colony Optimization iteratively based on recurrent value in order to obtain an optimal path convergence. Each iteration involves three steps: Pheromone tracking, Pheromone renewal and Node selection based on the residual energy in the mobile nodes. The novelty of our approach is the inclusion of new pheromone updating strategy in both online step-by-step pheromone renewal mode and online delayed pheromone renewal mode with the use of newly proposed metric named ELD (Energy Load Delay) based on energy, Load balancing and end-to-end delay metrics to measure the performance. RECACO is implemented using network simulator NS2.34. The implementation results show that the proposed algorithm outperforms the existing algorithms like AODV, ACO, LBE-ARAMA in terms of Energy, Delay, Packet Delivery Ratio and Network life time.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1993.10a
• /
• pp.666-671
• /
• 1993

Fatigue life prediction under multi-axial variable load were performed for Aluminium 7075-T651 alloy using SAE Notched specimen & Torque tube shaft component specimen. When variable multiaxial load is applied to material, maximum damaged plane(critical plane) change. To clarify the situation, experiment is performed on two different changing load path. For multiaxial fatigue life prediction, miner rule is expanded to critical plane theory. Shear based parameter and Elliptical parameter give better correlation. This suggests that miner rule can be applicable on multi-axial variable load.

• The Journal of Korea Robotics Society
• /
• v.5 no.4
• /
• pp.332-338
• /
• 2010

This paper presents a study of path-planning method for AGV(automated guided vehicle) based on path-tracking. It is important to find an optimized path among the AGV techniques. This is due to the fact that the AGV is conditioned to follow the predetermined path. Consequently, the path-planning method is implemented directly affects the whole AGV operation in terms of its performance efficiency. In many existing methods are used optimization algorithms to find optimized path. However, such methods are often prone with problems in handling the issue of inefficiency that exists in system's operation due to inherent undue time delay created by heavy load of complex computation. To solve such problems, we offer path-planning method using modified binary tree. For the purpose of our experiment, we initially designed a AGV that is equiped with laser navigation, two encoders, a gyro sensor that is meant to be operated within actual environment with given set of constrictions and layout for the AGV testing. The result of our study reflects the fact that within such environments, the proposed method showed improvement in its efficiency in finding optimized path.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.1990-1994
• /
• 2008

In this paper, we present a usable method of driving path in automatic guidance vehicle(AGV). The AGV is precisely driving to follow reference route. The Phileas in Netherland and Bi-modal tram in Korea have one wheel for the each side because of all wheels steering. For this reason, the loading area of wheels is very small. It is a disadvantage for asphalt load. The precise route tracking of vehicle can distort the flexible asphalt load. In this paper, we propose a driving method for alleviation of distortion on asphalt load.