• Journal of the Society of Naval Architects of Korea
• /
• v.58 no.2
• /
• pp.90-96
• /
• 2021

In this study, the method of determining the state of grid points in the adaptable surface particle method based on grid system developed as a free-surface tracing method was improved. The adaptable surface particle method is a method of determining the state of the grid point according to the shape of the free-surface and obtaining the intersection of the given free-surface and grid line where the state of the grid point changes. It is difficult to determine the state of grid points in the event of rapid flow, such as collision or separation of free-surfaces, and this study suggests a method for determining the state of current grid points using the state of surrounding grid points where the state of grid point are known. A grid layer value was assigned sequentially to a grid away from the free-surface, centering on the boundary cell where the free-surface exists, to identify the connection information that the grid was separated from the free-surface, and to determine the state of the grid point sequentially from a grid away from the free-surface to a grid close to the free-surface. To verify the improved method, a numerical analysis was made on the problem of dam break in which a sudden collision of free-surface occurred and the results were compared, and the results were relatively reasonable.

• Journal of the Society of Naval Architects of Korea
• /
• v.58 no.3
• /
• pp.191-197
• /
• 2021

This study addresses autonomous ship collision avoidance in narrow channels using curvilinear coordinates. Navigation in narrow channels or fairways is known to be much more difficult and challenging compared with navigation in the open sea. It is not straightforward to apply the existing collision avoidance framework designed for use in the open sea to collision avoidance in narrow channels due to the complexity of the problem. In this study, to generalize the autonomous navigation procedure for collision avoidance in narrow channels, we introduce a curvilinear coordinate system for collision-free path planning using a parametric curve, B-spline. To demonstrate the feasibility of the proposed algorithm, ship traffic simulations were performed and the results are presented.

• The Journal of Korea Robotics Society
• /
• v.19 no.3
• /
• pp.266-273
• /
• 2024

With the rising interaction between robots and humans, detecting collisions has become increasingly vital for ensuring safety. In this paper, we propose a novel approach for detecting collisions without using force torque sensors or tactile sensors, utilizing a Transformer-based neural network architecture. The proposed collision detection approach comprises a torque estimator network that predicts the joint torque in a free-motion state using Synchronous time-step encoding, and a collision discriminator network that predicts collisions by leveraging the difference between estimated and actual torques. The collision discriminator finally creates a binary tensor that predicts collisions frame by frame. In simulations, the proposed network exhibited enhanced collision detection performance relative to the other kinds of networks both in terms of prediction speed and accuracy. This underscores the benefits of using Transformer networks for collision detection tasks, where rapid decision-making is essential.

• The Journal of the Korea Contents Association
• /
• v.16 no.11
• /
• pp.83-90
• /
• 2016

In this paper, we performed the analysis of transmission performance for Collision Free Period(CFP) supported by the low-power communication technology, IEEE 802.15.4 MAC (Media Access Control). For the analysis, periodic traffic, original service target of CFP, is considered and, according to the Quality of Service required, packet arrival pattern to MAC layer is categorized as batch and non-batch, and analysis on throughput, delay, and energy is performed for those patterns. On the basis of the obtained analysis, performance comparison with Collision Avoidance Period(CAP) is carried out for the health care applications that generate periodic traffic such as Pedometer, ECG, EMG. The evaluation confirms that CFP is more energy efficient for healthcare applications that generate periodic and time-critical traffic and moreover for the application with high bandwidth requirement CFP achieves up to 46% energy savings compared to CAP.

• Proceedings of the KSME Conference
• /
• 2001.06c
• /
• pp.116-121
• /
• 2001

Verification of tool collision is an important issue in die and mold machining. In this paper three functions of verification are schematically explained based on Z-Map model. The first function is getting a collision-free region when a tool assembly and a part surface model are given. The second function estimates the shortest length of cutter shank with that the tool cuts all of a region without collision. The last one is cutting simulation considering all parts of tool assembly as well as cutter blade. Those functions can be easily implemented by using several basic operators of Z-Map model which are explained also. Proposed approaches have enough accuracy to verify collision in reasonable computing time.

• Journal of the Society of Naval Architects of Korea
• /
• v.54 no.1
• /
• pp.26-33
• /
• 2017

In this study, the surface marker method, one of the particle tracking methods, used to track the free surface is extended to cover the more general cases easily including the collision and separation of the free surface. In surface particle method to redistribute particles effectively using the grid system, the free surface is composed of the sum of quadrilaterals having four curves where fixed markers are placed at ends of each curve. Fixed markers are used to know how curves are connected to each other. The position of fixed markers can move as the free surface deforms but all fixed markers cannot be deleted during all time of simulation to keep informations of curve connection. In the case of the collision or separtion of the free surface where several curves can be intersected disorderly, severe difficulties can occur to define newly states of curve connection. In this study, the adaptable surface parTicle method without fixed markers is introduced. Intersection markers instead of the fixed markers are used to define quadrilaterals. The position of the intersection markers is defined to be the intersection point between the free surface and the edge of the grid and it can be added or deleted during the time of simulation to allow more flexibilities. To verify numerical schemes, two flow cases are simulated and the numerical results are compared with other's one and shown to be valid.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.17 no.9
• /
• pp.939-950
• /
• 1992

The performance of common spreading code scheme employing multiple-capture receiver is compared to that of transmitter-oriented (T/O) code division multiple access (CDMA) scheme in view of the possibility of collision-free transmissions and the effect of secondary multiple-access interference. For performance comparisons, secondary multiple-access interference is characterized for the common code scheme and the T/O CDMA scheme that assures perfectly collision-free transmissions. Throughput performance is then evaluated for these two schemes with direct-sequence spread-spectrum/differential-phase-shift-keying (DS-SS/DPSK) data modulation and forward-error-control coding (BCH codes) in the presence of an additive white Gaussian noise (AWGN). It is shown that when the number of radios is relatively large, the maximum normalized throughput is greater for the common code scheme than for the T/O CDMA scheme at a moderate signal-to-noise ration(SNR).

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.29B no.11
• /
• pp.36-45
• /
• 1992

A numerical trajectory planning method for path-constrained trajectory planning is proposed which ensures collision-free and time-optimal motions for two robotic manipulators with limited actuator torques and velocities. For each robot, physical constraints of the robots such as limited torques or limited rotational velocities of the actuators are converted to the constraints on velocity and acceleration along the path, which is described by a scalar variable denoting the traveled distance from starting point. Collision region is determined on the coordination space according to the kinematic structures and the geometry of the paths of the robots. An Extended Coordination Space is then constructed` an element of the space determines the postures and the velocities of the robots, and all the constraints described before are transformed to some constraints on the behaviour of the coordination-velocity curves in the space. A dynamic programming technique is them provided with on the discretized Extended Coordination Space to derive a collision-free and time-optimal trajectory pair. Numerical example is included.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10b
• /
• pp.996-1003
• /
• 1990

We present algebraic algorithms for collision-avoidance robot motion planning problems with planar geometric models. By decomposing the collision-free space into horizontal vertex visibility cells and connecting these cells into a connectivity graph, we represent the global topological structure of collision-free space. Using the C-space obstacle boundaries and this connectivity graph we generate exact (non-heuristic) compliant and gross motion paths of planar curved objects moving with a fixed orientation amidst similar obstacles. The gross motion planning algorithm is further extended (though using approximations) to the case of objects moving with both translational and rotational degrees of freedom by taking slices of the overall orientations into finite segments.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.28B no.5
• /
• pp.357-368
• /
• 1991

Collision-free trajectory planning for two robots is considered. The two robot system handled in the paper is given specified geometric paths for two robots, and the task is repeating. Then, the robot dynamics is transformed as a function of the traveled lengths along the paths, and the bounds on acceleration and velocity are described in the phase plane be taking the constraints on torques and joint velocities into consideration. Collision avoidance and time optimality are considered simultaneously in the coordination space and the phase plane, respectively. The proof for the optimality of the proposed algorithm is given, and a simulation result is included to show the usefulness of the proposed method.