• The KSFM Journal of Fluid Machinery
• /
• v.7 no.5 s.26
• /
• pp.7-12
• /
• 2004

Multi-path ultrasonic flowrate measuring technology is being received much attentions from a variety of industrial fields to exactly measure the flowrate. Multi-path ultrasonic flowmeter has much advantage since it has no moving parts and little pressure loss. It offers good accuracy, repeatability, linearity and turn-down ratio can be over 1:50. The present study investigates flowrate integration errors using weighting factors. A theoretical flow model uses power law to describe a fully developed velocity profiles and wall roughness is changed. Gaussian, Chebyshev, and Tailor methods are used to integrate line-average velocities. The obtained results show that Chebyshev method in 2, 4-path arrangement and Gaussian method in 3, 5-path arrangement are not affected for wall roughness changes.

• Journal of Biosystems Engineering
• /
• v.26 no.5
• /
• pp.415-422
• /
• 2001

A seedling pick-up device for vegetable transplanters was developed and its work performance was evaluated at the laboratory. The pick-up device extracts seedlings from a 200-cell tray of seedlings and transfers them to the place where they are to be transplanted into the soil. The device consists of a path generator, pick-up pins and a pin driver. The path generator is a five-bar mechanism comprised of a fixed link, a driving link, a driven link, a connecting link and a slider. The slider is constrained to move along the driven link and a fixed slot of combined straight-line and circular paths. The connecting link joins the driving link and the slider. When the slider moves along the straight-line path of the slot it takes seedlings out from the cell and transfers them to the transplanting hopper when moving along the circular path. A proto-type of the pick-up device was built and tested under the various operational conditions such as age of seedling, approach direction and penetration depth of pins to the cell, holding method of seedling and extracting velocity. The device extracted 30 seedlings per minute with the maximum success ratio of 97% using the seedlings of 23 days old. Some design details were also discussed and suggested to enhance the performance of the device.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.377-388
• /
• 2021

Owing to the difficulties associated with conducting millimeter-wave (mmWave) field measurements, especially in high-speed train (HST) environments, most propagation channels for mmWave HST have been studied using methods based on simulation rather than measurement. In this study, considering a linear cell layout in which base stations are installed along a railway, measurements were performed at 28 GHz with a speed up to 170 km/h in two prevalent HST scenarios: viaduct and tunnel scenarios. By observing the channel impulse responses, we could identify single- and double-bounced multipath components (MPCs) caused by railway static structures such as overhead line equipment. These MPCs affect the delay spread and Doppler characteristics significantly. Moreover, we observed distinct path loss behaviors for the two scenarios, although both are considered line-of-sight (LoS) scenarios. In the tunnel scenario, the path loss exponent (PLE) is 1.3 owing to the waveguide effect, which indicates that the path loss is almost constant with respect to distance. However, the LoS PLE in the viaduct scenario is 2.46, which is slightly higher than the free-space loss.

• Bulletin of the Korean Mathematical Society
• /
• v.59 no.1
• /
• pp.119-139
• /
• 2022

This paper deals with the λ-labeling and L(2, 1)-coloring of simple graphs. A λ-labeling of a graph G is any labeling of the vertices of G with different labels such that any two adjacent vertices receive labels which differ at least two. Also an L(2, 1)-coloring of G is any labeling of the vertices of G such that any two adjacent vertices receive labels which differ at least two and any two vertices with distance two receive distinct labels. Assume that a partial λ-labeling f is given in a graph G. A general question is whether f can be extended to a λ-labeling of G. We show that the extension is feasible if and only if a Hamiltonian path consistent with some distance constraints exists in the complement of G. Then we consider line graph of bipartite multigraphs and determine the minimum number of labels in L(2, 1)-coloring and λ-labeling of these graphs. In fact we obtain easily computable formulas for the path covering number and the maximum path of the complement of these graphs. We obtain a polynomial time algorithm which generates all Hamiltonian paths in the related graphs. A special case is the Cartesian product graph K_n☐K_n and the generation of λ-squares.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.11
• /
• pp.1837-1843
• /
• 1997

This study experimentally demonstrates the use of active muffler attached to the automotive exhaust system to reduce exhaust noise. For improving the signal to noise ratio in the process of estimation of secondary path transfer functions, the on-line algorithm that conventional inverse modeling is combined with adaptive line enhancer is used as the control algorithm. Active muffler is designed that the primary noise and the control sound are propagated as a plane wave in the outlet. Therefore, the error microphone could be placed out of the tail pipe center of a high temperature and the radiation noise to the outside could be reduced in the whole area around the outlet. The control experiment for reducing exhaust noise with active muffler is implemented during run-up at no load. From the experimental results presented, compared with the conventional off-line method, the proposed on-line method is capable to acquire a reduction of exhaust noise above 5 dB in overall sound power level.

• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1939-1944
• /
• 2003

This paper presents a global path planning algorithm based on a visibility graph method, and applies additionally various constraints for constructing the reduced visibility graph. The modification algorithm for generating the rounded path is applied to the globally shortest path of the visibility graph using the robot size constraint in order to avoid the obstacle. In order to check the visibility in given 3D map data, 3D CAD data with VRML format is projected to the 2D plane of the mobile robot, and the projected map is converted into an image for easy map analysis. The image processing are applied to this grid map for extracting the obstacles and the free space. Generally, the tree size of visibility graph is proportional to the factorial of the number of the corner points. In order to reduce the tree size and search the shortest path efficiently, the various constraints are proposed. After short paths that crosses the corner points of obstacles lists up, the shortest path among these paths is selected and it is modified to the combination of the line path and the arc path for the mobile robot to avoid the obstacles and follow the rounded path in the environment. The proposed path planning algorithm is applied to the mobile robot LCAR-III.

• Journal of Institute of Control, Robotics and Systems
• /
• v.17 no.4
• /
• pp.362-367
• /
• 2011

The collision-free path of a manipulator should be regenerated in the real time to achieve collision safety when obstacles or humans come into the workspace of the manipulator. A probabilistic roadmap (PRM) method, one of the popular path planning schemes for a manipulator, can find a collision-free path by connecting the start and goal poses through the roadmap constructed by drawing random nodes in the free configuration space. The path planning method based on the configuration space shows robust performance for static environments which can be converted into the off-line processing. However, since this method spends considerable time on converting dynamic obstacles into the configuration space, it is not appropriate for real-time generation of a collision-free path. On the other hand, the method based on the workspace can provide fast response even for dynamic environments because it does not need the conversion into the configuration space. In this paper, we propose an efficient real-time path planning by combining the PRM and the potential field methods to cope with static and dynamic environments. The PRM can generate a collision-free path and the potential field method can determine the configuration of the manipulator. A series of experiments show that the proposed path planning method can provide robust performance for various obstacles.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.832-842
• /
• 2020

The coordination control of multiple Underactuated Underwater Vehicles (UUVs) moving in three dimensional space is investigated in this paper. The coordinated path following control task is decomposed into two sub tasks, that is, path following control and coordination control. In the spatial curve path following control task, path following error dynamics is build in the Serret-Frenet coordinate frame. The virtual reference object can be chosen freely on the desired spatial path. Considering the speed of the UUV, the line-of-sight navigation is introduced to help the path following errors quickly converge to zero. In the coordination control sub task, the communication topology of multiple UUVs is described by the graph theory. The speed of each UUV is adjusted to achieve the coordination. The path following system and the coordination control system are viewed as the feedback connection system. Input-to-state stable of the coordinated path following system can be proved by small gain theorem. The simulation experiments can further demonstrate the good performance of the control method.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.8
• /
• pp.2473-2489
• /
• 2022

Urban development has brought about the increasing saturation of urban traffic demand, and traffic congestion has become the primary problem in transportation. Roads are in a state of waiting in line or even congestion, which seriously affects people's enthusiasm and efficiency of travel. This paper mainly studies the discrete domain path planning method based on the flow data. Taking the traffic flow data based on the highway network structure as the research object, this paper uses the deep learning theory technology to complete the path weight determination process, optimizes the path planning algorithm, realizes the vehicle path planning application for the expressway, and carries on the deployment operation in the highway company. The path topology is constructed to transform the actual road information into abstract space that the machine can understand. An appropriate data structure is used for storage, and a path topology based on the modeling background of expressway is constructed to realize the mutual mapping between the two. Experiments show that the proposed method can further reduce the interpolation error, and the interpolation error in the case of random missing is smaller than that in the other two missing modes. In order to improve the real-time performance of vehicle path planning, the association features are selected, the path weights are calculated comprehensively, and the traditional path planning algorithm structure is optimized. It is of great significance for the sustainable development of cities.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.9 no.1
• /
• pp.1-8
• /
• 2008

We propose how to program the off-line buffing robot path along shoes' outsole shape in the footwear buffing process by a 5-axis microscribe system like robot mechanism. The microscribe system we developed consists of a 5-axis robot link with a turn table, a signal processing unit, PC and an application software program. Itmakes a robot path on the shoes' upper in accordance with the movement of a microscribe with many joints. The developed system calculates the encoder pulse values for the microscribe arm's rotation and transmits the angle pulse values to the PC through a processing unit. Denavit-Hartenberg's(D-H) direct kinematics is used to make the global coordinate from microscribe joint one. Problems with the microscribe's kinematics can be solved efficiently and systematically by D-H representation. With the coordinate values calculated by D-H equation, our system can draw a buffing gauge-line on the upper sole. We obtain shoes' outline points, which are 2 outlines coupled with the points and the normal vector based on the points. By applying the system to the buffing robot in a flexible manufacturing system, it can be used effectively to program the path of a real buffing robot.