• Journal of Institute of Control, Robotics and Systems
• /
• v.18 no.2
• /
• pp.94-102
• /
• 2012

There have been many homing navigation algorithms for robotic system. In this paper, we suggest a bio-inspired navigation model. It builds path integration based on optical flow. We consider two factors on robot movements, translational movement and rotational movement. For each movement, we found distinguishable optical flows. Based on optical flow, we estimate ego-centric robot movement and integrate the path optimally. We can determine the homing direction and distance. We test this algorithm and evaluate the performance of homing navigation for robotic system.

• Proceedings of the KIEE Conference
• /
• 1999.07g
• /
• pp.3004-3006
• /
• 1999

In this paper, we present the ball position and path plain method for the robot-soccer using optical flow. As we compare a optical flow method with a general method within the accurate and effective ball position information of robot-soccer or the path planning, we prove accurate and effective optical flow algorithm to apply ball position and path plain for robot-soccer

• Management Science and Financial Engineering
• /
• v.4 no.2
• /
• pp.1-13
• /
• 1998

The Shortest Path Problem in Time-dependent Networks, where the travel time of each link depends on the time interval, is not realistic since the model and its solution violate the Non-passing Property (NPP:often referred to as FIFO) of real phenomena. Furthermore, solving the problem needs much more computational and memory complexity than the general shortest path problem. A new model for Time-dependent Networks where the flow speeds of each link depend on time interval, is suggested. The model is more realistic since its solution maintains the NPP. Solving the problem needs just a little more computational complexity, and the same memory complexity, as the general shortest path problem. A solution algorithm modified from Dijkstra's label setting algorithm is presented. We extend this model to the problem of Minimum Expected Time Path in Time-dependent Stochastic Networks where flow speeds of each link change statistically on each time interval. A solution method using the Kth-shortest Path algorithm is presented.

• Journal of Institute of Control, Robotics and Systems
• /
• v.11 no.9
• /
• pp.789-794
• /
• 2005

This paper describes an algorithm for minimal turning complete coverage Path planning for cleaning robots. This algorithm divides the whole cleaning area by cellular decomposition, and then provides the path planning among the cells employing a flow network. It also provides specific path planning inside each cell guaranteeing the minimal turning of the robots. The minimal turning of the robots is directly related to the faster motion and energy saving. The proposed algorithm is compared with previous approaches in simulation and the result shows the validity of the algorithm.

• Proceedings of the Korean Institute of Building Construction Conference
• /
• 2015.11a
• /
• pp.170-171
• /
• 2015

Resource procurement and material handling are considered as a significant part of construction project especially in large or tall building construction site. There are multiple variables that must be considered in a construction site during finishing work such as movement of materials, equipments, and workers. Therefore, it is difficult for construction workers to find the material handling path solely by intuition. The aim of this study is to propose a real-time path finding model suitable for complicated logistics flow in the field. The model explores the optimal transport path of finishing material with its basis on optimization algorithm, and it determines the direction of the Smart Sign. The proposed model is expected to be utilized for planning of efficient finishing material handling.

• Journal of the military operations research society of Korea
• /
• v.18 no.2
• /
• pp.151-166
• /
• 1992

In this paper, we define a problem finding a simple path that maximizes the sum of the satisfied Origin-Destination (O-D) flows between nodes covered by that path as a Maximum O-D Flow Path Problem(MODEP). We established a formulation and suggested a method finding MODEP in a directed network. The method utilizes the constraint relaxation technique and the Dual All Integer Algorithm.

• Communications for Statistical Applications and Methods
• /
• v.9 no.3
• /
• pp.845-851
• /
• 2002

An efficient method is developed to obtain the maximum flow for a network when its simple paths are known. Most of the existing techniques need to convert simple paths into minimal cuts, or to determine the order of simple paths to be applied in the process to reach the correct result. In this paper, we propose a method based on the concepts of signed simple path and signed flow defined in the text. Our method involves a fewer number of arithmetic operations at each iteration, and requires fewer iterations in the whole process than the existing methods. Our method can be easily extended to a mixed network with a slight modification. Furthermore, the correctness of our method does not depend on the order of simple paths to be applied in the process.

• Proceedings of the KSME Conference
• /
• 2001.11b
• /
• pp.837-841
• /
• 2001

Almost all power plant boiler has temperature distribution nonuniformity problem in heat transfer tube flow path. It can cause hot spot damage of superheated or reheated heat transfer section and reduce maintenance schedule when nonuniformity is severe. There are two solutions for improvement temperature nonuniformity. one is change of gas flow distribution of gas path and the other is contorl steam flow in tube bank. Of course, first method is very difficulty to apply but second method is'nt. In this paper, control steam flow is used to solve temperature nonuniformity of power plant boiler.

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.171-180
• /
• 2002

The effective and accurate data flow problem analysis uses the dominator tree and DJ graphs. The data flow problem solving is to safely reduce the flow graph to the dominator tree. The flow graph replaces a parse tree and used to accurately reduce either reducible or irreducible flow graph to the dominator tree. In this paper, in order to utilize Tarian's path compress algorithm, the Top node finding algorithm is suggested and the existing delay reduction algorithm is improved using Path compression. The delayed reduction a1gorithm using path compression actually compresses the pathway of the dominator tree by hoisting the node while reducing to delay the DJ graph. Realty, the suggested algorithm had hoisted nodes in 22% and had compressed path in 20%. The compressed dominator tree makes it possible to analyze the effective data flow analysis and brings the improved effect for the complexity of code optimization process with the node hoisting effect of code optimization process.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.15 no.12
• /
• pp.1043-1048
• /
• 2003

An experimental investigation was executed to determine the capacity degradation due to non-uniform refrigerant distribution in a multi-path evaporator. In addition, the possibility of recovering the capacity reduction by controlling the refrigerant distribution among refrigerant paths was assessed. The finned-tube evaporator, which had a three-path and three-depth-row, was tested by controlling inlet quality, exit pressure, and exit superheat for each refrigerant path. The capacity reduction due to superheat unbalance between each path was as much as 30%, even when the overall evaporator superheat was kept at a target value of 5.6$^{\circ}C$. It may indicate that the internal heat transfer within the evaporator assembly caused the partial capacity drop. For the evaporator having air mal-distributions, the maximum capacity reduction was found to be 8.7%. A 4.5% capacity recovery was obtained by controlling refrigerant distribution to obtain the target superheat at the outlet of each path.