Informed Guided Rapidly-Exploring Random Trees*-Connect for Path Planning of Walking Robots

03/06/2023
by   Dominik Belter, et al.
0

In this paper, we deal with the problem of full-body path planning for walking robots. The state of walking robots is defined in multi-dimensional space. Path planning requires defining the path of the feet and the robot's body. Moreover, the planner should check multiple constraints like static stability, self-collisions, collisions with the terrain, and the legs' workspace. As a result, checking the feasibility of the potential path is time-consuming and influences the performance of a planning method. In this paper, we verify the feasibility of sampling-based planners in the path planning task of walking robots. We identify the strengths and weaknesses of the existing planners. Finally, we propose a new planning method that improves the performance of path planning of legged robots.

READ FULL TEXT

page 2

page 6

research
08/03/2023

Multi-robot Path Planning with Rapidly-exploring Random Disjointed-Trees

Multi-robot path planning is a computational process involving finding p...
research
03/24/2021

Anytime informed path re-planning and optimization for robots in changing environments

In this paper, we propose a path re-planning algorithm that makes robots...
research
08/30/2023

Sparse Waypoint Validity Checking for Self-Entanglement-Free Tethered Path Planning

A novel mechanism to derive self-entanglement-free (SEF) path for tether...
research
03/24/2022

TIGRIS: An Informed Sampling-based Algorithm for Informative Path Planning

Informative path planning is an important and challenging problem in rob...
research
02/11/2021

Speculative Path Planning

Parallelization of A* path planning is mostly limited by the number of p...
research
07/12/2021

Post Triangular Rewiring Method for Shorter RRT Robot Path Planning

This paper proposed the 'Post Triangular Rewiring' method that minimizes...
research
08/07/2021

Multi-Robot Path Planning in Complex Environments via Graph Embedding

We propose an approach to solve multi-agent path planning (MPP) problems...

Please sign up or login with your details

Forgot password? Click here to reset