• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.759-762
• /
• 1991

In this paper an algorithm is presented which serves for collision avoidance between robots with working space. The method is based on the concept of a hierarchical coordinator and permits an on-line application. Computing possible collision points a collision_free trajectory for the robot with no right_of_way precedence is generated. The computations are based on the states of the robots concerned including their practicable accelerations and velocities.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.417-422
• /
• 1993

Robots working in the multiple robot system can perform the variety of tasks compared to the single robot system, while they are subject to the various tight constraints such as the precise coordination and the mutual collision avoidance during the task execution. In this paper, we provide an algorithm and graphical verification for collision avoidance between two robots working together. The algorithm calculates the minimum time delay for collision avoidance and the graphical verification is performed through the 3-D graphic simulator.

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

Iterative algorithms for detecting the collision of convex objects whose motion is characterized by a path in configuration space are described. They use as an essential substep the computation of the distance between the two objects. When the objects are polytopes in either two or three dimensional space, an algorithm is given which terminates in a finite number of iterations. It determines either that no collision occurs or the first collision point on the path. Extensive numerical experiments for practical problems show that the computational time is short and grows only linearly in the total number of vertices of the two polytopes.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.896-899
• /
• 1996

A new algorithm for planning a collision free path is developed based on linear parametric curve. A collision-free path is viewed as a connected space curve in which the path consists of two straight curve connecting start to target point. A single intermediate connection point is considered in this paper and is used to manipulate the shape of path by organizing the control point in polar coordinate (.theta.,.rho.). The algorithm checks interference with obstacles, defined as GM (Geometry Mapping), and maps obstacles in Euclidean Space into images in CPS (Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The clear area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidean Space. Any points from the clear area of CPS is a candidate for a collision-free path. A simulation of GM for number of cases are carried out and results are presented including mapped images of GM and performances of algorithm.

• Journal of Astronomy and Space Sciences
• /
• v.30 no.1
• /
• pp.11-15
• /
• 2013

A collision-free formation reconfiguration trajectory subject to the linearized Hill's dynamics of relative motion is analytically developed by extending an algorithm for gravity-free space. Based on the initial solution without collision avoidance constraints, the final solution to minimize the designated performance index and avoid collision is found, based on a gradient method. Simple simulations confirm that satellites reconfigure their positions along the safe trajectories, while trying to spend minimum energies. The algorithm is applicable to wide range of formation flying under the Hill's dynamics.

• International Journal of Aeronautical and Space Sciences
• /
• v.11 no.4
• /
• pp.351-359
• /
• 2010

This paper proposes a linear system control algorithm with collision avoidance in multiple satellites. Consideration of collision avoidance is augmented by adding a weighting term in the cost function of the original tracking problem in linear quadratic control (LQC). Because the proposed algorithm relies on a similar solution procedure to the original LQC, its inherent advantages, including gain-robustness and optimality, are preserved. To confirm and visualize the derived algorithm, a simple example of two-vehicle motion in the two-dimensional plane is illustrated. In addition, the proposed collision avoidance control is applied to satellite formation flying, and verified by numerical simulations.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2004.04a
• /
• pp.129-134
• /
• 2004

Author presented some study with a title of "automatic control for ship collision avoidance system" in previous papers. The paper reported the tread of the study, un-sloved issues and outcome of the study. In this paper, some additional results will be reported. The first is the algorithm of avoidance of group ship that is one of the un-sloved issues. The algorithm is useful when a ship takes an avoiding action toward group fish boats and approaching group merchant vessel. The second is unified model for calculating ship collision risk. The collision risk changes with various meet type of ships. Therefor newly-developed model is suggested to take into account of these situations. Finally simulation is carried out to verify suggested algorithm and model in various ship encounter situations..

• Proceedings of the IEEK Conference
• /
• 2007.07a
• /
• pp.29-30
• /
• 2007

In this paper, we propose Group Separation(GS) algorithm for RFID tag recognition. In GS algorithm, reader calculates tag ID by collision point, stores memory with the collision table. And reader classifies according to total number of tag ID's 1, requests each group. If tag comes into collision with the other tag, reader searches tag ID in collision table. As a result, we observes that transmitted data rate, the recognition time is decreased.

• Proceedings of the KSR Conference
• /
• 2002.10a
• /
• pp.471-477
• /
• 2002

In this paper, it is proposed instruction code satisfied algorithm that is able to prevent data collision when transponder access in the area of recognition system that is operated to single channel. Differ from absolute collision is used to in the time domain procedure, instruction code satisfied algorithm, transmits data which don't generate collision and must satisfy instruction code. So, to prevent data collision, transponder is of great if it read the entire instruction code. Consequently, it is applied to algorithm that made the system of wireless recognition13.56 Mhz. As a result, for the time of one bit data transmission had 14${\mu}$s difference, it is proved the prevention of data loss in experiment.

• Proceedings of the IEEK Conference
• /
• 2003.07a
• /
• pp.49-52
• /
• 2003

IEEE 802.11 MAC uses a distributed coordination function (DCF) known as carrier sense multiple access with collision avoidance (CSMA/CA) for medium access. Random back-off algorithm helps to avoid the collision. This paper proposes virtual back-off and modified back-off algorithm for reduce a waiting time by back-off and reduce the collision. The modified DCF is consisted of these two algorithms. We expect to reduce the average waiting time of each transmission by using the modified DCF algorithm.