• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1996년도 추계학술대회 학술발표 논문집
• /
• pp.279-282
• /
• 1996

Collision avoidance is a method to direct a mobile robot without collision when traversing the environment. This kind of navigation is to reach a destination without getting lost. In this paper, we use a genetic algorithm for the path planning and collision avoidance. Genetic algorithm searches for path in the entire, continuous free space and unifies global path planning and local path planning. It is a efficient and effective method when compared with traditional collision avoidance algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1990년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 26-27 Oct. 1990
• /
• pp.1004-1008
• /
• 1990

This research focuses on developing a new and computationally efficient algorithm for free space structuring and planning collision free paths for an autonomous mobile robot working in an environment populated with polygonal obstacles. The algorithm constructs the available free space between obstacles in terms of free convex area. A collision free path can be efficiently generated based on a graph constructed using the midpoints of common free links between free convex area as passing points. These points correspond to nodes in a graph and the connection between them within each convex area as arcs in this graph. The complexity of the search for collision free path is greatly reduced by minimizing the size of the graph to be searched concerning the number of nodes and the number of arcs connecting them. The analysis of the proposed algorithm shows its efficiency in terms of computation ability, safety and optimality.

• 한국정밀공학회:학술대회논문집
• /
• 한국정밀공학회 1996년도 추계학술대회 논문집
• /
• pp.743-747
• /
• 1996

A Potential Field Method is applied to the proposed algorithm for the planning of collision-free paths of redundant manipulators. The planning is carried out on the base of kinematic configuration. To make repulsive potentials, sources are distributed on the boundaries of obstacles. To escape from local minimum of the main potential and to attack other difficulties of the planning, various potentials are defined simultaneously, Inverse Kinematics Problems of the redundant manipulators are solved by unconstrained optimization method. Computer simulation result of the path planning is presented.

• 대한산업공학회지
• /
• 제22권4호
• /
• pp.579-588
• /
• 1996

The purpose of this paper is to develop a method of Collision-Free Path Planning (CFPP) for an articulated robot. First, the configuration of the robot is built by a set of robot joint angles derived from robot inverse kinematics. The joint space, that is made of the joint angle set, forms a Configuration space (Cspcce). Obstacles in the robot workcell are also transformed into the Cobstacles using slice projection method. Actually the Cobstacles means the configurations of the robot causing collision with obstacles. Secondly, a connected graph, a kind of roadmap, is constructed by the free configurations in the Cspace, where the free configurations are randomly sampled from a free Cspace immune from the collision. Thirdly, robot paths are optimally determinant in the connected graph. A path searching algorithm based on $A^*$ is employed in determining the paths. Finally, the whole procedures for the CFPP method are shown for a proper articulated robot as an illustrative example.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2002년도 춘계학술대회 논문집
• /
• pp.184-189
• /
• 2002

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.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2001년도 춘계학술대회 논문집(한국공작기계학회)
• /
• pp.244-249
• /
• 2001

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.

• 한국공작기계학회:학술대회논문집
• /
• 한국공작기계학회 2000년도 추계학술대회논문집 - 한국공작기계학회
• /
• pp.113-118
• /
• 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.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1998년도 하계학술대회 논문집 G
• /
• pp.2318-2320
• /
• 1998

A genetic algorithm for global and local path planning and collision avoidance of mobil robot in unstructured workspace is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 1999년도 하계학술대회 논문집 G
• /
• pp.3098-3100
• /
• 1999

A genetic algorithm for global and local path planning and collision avoidance of mobile robot in dynamic working environment is proposed. The genetic algorithm searches for a path in the entire and continuous free space and unifies global path planning and local path planning. The simulation shows the proposed method is an efficient and effective method when compared with the traditional collision avoidance algorithms.

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

In this paper, we deal with a novel path planning algorithm to find collision-free path for a moving robot to find an appropriate path from initial position to goal position. The robot should make progress by avoiding obstacles located at unknown position. Such problem is called the path planning. We propose so called the subgoal generation algorithm to find an effective collision-free path. The generation and selection of the subgoal are the key point of this algorithm. Several subgoals, if necessary, are generated by analyzing the map information. The subgoal is the candidate for the final path to be pass through. Then selection algorithm is executed to choose appropriate subgoal to construct a correct path. Deep and through explanations are given for the proposed algorithm. Simulation example is given to show the effectiveness of the proposed algorithm.