• Title/Summary/Keyword: Path planner

Search Result 57, Processing Time 0.029 seconds

Sequential Quadratic Programming based Global Path Re-Planner for a Mobile Manipulator

  • Lee Soo-Yong
    • International Journal of Control, Automation, and Systems
    • /
    • v.4 no.3
    • /
    • pp.318-324
    • /
    • 2006
  • The mobile manipulator is expected to work in partially defined or unstructured environments. In our global/local approach to path planning, joint trajectories are generated for a desired Cartesian space path, designed by the global path planner. For a local path planner, inverse kinematics for a redundant system is used. Joint displacement limit for the manipulator links is considered in the motion planner. In an event of failure to obtain feasible trajectories, the task cannot be accomplished. At the point of failure, a deviation in the Cartesian space path is obtained and a replanner gives a new path that would achieve the goal position. To calculate the deviation, a nonlinear optimization problem is formulated and solved by standard Sequential Quadratic Programming (SQP) method.

Improved Heterogeneous-Ants-Based Path Planner using RRT* (RRT*를 활용하여 향상된 이종의 개미군집 기반 경로 계획 알고리즘)

  • Lee, Joonwoo
    • The Journal of Korea Robotics Society
    • /
    • v.14 no.4
    • /
    • pp.285-292
    • /
    • 2019
  • Path planning is an important problem to solve in robotics and there has been many related studies so far. In the previous research, we proposed the Heterogeneous-Ants-Based Path Planner (HAB-PP) for the global path planning of mobile robots. The conventional path planners using grid map had discrete state transitions that constrain the only movement of an agent to multiples of 45 degrees. The HAB-PP provided the smoother path using the heterogeneous ants unlike the conventional path planners based on Ant Colony Optimization (ACO) algorithm. The planner, however, has the problem that the optimization of the path once found is fast but it takes a lot of time to find the first path to the goal point. Also, the HAB-PP often falls into a local optimum solution. To solve these problems, this paper proposes an improved ant-inspired path planner using the Rapidly-exploring Random Tree-star ($RRT^*$). The key ideas are to use $RRT^*$ as the characteristic of another heterogeneous ant and to share the information for the found path through the pheromone field. The comparative simulations with several scenarios verify the performance of the improved HAB-PP.

A study on the path planner for a mobile robot in partially known environment (부분적으로 알려진 환경에 대한 이동 로봇의 경로 생성 계획기에 관한 연구)

  • Seo, Young-Sup;Park, Chun-Ug;Kim, Jin-Geol
    • Proceedings of the KIEE Conference
    • /
    • 1998.07g
    • /
    • pp.2342-2344
    • /
    • 1998
  • In this paper, the path planner is presented for a robot to achieve an efficient path forward the given goal position in two dimensional environment which is involved with partially unknown obstacles. The path planner consists of three major components: off-line path planning, on-line path planning, and modification of planned path. Off-line path planning is based on known environment and creates the shortest path. On-line path planning is for finding unknown obstacles. The modification can be accomplished, by genetic algorithm, to be smooth path for preventing slippage and excessive centrifugal force.

  • PDF

Hierarchical Fuzzy Motion Planning for Humanoid Robots Using Locomotion Primitives and a Global Navigation Path

  • Kim, Yong-Tae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.10 no.3
    • /
    • pp.203-209
    • /
    • 2010
  • This paper presents a hierarchical fuzzy motion planner for humanoid robots in 3D uneven environments. First, we define both motion primitives and locomotion primitives of humanoid robots. A high-level planner finds a global path from a global navigation map that is generated based on a combination of 2.5 dimensional maps of the workspace. We use a passage map, an obstacle map and a gradient map of obstacles to distinguish obstacles. A mid-level planner creates subgoals that help the robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. We use a local obstacle map to find the subgoals along the global path. A low-level planner searches for an optimal sequence of locomotion primitives between subgoals by using fuzzy motion planning. We verify our approach on a virtual humanoid robot in a simulated environment. Simulation results show a reduction in planning time and the feasibility of the proposed method.

Multi-Robot Path Planning for Environmental Exploration/Monitoring (미지 환경 탐색 및 감시를 위한 다개체 로봇의 경로계획)

  • Lee, Soo-Yong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.5
    • /
    • pp.413-418
    • /
    • 2012
  • This paper presents a multi-robot path planner for environment exploration and monitoring. Robotics systems are being widely used as data measurement tools, especially in dangerous environment. For large scale environment monitoring, multiple robots are required in order to save time. The path planner should not only consider the collision avoidance but efficient coordination of robots for optimal measurements. Nonlinear spring force based planning algorithm is integrated with the spatial gradient following path planner. Perturbation/Correlation based estimation of spatial gradient is applied. An algorithm of tuning the stiffness for robot coordination is presented. The performance of the proposed algorithm is discussed with simulation results.

Fuzzy Footstep Planning for Humanoid Robots Using Locomotion Primitives (보행 프리미티브 기반 휴머노이드 로봇의 퍼지 보행 계획)

  • Kim, Yong-Tae;Noh, Su-Hee;Han, Nam-I
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2007.04a
    • /
    • pp.7-10
    • /
    • 2007
  • This paper presents a fuzzy footstep planner for humanoid robots in complex environments. First, we define locomotion primitives for humanoid robots. A global planner finds a global path from a navigation map that is generated based on a combination of 2.5 dimensional maps of the 3D workspace. A local planner searches for an optimal sequence of locomotion primitives along the global path by using fuzzy footstep planning. We verify our approach on a virtual humanoid robot in a simulated environment. Simulation results show a reduction in planning time and the feasibility of the proposed method.

  • PDF

Implementing Dynamic Obstacle Avoidance of Autonomous Multi-Mobile Robot System (자율 다개체 모바일 로봇 시스템의 동적 장애물 회피 구현)

  • Kim, Dong W.;Yi, Cho-Ho
    • Journal of the Korea Society of Computer and Information
    • /
    • v.18 no.1
    • /
    • pp.11-19
    • /
    • 2013
  • For an autonomous multi-mobile robot system, path planning and collision avoidance are important functions used to perform a given task collaboratively and cooperatively. This study considers these important and challenging problems. The proposed approach is based on a potential field method and fuzzy logic system. First, a global path planner selects the paths of the robots that minimize the cost function from each robot to its own target using a potential field. Then, a local path planner modifies the path and orientation from the global planner to avoid collisions with static and dynamic obstacles using a fuzzy logic system. In this paper, each robot independently selects its destination and considers other robots as dynamic obstacles, and there is no need to predict the motion of obstacles. This process continues until the corresponding target of each robot is found. To test this method, an autonomous multi-mobile robot simulator (AMMRS) is developed, and both simulation-based and experimental results are given. The results show that the path planning and collision avoidance strategies are effective and useful for multi-mobile robot systems.

Motion Planning for Legged Robots Using Locomotion Primitives in the 3D Workspace (3차원 작업공간에서 보행 프리미티브를 이용한 다리형 로봇의 운동 계획)

  • Kim, Yong-Tae;Kim, Han-Jung
    • The Journal of Korea Robotics Society
    • /
    • v.2 no.3
    • /
    • pp.275-281
    • /
    • 2007
  • This paper presents a motion planning strategy for legged robots using locomotion primitives in the complex 3D environments. First, we define configuration, motion primitives and locomotion primitives for legged robots. A hierarchical motion planning method based on a combination of 2.5 dimensional maps of the 3D workspace is proposed. A global navigation map is obtained using 2.5 dimensional maps such as an obstacle height map, a passage map, and a gradient map of obstacles to distinguish obstacles. A high-level path planner finds a global path from a 2D navigation map. A mid-level planner creates sub-goals that help the legged robot efficiently cope with various obstacles using only a small set of locomotion primitives that are useful for stable navigation of the robot. A local obstacle map that describes the edge or border of the obstacles is used to find the sub-goals along the global path. A low-level planner searches for a feasible sequence of locomotion primitives between sub-goals. We use heuristic algorithm in local motion planner. The proposed planning method is verified by both locomotion and soccer experiments on a small biped robot in a cluttered environment. Experiment results show an improvement in motion stability.

  • PDF

Collision-free local planner for unknown subterranean navigation

  • Jung, Sunggoo;Lee, Hanseob;Shim, David Hyunchul;Agha-mohammadi, Ali-akbar
    • ETRI Journal
    • /
    • v.43 no.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.

Temporal Waypoint Revision Method to Solve Path Mismatch Problem of Hierarchical Integrated Path Planning for Mobile Vehicle (이동 차량의 계층적 통합 경로 계획의 경로 부조화 문제 해결을 위한 임시 경유점 수정법)

  • Lee, Joon-Woo;Seok, Joon-Hong;Ha, Jung-Su;Lee, Ju-Jang;Lee, Ho-Joo
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.18 no.7
    • /
    • pp.664-668
    • /
    • 2012
  • Hierarchical IPP (Integrated Path Planning) combining the GPP (Global Path Planner) and the LPP (Local Path Planner) is interesting the researches who study about the mobile vehicle in recent years. However, in this study, there is the path mismatch problem caused by the difference in the map information available to both path planners. If ever a part of the path that was found by the GPP is available to mobile vehicle, the part may be unavailable when the mobile vehicle generates the local path with its built-in sensors while the vehicle moves. This paper proposed the TWR (Temporal Waypoint Reviser) to solve the path mismatch problem of the hierarchical IPP. The results of simulation provide the performance of the IPP with the TWR by comparing with other path planners.