• 제목/요약/키워드: Robot Motion Planning

검색결과 197건 처리시간 0.035초

허리 구조를 갖는 복합 바퀴-다리 이동형 로봇의 설계 (Design of Hybrid Wheeled and Legged Mobile Robot with a Waist Joint)

  • 최대규;정동혁;김용태
    • 한국지능시스템학회논문지
    • /
    • 제24권3호
    • /
    • pp.304-309
    • /
    • 2014
  • 본 논문에서는 허리 구조를 갖는 복합 바퀴-다리 이동형 로봇의 설계 방법을 제안한다. 제안된 복합 이동형 로봇은 비평탄 및 평탄 지형에서의 효과적인 이동을 위하여 로봇의 다리에 바퀴가 결합된 복합 바퀴-다리 구조와 로봇 주행 중 보행 자세로의 안정적인 전환과 비평탄 지형에서 기구적인 제한의 개선을 위하여 허리 관절을 갖는 구조로 설계하였다. 또한 다양한 지형을 인지하기 위하여 LRF센서, PSD센서, CCD 카메라를 사용하였다. 제안한 로봇 시스템의 검증을 위해 지형별 주행과 보행 자세를 선택할 수 있는 운동 계획 기법을 제안하였다. 실제 복합 바퀴-다리 이동형 로봇을 설계 및 제작하고, 제안된 운동계획을 사용한 실험을 통해 지형에 따른 효율적인 이동 성능을 검증하였다.

Development of Potential Function Based Path Planning Algorithm for Mobile Robot

  • Lee, Sang-Il;Kim, Myun-Hee;Oh, Kwang-Seuk;Lee, Sang-Ryong
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.2325-2330
    • /
    • 2005
  • A potential field method for solving the problem of path planning based on global and local information for a mobile robot moving among a set of stationary obstacles is described. The concept of various method used path planning is used design a planning strategy. A real human living area is constructed by many moving and imminence obstacles. Home service mobile robot must avoid many obstacles instantly. A path that safe and attraction towards the goal is chosen. The potential function depends on distance from the goal and heuristic function relies on surrounding environments. Three additional combined methods are proposed to apply to human living area, calibration robots position by measured surrounding environment and adapted home service robots. In this work, we proposed the application of various path planning theory to real area, human living. First, we consider potential field method. Potential field method is attractive method, but that method has great problem called local minimum. So we proposed intermediate point in real area. Intermediate point was set in doorframe and between walls there is connect other room or other area. Intermediate point is very efficiency in computing path. That point is able to smaller area, area divided by intermediate point line. The important idea is intermediate point is permanent point until destruction house or apartment house. Second step is move robot with sensing on front of mobile robot. With sensing, mobile robot recognize obstacle and judge moving obstacle. If mobile robot is reach the intermediate point, robot sensing the surround of point. Mobile robot has data about intermediate point, so mobile robot is able to calibration robots position and direction. Third, we gave uncertainty to robot and obstacles. Because, mobile robot was motion and sensing ability is not enough to control. Robot and obstacle have uncertainty. So, mobile robot planed safe path planning to collision free. Finally, escape local minimum, that has possibility occur robot do not work. Local minimum problem solved by virtual obstacle method. Next is some supposition in real living area.

  • PDF

컨베이어 추적을 위한 로보트 매니퓰레이터의 동작 계획 (Motion planning of a robot manipulator for conveyor tracking)

  • 박태형;이범희;고명삼
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
    • /
    • pp.154-159
    • /
    • 1989
  • This paper presents a motion planning algorithm for conveyor tracking. We formulate the problem as the linear quadratic tracking problem in optimal control theory and solve it through dynamic programming. In the proposed algorithm, the steady-state tracking error is eliminated completely, and the joint torque, velocity, acceleration, and jerks are considered as some constraints. Numerical examples are then presented to demonstrate the utility of the proposed motion planning algorithm.

  • PDF

형상 공간을 이용한 다관절 로보트의 충돌 회피 경로 계획 (Collision-Free Path Planning of Articulated Robot using Configuration Space)

  • 김정훈;최진섭;강희용;김동원;양성모
    • 한국자동차공학회논문집
    • /
    • 제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.

  • PDF

'관측 시간'개념을 이용한 로보트의 시변 장애물 회피 동작 계획 (Robot motion planning for time-varying obstacle avoidance using view-time concept)

  • 고낙용;이범희;고명삼;남윤석
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 22-24 Oct. 1991
    • /
    • pp.1040-1045
    • /
    • 1991
  • An approach to time-varying obstacle avoidance problem is pursued. The mathematical formulation of the problem is given in Cartesian space and in joint space. To deal with the time-varying obstacles, view-time is introduced. A view-time is the time interval viewing the time-varying obstacles to model equivalent stationary obstacles. For the analysis of the properties of the view-time, avoidability measure is defined as a measure of easiness for a robot to avoid obstacles. Based on the properties, a motion planning strategy to avoid time-varying obstacles is derived. An application of the strategy to the collision-free motion planning of two SCARA robots and the simulation on the application are given.

  • PDF

Adaptive RRT를 사용한 고 자유도 다물체 로봇 시스템의 효율적인 경로계획 (Efficient Path Planning of a High DOF Multibody Robotic System using Adaptive RRT)

  • 김동형;최윤성;염서군;라로평;이지영;한창수
    • 제어로봇시스템학회논문지
    • /
    • 제21권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.

이족 휴머노이드 로봇의 유연한 보행을 위한 학습기반 뉴로-퍼지시스템의 응용 (Use of Learning Based Neuro-fuzzy System for Flexible Walking of Biped Humanoid Robot)

  • 김동원;강태구;황상현;박귀태
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2006년 학술대회 논문집 정보 및 제어부문
    • /
    • pp.539-541
    • /
    • 2006
  • Biped locomotion is a popular research area in robotics due to the high adaptability of a walking robot in an unstructured environment. When attempting to automate the motion planning process for a biped walking robot, one of the main issues is assurance of dynamic stability of motion. This can be categorized into three general groups: body stability, body path stability, and gait stability. A zero moment point (ZMP), a point where the total forces and moments acting on the robot are zero, is usually employed as a basic component for dynamically stable motion. In this rarer, learning based neuro-fuzzy systems have been developed and applied to model ZMP trajectory of a biped walking robot. As a result, we can provide more improved insight into physical walking mechanisms.

  • PDF

Local Minimum Free Motion Planning for Mobile Robots within Dynamic Environmetns

  • Choi, Jong-Suk;Kim, Mun-Sang;Lee, Chong-Won
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2003년도 ICCAS
    • /
    • pp.1921-1926
    • /
    • 2003
  • We build a local minimum free motion planning for mobile robots considering dynamic environments by simple sensor fusion assuming that there are unknown obstacles which can be detected only partially at a time by proximity sensors and can be cleaned up or moved slowly (dynamic environments). Potential field is used as a basic platform for the motion planning. To clear local minimum problem, the partial information on the obstacles should be memorized and integrated effectively. Sets of linked line segments (SLLS) are proposed as the integration method. Then robot's target point is replaced by virtual target considering the integrated sensing information. As for the main proximity sensors, we use laser slit emission and simple web camera since the system gives more continuous data information. Also, we use ultrasonic sensors as the auxiliary sensors for simple sensor fusion considering the advantages in that they give exact information about the presence of any obstacle within certain range. By using this sensor fusion, the dynamic environments can be dealt easily. The performance of our algorithm is validated via simulations and experiments.

  • PDF

지면에 고정되어 있지 않은 여유자유도 매니플래이터의 운동계획 알고리즘 (Motion Planning Algorithms for Kinematically Redundant Manipulator Not Fixed to the Ground)

  • 유동수;소병록;김희국
    • 제어로봇시스템학회논문지
    • /
    • 제10권10호
    • /
    • pp.869-877
    • /
    • 2004
  • This paper deals with motion planning algorithm for kinematically redundant manipulators that are not fixed to the ground. Differently from usual redundant manipulators fixed to the ground, the stability issue should be taken into account to prevent the robot from falling down. The typical ZMP equation, which is employed in human walking, will be employed to evaluate the stability. This work proposes a feed forward ZMP planning algorithm. The algorithm embeds the 'ZMP equations' indirectly into the kinematics of the kinematic model of a manipulator via a ZMP stability index The kinematic self motion of the redundant manipulator drives the system in such a way to keep or plan the ZHP at the desired position of the footprint. A sequential redundancy resolution algorithm exploiting the remaining kinematic redundancy is also proposed to enhance the performances of joint limit index and manipulability. In addition, the case exerted by external forces is taken into account. Through simulation for a 5 DOF redundant robot model, feasibility of the proposed algorithms is verified. Lastly, usual applications of the proposed kinematic model are discussed.

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
    • /
    • 제18권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.