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

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

• Transactions of the Korean Society of Automotive Engineers
• /
• v.15 no.3
• /
• pp.1-9
• /
• 2007

A major concern for Autonomous Military Robot in the rough terrain is the problem of moving robot from an initial configuration to goal configuration. In this paper, We generate a local path to looking for the best route to move an goal configuration while avoiding known obstacle from world model, not violating the mobility constraints of robot. Trough a Simulator for Unmanned Autonomous Vehicle, We can simulate a traversability of unmanned autonomous vehicle based on steering, acceleration, braking command obtained from local path planning.

• ETRI Journal
• /
• v.15 no.3
• /
• pp.27-34
• /
• 1994

There have been traditional approaches to model radio propagation path loss mechanism both theoretically ad empirically. Theoretical approach is simple to explain and effective in certain cases. Empirical approach accommodates the terrain configuration and distance between base station and mobile unit along the propagation path only. In other words, it does not accommodate natural terrain configuration over a specific area. In this paper, we propose a spatial prediction technique for the mobile radio propagation path loss accommodating complete natural terrain configuration over a specific area. Statistical uncertainty analysis is also considered.

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

• Journal of Institute of Control, Robotics and Systems
• /
• v.21 no.3
• /
• pp.257-264
• /
• 2015

This paper proposes an adaptive RRT (Rapidly-exploring Random Tree) for path planning of high DOF multibody robotic system. For an efficient path planning in high-dimensional configuration space, the proposed algorithm adaptively selects the robot bodies depending on the complexity of path planning. Then, the RRT grows only using the DOFs corresponding with the selected bodies. Since the RRT is extended in the configuration space with adaptive dimensionality, the RRT can grow in the lower dimensional configuration space. Thus the adaptive RRT method executes a faster path planning and smaller DOF for a robot. We implement our algorithm for path planning of 19 DOF robot, AMIRO. The results from our simulations show that the adaptive RRT-based path planner is more efficient than the basic RRT-based path planner.

• Journal of the Korea Society for Simulation
• /
• v.13 no.4
• /
• pp.55-69
• /
• 2004

In MANET(Mobile Ad-hoc Network), unlike in wired networks, a path configuration should be in advance of data transmission along a routing path. Frequent movement of mobile nodes, however, makes it difficult to maintain the configured path and requires re-configuration of the path very often. It may also leads to serious problems such as deterioration of QoS in mobile ad-hoc networks. In this paper, we proposed a Reactive Routing Keyword (RRK) routing procedure to solve those problems. Firstly, we noticed it is possible in RRK routing to assign multiple routing paths to the destination node. We applied this feature into active networks and SNMP information based routing by storing unique keywords in cache of mobile nodes corresponding to present and candidate routings in a path configuration procedure. It was shown that the deterioration of QoS which may observed in Dynamic Source Routing(DSR) protocol was greatly mitigated by using the proposed routing technique.

• Journal of Information Processing Systems
• /
• v.16 no.6
• /
• pp.1324-1342
• /
• 2020

Various modified algorithms of rapidly-exploring random tree (RRT) have been previously proposed. However, compared to the RRT algorithm for collision avoidance with global and static obstacles, it is not easy to find a collision avoidance and local path re-planning algorithm for dynamic obstacles based on the RRT algorithm. In this study, we propose boundary-RRT*, a novel-algorithm that can be applied to aerial vehicles for collision avoidance and path re-planning in a three-dimensional environment. The algorithm not only bounds the configuration space, but it also includes an implicit bias for the bounded configuration space. Therefore, it can create a path with a natural curvature without defining a bias function. Furthermore, the exploring space is reduced to a half-torus by combining it with simple right-of-way rules. When defining the distance as a cost, the proposed algorithm through numerical analysis shows that the standard deviation (σ) approaches 0 as the number of samples per unit time increases and the length of epsilon ε (maximum length of an edge in the tree) decreases. This means that a stable waypoint list can be generated using the proposed algorithm. Therefore, by increasing real-time performance through simple calculation and the boundary of the configuration space, the algorithm proved to be suitable for collision avoidance of aerial vehicles and replanning of local paths.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 1997.10a
• /
• pp.519-522
• /
• 1997

In this study, the collision free path planning method of the articulated manipulator using sequential search is proposed. This method is to find the joint path of the manipulator with many degrees of freedom from the distal joint to the proximal one. To do this, the initial work space of the gantry manipulator, which is a remote maintenance equipment of the radioactive environment, is defined from the condition that the distal joint configuration is determined by the posture of maintenance. Then, 2-dimensional configuration space with the obstacle area is represented and the collision free path of manipulator is searched in the configuration space. And, this method is verified using the graphic simulation in virtual workcell for the spent fuel disassembling processes. The result of this study can be effectively used in implementing the maintenance processes for the hot cell equipment and enhance the reliability of the spent fuel management.

• Journal of the Korea Society for Simulation
• /
• v.12 no.1
• /
• pp.11-19
• /
• 2003

Dubins showed that any shortest path of a car-like robot consists of exactly three path segment which are either arcs of circles of radius r(denoted C), or straight line segments(denoted S). Possible six types classified into two families, i.e. CSC and CCC. CSC includes 2 types(LRL and RLR) and CSC includes 4 types(LSL, RSR, LSR, RSL). This paper proposes new formulae for CSC family to find the shortest smooth path between the initial and final configurations of a car-like robot. The formulae is used for finding connection points explicitly between C\longrightarrowS and S\longrightarrowC which are necessary for real applications. The formulae have simple forms mainly because they are transformed into origin of their original coordinates of initial and target configuration, and derived from a standard forms which are a representative configuration of LSL and LSR type respectively. The proposed formulae, which are derived from the standard forms, are simple and new method.