• Journal of Space Technology and Applications
• /
• v.3 no.3
• /
• pp.280-300
• /
• 2023

This paper includes the development and operational status of the space object collision risk management system operated by the Korea Aerospace Research Institute. Currently, it monitors 6 low-orbit satellites and 3 geostationary satellites for collision risks 24 hours, enabling prompt collision avoidance maneuvers to ensure safe and stable operations. Since Chinese anti-satellite test (ASAT) in 2007, the monitoring of collision risks between space objects and operational satellites has been taken seriously, leading to the development of various collision risk management systems to respond quickly and efficiently to such situations. This paper provides an introduction to the space object collision risk management system developed from 2007 to the present, the current status of artificial space objects around Earth, and the system currently in operation. Additionally, it outlines future prospects and plans for the system.

• Journal of Astronomy and Space Sciences
• /
• v.29 no.1
• /
• pp.11-21
• /
• 2012

In this paper, the authors introduced a new approach to find the optimal collision avoidance maneuver considering multi threatening objects within short period, while satisfying constraints on the fuel limit and the acceptable collision probability. A preliminary effort in applying a genetic algorithm (GA) to those kinds of problems has also been demonstrated through a simulation study with a simple case problem and various fitness functions. And then, GA is applied to the complex case problem including multi-threatening objects. Two distinct collision avoidance maneuvers are dealt with: the first is in-track direction of collision avoidance maneuver. The second considers radial, in-track, cross-track direction maneuver. The results show that the first case violates the collision probability threshold, while the second case does not violate the threshold with satisfaction of all conditions. Various factors for analyzing and planning the optimal collision avoidance maneuver are also presented.

• The Journal of Korea Robotics Society
• /
• v.17 no.1
• /
• pp.32-39
• /
• 2022

Since the mobile platform and the manipulator mounted on it move at the same time in a mobile manipulator, the risk of mutual collision increases. Most of the studies on collision avoidance of mobile manipulators cannot be applied to differential drive type mobile platforms or the end-effector tends to deviate from the desired trajectory for collision avoidance. In this study, a collision avoidance algorithm based on null space projection (CANS) that solves these two problems is proposed. To this end, a modified repulsive force that overcomes the non-holonomic constraints of a mobile platform is generated by adding a virtual repulsive force in the direction of its instantaneous velocity. And by converting this repulsive force into a repulsive velocity and applying it to the null space, the end-effector of the robot avoids a collision while moving along its original trajectory. The proposed CANS algorithm showed excellent performance through self-collision avoidance tests and door opening tests.

• Journal of Space Technology and Applications
• /
• v.2 no.1
• /
• pp.13-29
• /
• 2022

Recently, the number of space objects around the Earth has increased rapidly, necessitating systematic space risk management. This paper proposes a dual-mode framework for assessing the risk of collision between space objects. The proposed framework consists of microscopic and macroscopic modes. The former focuses on one-to-one collision events, and the latter assesses the overall collision risk inside a cell located in space. Two risk assessment case studies using the proposed two modes demonstrate the effectiveness of the proposed framework.

• International Journal of Control, Automation, and Systems
• /
• v.2 no.1
• /
• pp.107-117
• /
• 2004

A new algorithm for planning a collision-free path based on an algebraic curve as well as the concept of path space is developed. Robot path planning has so far been concerned with generating a single collision-free path connecting two specified points in a given robot workspace with appropriate constraints. In this paper, a novel concept of path space (PS) is introduced. A PS is a set of points that represent a connection between two points in Euclidean metric space. A geometry mapping (GM) for the systematic construction of path space is also developed. A GM based on the 2$^{nd}$ order base curve, specifically Bezier curve of order two is investigated for the construction of PS and for collision-free path planning. The Bezier curve of order two consists of three vertices that are the start, S, the goal, G, and the middle vertex. The middle vertex is used to control the shape of the curve, and the origin of the local coordinate (p, $\theta$) is set at the centre of S and G. The extreme locus of the base curve should cover the entire area of actual workspace (AWS). The area defined by the extreme locus of the path is defined as quadratic workspace (QWS). The interference of the path with obstacles creates images in the PS. The clear areas of the PS that are not mapped by obstacle images identify collision-free paths. Hence, the PS approach converts path planning in Euclidean space into a point selection problem in path space. This also makes it possible to impose additional constraints such as determining the shortest path or the safest path in the search of the collision-free path. The QWS GM algorithm is implemented on various computer systems. Simulations are carried out to measure performance of the algorithm and show the execution time in the range of 0.0008 ~ 0.0014 sec.

• 제어로봇시스템학회:학술대회논문집
• /
• 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 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.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.2
• /
• pp.156-163
• /
• 2013

Collision probability is the most common method to measure the risk of space debris, it is widely used that two dimensional linear collision probability using the closest approach distance. This paper represents the characteristics of object that approach KOMPSAT 2, 3, 5 that have operated or will be operated by Korea. And more precise method than two dimensional linear collision probability, we analyzed the properties of three dimensional nonlinear collision probability using STK/Nonlinear Collision Probability Tool. Through this, efficiency of three dimensional nonlinear collision probability for KOMPSAT series satellites was investigated. The result represents that three dimensional nonlinear collision probability showed the precise outcome at a relative velocity of less than 350m/s. Also, KOMPSAT series satellites appeared to few low relative velocity approaches and showed low efficiency for the three dimensional nonlinear collision probability.

• Transactions of the Korean Society of Automotive Engineers
• /
• v.2 no.6
• /
• pp.57-65
• /
• 1994

A collision-free path planning algorithm between an articulated robot and polyhedral obstacles using configuration space is presented. In configuration space, a robot is treated as a point and obstacles are treated as grown forbidden regions. Hence path planning problem is transformed into moving a point from start position to goal position without entering forbidden regions. For mapping to 3D joint space, slice projection method is used for first revolute joint and inverse kinematics is used for second and third revolute joint considering kinematic characteristics of industrial robot. Also, three projected 2D joint spaces are used in search of collision-free path. A proper example is provided to illustrate the proposed algorithm.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.21 no.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.