• 제어로봇시스템학회논문지
• /
• 제17권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 Control, Automation, and Systems
• /
• 제2권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.

• 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.

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

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2000년도 춘계학술대회논문집 - 한국공작기계학회
• /
• pp.176-181
• /
• 2000

Collision free task planning for dual-arm robot which perform many subtasks in a common work space can be achieved in two steps : path planning and trajectory planning. path planning finds the order of tasks for each robot to minimize path lengths as well as to avoid collision with static obstacles. A trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position or reduce speed at the middle of its path to avoid collision with the other robot.

• ETRI Journal
• /
• 제43권4호
• /
• pp.580-593
• /
• 2021

When operating in confined spaces or near obstacles, collision-free path planning is an essential requirement for autonomous exploration in unknown environments. This study presents an autonomous exploration technique using a carefully designed collision-free local planner. Using LiDAR range measurements, a local end-point selection method is designed, and the path is generated from the current position to the selected end-point. The generated path showed the consistent collision-free path in real-time by adopting the Euclidean signed distance field-based grid-search method. The results consistently demonstrated the safety and reliability of the proposed path-planning method. Real-world experiments are conducted in three different mines, demonstrating successful autonomous exploration flights in environment with various structural conditions. The results showed the high capability of the proposed flight autonomy framework for lightweight aerial robot systems. In addition, our drone performed an autonomous mission in the tunnel circuit competition (Phase 1) of the DARPA Subterranean Challenge.

• 대한산업공학회지
• /
• 제22권3호
• /
• pp.499-515
• /
• 1996

The basic function of on industrial robot system is to move objects in the workspace fast and accurately. One difficulty in performing this function is that the path of robot should be programmed to avoid the collision with obstacles, that is, tools, or facilities. This path planning requires much off-line programming time. In this study, a SOM technique to find the collision-free path of robot in real time is developed. That is, the collision-free map is obtained through SOM learning and a collision-free path is found using the map in real time during the robot operation. A learning procedure to obtain the map and an algorithm to find a short path using the map is developed and simulated. Finally, a path smoothing method to stabilize the motion of robot is suggested.

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

In this paper, we propose an efficient collision-free path planning method of two cooperating robot manipulators grasping a common object rigidly. For given two robots and an object, the procedure is described which constructs the reduced dimensional configuration space by the kinematic analysis of two cooperating robot manipulators. A path planning algorithm without explicit representation of configuration obstacles is also described. The primary steps of the algorithm is as follows. First, we compute a graph which represents the skeleton of the free configuration space. Second, a connection between an initial and a goal configuration to the graph is searched to find a collision-free path.

• 한국자동차공학회논문집
• /
• 제2권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.