• Title/Summary/Keyword: Collision-free Path Space

Search Result 45, Processing Time 0.021 seconds

Delay Time Optimal Coordination Planning for Two Robot Systems

  • Lee, Ji-Hong;Nam, Heon-Seong;Joon Lyou
    • Journal of Electrical Engineering and information Science
    • /
    • v.2 no.3
    • /
    • pp.51-60
    • /
    • 1997
  • A practically applicable collision free trajectory planning technique for tow robot systems is proposed. The robot trajectories considered in this work are composed of many segments, an at the intersection points between segments robots stop to assemble, weld, ordo other jobs by the attached a end-effectors. The proposed method is based on the Planning-Coordination Decomposition where planning is to find a trajectory of each robot independently according to their tasks and coordination is to find a velocity modification profile to avoid collision with each other. To fully utilize the independently planned trajectories and to ensure no geometrical path deviation after coordination, we develop a simple technique added the minimal delay time to avoid collision just before moving along path segments. We determine the least delay time by the graphical method in the Coordination space where collisions and coordinations are easily visualized. We classify all possible cases into 3 group and derive the optimal solution for each group.

  • PDF

Minimum-Time Trajectory Planning Ensuring Collision-Free Motions for Two Robots with Geometric Path Constraints (공간상의 길이 주어진 두 대의 로보트를 위한 최소시간 충돌회피 경로 계획)

  • ;Zeung Nam Bien
    • Journal of the Korean Institute of Telematics and Electronics B
    • /
    • v.28B no.5
    • /
    • pp.357-368
    • /
    • 1991
  • Collision-free trajectory planning for two robots is considered. The two robot system handled in the paper is given specified geometric paths for two robots, and the task is repeating. Then, the robot dynamics is transformed as a function of the traveled lengths along the paths, and the bounds on acceleration and velocity are described in the phase plane be taking the constraints on torques and joint velocities into consideration. Collision avoidance and time optimality are considered simultaneously in the coordination space and the phase plane, respectively. The proof for the optimality of the proposed algorithm is given, and a simulation result is included to show the usefulness of the proposed method.

  • PDF

Development of Touch Probe Collision Avoidance Algorithm for OMM Using Offset Surface and Dynamic Error Compensation (OMM 에서 Offset Surface 를 이용한 접촉식 Probe 의 충돌회피 알고리즘 개발 및 동적 에러 보정)

  • 정석현;김동우;조명우;서태일
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 2004.10a
    • /
    • pp.323-326
    • /
    • 2004
  • In this study, the inspection path which is considered to free collision is generated by offset surface. When the inspection is executed, the consideration of machine dynamic error increases a precision. Dynamic error is measured on CNC machine bed changing of weight work price. Offset surface is safety space about collision. Because the danger of probe-collision is excluded in Offset surface, it is possible to rapid feed of probe and reduced inspection time. The Program which is possible to simulate using CAIP and is confirmed through actual experiment.

  • PDF

A Method of Path Planning for a Quadruped Walking Robot on Irregular Terrain (불규칙 지형에서 사가 보행 로보트의 경로 계획 방법)

  • ;Zeungnam Biem
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.43 no.2
    • /
    • pp.329-338
    • /
    • 1994
  • This paper presents a novel method of path planning for a quadruped walking robot on irregular terrain. In the previous study on the path planning problem of mobile robots, it has been usually focused on the collision-free path planning for wheeled robots. The path planning problem of legged roboth, however, has unique aspects from the point of viw that the legged robot can cross over the obstacles and the gait constraint should be considered in the process of planning a path. To resolve this unique problem systematically, a new concept of the artificial intensity field of light is numerically constructed over the configuration space of the robot including the transformed obstacles and a feasible path is sought in the field. Also, the efficiency of the proposed method is shown by various simulation results.

  • PDF

High-Speed Path Planning of a Mobile Robot Using Gradient Method with Topological Information (위상정보를 갖는 구배법에 기반한 이동로봇의 고속 경로계획)

  • Ham Jong-Gyu;Chung Woo-Jin;Song Jae-Bok
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.12 no.5
    • /
    • pp.444-449
    • /
    • 2006
  • Path planning is a key element in navigation of a mobile robot. Several algorithms such as a gradient method have been successfully implemented so for. Although the gradient method can provide the global optimal path, it computes the navigation function over the whole environment at all times, which result in high computational cost. This paper proposes a high-speed path planning scheme, called a gradient method with topological information, in which the search space for computation of a navigation function can be remarkably reduced by exploiting the characteristics of the topological information reflecting the topology of the navigation path. The computing time of the gradient method with topological information can therefore be significantly decreased without losing the global optimality. This reduced path update period allows the mobile robot to find a collision-free path even in the dynamic environment.

Performance Evaluation for Multi-Level Configuration Space for the Development of an Efficient Mobile Robot Path Planner (모바일 로봇을 위한 다단계 형태 공간 생성 방법에 대한 성능 검증)

  • Park, Jung-Soo;So, Byung-Chul;Jung, Jin-Woo
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.21 no.1
    • /
    • pp.36-41
    • /
    • 2011
  • Configuration space(C-space) including configuration obstacle(C-obstacle) is one of the most important concepts in mobile robot path planning. Using C-space and C-obstacles, the robot with different shapes and moving mechanisms can be considered as a point in the C-space. And, as a result, the collision-free path for the robot can be easily achieved. To make C-space including C-obstacle, many researchers used circular approximation method for the efficient caluculation time. This method can help us to save our time by approximating the shape of a robot as the minimum sized circle which can cover all the area of robot. But, by using the circle larger than the robot, more space are considered as the part of robot and, as a result, some obstacles which are very near each other may be considered as a combined one obstacle. To solve this problem, multi-level configuration space is proposed by this paper. This multi-level method also use the circular approximation method as the initial step. But, after finding the initial path, it will check how many obstacles are combined. And then, for each combined obstacle, more accurate C-space generation will be continued. To check the efficiency of the proposed algorithm, time for c-space generation are compared with the well-known accurate C-space generation method using various types of robot shape.

A Mathematical Approach to Time-Varying Obstacle Avoidance of Robot manipulators (로보트의 시변 장애물 회피를 위한 수학적 접근 방법)

  • 고낙용;이범희;고명삼
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.41 no.7
    • /
    • pp.809-822
    • /
    • 1992
  • A mathematical approach to solving the time-varying obstacle avoidance problem is pursued. The mathematical formulation of the problem is given in robot joint space(JS). View-time concept is used to deal with time-varying obstacles. The view-time is the period in which a time-varying obstacles. The view-time is the period in which a time-varying obstacle is viewed and approximated by an equivalent stationary obstacle. The equivalent stationary obstacle is the volume swept by the time-varying obstacle for the view-time. The swept volume is transformed into the JS obstacle that is the set of JS robot configurations causing the collision between the robot and the swept volume. In JS, the path avoiding the JS obstacle is planned, and a trajectory satisfying the constraints on robot motion planning is planned along the path. This method is applied to the collision-free motion planning of two SCARA robots, and the simulation results are given.

Local Collision Avoidance of Multiple Robots Using Avoidability Measure and Relative Distance

  • Ko, Nak-Yong;Seo, Dong-Jin;Kim, Koung-Suk
    • Journal of Mechanical Science and Technology
    • /
    • v.18 no.1
    • /
    • pp.132-144
    • /
    • 2004
  • This paper presents a new method driving multiple robots to their goal position without collision. To consider the movement of the robots in a work area, we adopt the concept of avoidability measure. The avoidability measure figures the degree of how easily a robot can avoid other robots considering the velocity of the robots. To implement the concept to avoid collision among multiple robots, relative distance between the robots is proposed. The relative distance is a virtual distance between robots indicating the threat of collision between the robots. Based on the relative distance, the method calculates repulsive force against a robot from the other robots. Also, attractive force toward the goal position is calculated in terms of the relative distance. These repulsive force and attractive force are added to form the driving force for robot motion. The proposed method is simulated for several cases. The results show that the proposed method steers robots to open space anticipating the approach of other robots. In contrast, since the usual potential field method initiates avoidance motion later than the proposed method, it sometimes fails preventing collision or causes hasty motion to avoid other robots. The proposed method works as a local collision-free motion coordination method in conjunction with higher level of task planning and path planning method for multiple robots to do a collaborative job.

Path Control of a Mobile Robot Using Fuzzy-Neural Hybrid System (퍼지.신경회로망을 이용한 자율주행 로봇의 경로제어)

  • Lee, B.R.;Lee, W.K.;Yi, H.C.
    • Journal of the Korean Society for Precision Engineering
    • /
    • v.12 no.8
    • /
    • pp.19-26
    • /
    • 1995
  • In this paper, a fuzzy-neural hybrid control approach is proposed for controlling a mobile robot that can avoid an unexpected obstacle in a navigational space. First, to describe the global structure of a known environment, a heuristic collision-free space band is introduced. Based on the band, the moving information in the known environment is trained to a neural controller. Then, during the execution of a mobile robot navigation moving information at each position is given the neural controller. If the mobile robot encounters an unexpected obstacle, a fuzzy controller activates to avoid the unexpected obstacle. Finally, some numerical examples are presented to demonstrate the control algorithm.

  • PDF

An Analysis about Amount of Students' Circulation based on the Flow Coefficients in Middle School managed by Variation Type (유동계수 산정에 기초한 교과교실형 운영 중학교 학생 동선이동량 분석)

  • Jeong, Joo-Seong
    • Journal of the Korean Institute of Educational Facilities
    • /
    • v.25 no.6
    • /
    • pp.21-28
    • /
    • 2018
  • To compare the physical quantity of students circulation along the moving path during recess of a variation type operation middle school, five points were actually observed. The flow coefficient for these points was calculated, and the change in flow coefficient was verified and tracked over time. During the operation of the classroom, the characteristics of crowdedness and congestion time depending on the physical conditions of the frequently moved paths were shown. Even in the same corridor, the difference between the flow coefficient and the congestion time of the corridor facing the open space and the blocked space was noticeably different. As a result, detailed factors such as free walking speed, the degree of freedom of passing and the possibility of collision were also identified. This means that detailed countermeasures for the student's path should be considered first when planning the moving space of a variation type school, and identifying the characteristics of these factors could be used as useful basic materials for developing various models of classroom space.