• 한국항공우주학회지
• /
• 제36권10호
• /
• pp.996-1002
• /
• 2008

본 논문에서는 3차원 일대일 충돌 감지, 충돌 회피 및 경로점 유도를 위한 알고리듬에 대해 다룬다. 항공기는 질점 모델로 가정하였다. 충돌 감지는 최근접점까지 남은 시간과 그 때의 거리를 기준 값과 비교하여 수행하였다. 충돌 회피는 최적 제어 이론을 이용하여 최종 시간에서의 상대 거리를 최대화하는 가속도 입력을 계산하여 수행하였다. 경로점 유도는 잘 알려진 비례항법유도를 적용하였다. 제안된 알고리듬의 성능은 두 개의 시나리오를 통하여 검증하였다.

• International Journal of Aeronautical and Space Sciences
• /
• 제9권2호
• /
• pp.1-8
• /
• 2008

This paper presents a real-time algorithm for collision detection, collision avoidance and guidance. Three-dimensional point-mass aircraft models are used. For collision detection, conflict probability is calculated by using the Monte-Carlo Simulation. Time at the closest point of approach(CPA) and distance at CPA are needed to determine the collision probability, being compared to certain threshold values. For collision avoidance, one of possible maneuver options is chosen to minimize the collision probability. For guidance to a designated way-point, proportional navigation guidance law is used. Two scenarios on encounter situation are studied to demonstrate the performance of proposed algorithm.

• 소음진동
• /
• 제10권3호
• /
• pp.474-479
• /
• 2000

Piston slap is not only one of the major sources of noise and vibration in internal combustion engines but also a cause of the deterioration of engine performance. The basic mechanism associated with the piston slap seems to be quite simple but the phenomenon is in fact complicated with regard to many mechanical elements associated, First of all the impact force of piston slap must be identified to estimate engine block surface vibration, In this paper model of collision point is proposed to calculate the impact force when slap surface vibration. In this paper model of collision point is proposed to calculate the impact force when slap occurs. The parameters of the model are estimated by employing the concept of point mobility, . The predicted and experimentally observed vibration results confirm that the proposed method is practically useful.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1996년도 한국자동제어학술회의논문집(국내학술편); 포항공과대학교, 포항; 24-26 Oct. 1996
• /
• 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.

• 대한기계학회논문집A
• /
• 제21권12호
• /
• pp.1992-2007
• /
• 1997

A new algorithm for planning a collision-free path is developed based on linear prametric curve. In this paper robot is assumed to a point, and two linear parametric curve is used to construct a path connecting start and goal point, in which single intermediate connection point between start and goal point is considered. The intermediate connection point is set in polar coordinate(${\theta}{\delta}$) , and the interference between path and obstacle is mapped into CPS(connection point space), which is defined a CWS GM(circular work space geometry mapping). GM of all obstacles in workspace creates overlapping images of obstacle in CPS(Connection Point Space). The GM for all obstacles produces overlapping images of obstacle in CPS. The empty area of CPS that is not occupied by obstacle images represents collision-free paths in Euclidian Space. A GM based on connection point in elliptic coordinate(${\theta}{\delta}$) is also developed in that the total length of path is depend only on the variable .delta.. Hence in EWS GM(elliptic work space geometry mapping), increasing .delta. and finding the value of .delta. for collision-free path, the shortest path can be searched without carring out whole GM. The GM of obstacles expersses all possible collision-free path as empty spaces in CPS. If there is no empty space available in CPS, it indicates that path planning is not possible with given number of connection points, i.e. path planning is failed, and it is necessary to increase the number of connection point. A general case collision-free path planning is possible by appling GM to configuration space obstacles. Simulation of GM of obstacles in Euclidian space is carried out to measure performance of algorithm and the resulting obstacle images are reported.

• Journal of Mechanical Science and Technology
• /
• 제18권1호
• /
• pp.92-105
• /
• 2004

A new algorithm for planning a collision-free path based on algebraic curve is developed and the concept of collision-free Path Space (PS) is introduced. This paper presents a Geometry Mapping (GM) based on two straight curves in which the intermediate connection point is organized in elliptic locus ($\delta$, $\theta$). The GM produces two-dimensional PS that is used to create the shortest collision-free path. The elliptic locus of intermediate connection point has a special property in that the total distance between the focus points through a point on ellipse is the same regardless of the location of the intermediate connection point on the ellipse. Since the radial distance, a, represents the total length of the path, the collision-free path can be found as the GM proceeds from $\delta$=0 (the direct path) to $\delta$=$\delta$$\_$max/(the longest path) resulting in the minimum time search. The GM of elliptic workspace (EWS) requires calculation of interference in circumferential direction only. The procedure for GM includes categorization of obstacles to .educe necessary calculation. A GM based on rectangular workspace (RWS) using Cartesian coordinate is also considered to show yet another possible GM. The transformations of PS among Circular Workspace Geometry Mapping (CWS GM) , Elliptic Workspace Geometry Mapping (EWS GM) , and Rectangular Workspace Geometry Mapping (RWS GM), are also considered. The simulations for the EWS GM on various computer systems are carried out to measure performance of algorithm and the results are presented.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1544-1549
• /
• 2004

A new collision avoidance algorithm is presented for two mobile robots in narrow corridor environments. When two robots meet each other in a narrow corridor, one should yield the way to the other robot. To solve the problem arising in this situation, they exchange their path to get information about crossing-points to check avoidance conditions, which are necessary for choosing the robot to yield. The conditions are summarized as follows. 1) If one robot blocks the path to the closest crossing-point in front of the other robot. 2) If the closest crossing-point of each robot is the same point. 3) Which robot is closer to the closest crossing-point. In this paper, we propose a path planning algorithm for the robot which yield the way. Simulation results are presented to verify the feasibility of the proposed collision avoidance algorithm.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제12권1호
• /
• pp.541-551
• /
• 2020

Based on the trend, there have been numerous researches analysing the ship collision risk. However, in this scope, the navigational conditions and external environment are ignored or incompletely considered in training or/and real situation. It has been identified as a significant limitation in the navigational collision risk assessment. Therefore, a novel algorithm of the ship navigational collision risk solving system has been proposed based on basic collision risk and vulnerabilities of marine accidents. The vulnerability can increase the possibility of marine collision accidents. The factors of vulnerabilities including bad weather, tidal currents, accidents prone area, traffic congestion, operator fatigue and fishing boat operating area are involved in the fuzzy reasoning engines to evaluate the navigational conditions and environment. Fuzzy logic is employed to reason basic collision risk using Distance to Closest Point of Approach (DCPA) and Time of Closest Point of Approach (TCPA) and the degree of vulnerability in the specific coastal waterways. Analytical Hierarchy Process (AHP) method is used to obtain the integration of vulnerabilities. In this paper, vulnerability factors have been proposed to improve the collision risk assessment especially for non-SOLAS ships such as coastal operating ships and fishing vessels in practice. Simulation is implemented to validate the practicability of the designed navigational collision risk solving system.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 2003년도 춘계학술대회 논문집
• /
• pp.992-995
• /
• 2003

A haptic device operated by the user's hand can receive information on position and orientation of the hand and display force and moment generated in the virtual environment to the hand. For realistic haptic display, the detailed information on collision between objects is necessary. In the past, the point-based graphic environment has been used in which the end effector of a haptic device was represented as a point and the interaction of this point with the virtual environment was investigated. In this paper, the shape-based graphic environment is proposed in which the interaction of the shape with the environment is considered to analyze collision or contact more accurately. To this end. the so-called Gilbert-Johnson-Keerthi (GJK) algorithm is adopted to compute collision points and collision instants between two shapes in the 3-D space. The 5- DOF haptic hand controller is used with the GJK algorithm to demonstrate a peg-in-hole operation in the virtual environment in conjunction with a haptic device. It is shown from various experiments that the shape-based representation with the GJK algorithm can provide more realistic haptic display for peg-in-hole operations.

• International Journal of Naval Architecture and Ocean Engineering
• /
• 제5권2호
• /
• pp.188-198
• /
• 2013

In constructing a collision avoidance system, it is important to determine the time for starting collision avoidance maneuver. Many researchers have attempted to formulate various indices by applying a range of techniques. Among these indices, collision risk obtained by combining Distance to the Closest Point of Approach (DCPA) and Time to the Closest Point of Approach (TCPA) information with fuzzy theory is mostly used. However, the collision risk has a limit, in that membership functions of DCPA and TCPA are empirically determined. In addition, the collision risk is not able to consider several critical collision conditions where the target ship fails to take appropriate actions. It is therefore necessary to design a new concept based on logical approaches. In this paper, a collision ratio is proposed, which is the expected ratio of unavoidable paths to total paths under suitably characterized operation conditions. Total paths are determined by considering categories such as action space and methodology of avoidance. The International Regulations for Preventing Collisions at Sea (1972) and collision avoidance rules (2001) are considered to solve the slower ship's dilemma. Different methods which are based on a constant speed model and simulated speed model are used to calculate the relative positions between own ship and target ship. In the simulated speed model, fuzzy control is applied to determination of command rudder angle. At various encounter situations, the time histories of the collision ratio based on the simulated speed model are compared with those based on the constant speed model.