scholarly journals EG-RRT: Environment-guided random trees for kinodynamic motion planning with uncertainty and obstacles

Author(s):  
L. Jaillet ◽  
J. Hoffman ◽  
J. van den Berg ◽  
P. Abbeel ◽  
J. M. Porta ◽  
...  
2020 ◽  
Vol 10 (24) ◽  
pp. 9137
Author(s):  
Hongwen Zhang ◽  
Zhanxia Zhu

Motion planning is one of the most important technologies for free-floating space robots (FFSRs) to increase operation safety and autonomy in orbit. As a nonholonomic system, a first-order differential relationship exists between the joint angle and the base attitude of the space robot, which makes it pretty challenging to implement the relevant motion planning. Meanwhile, the existing planning framework must solve inverse kinematics for goal configuration and has the limitation that the goal configuration and the initial configuration may not be in the same connected domain. Thus, faced with these questions, this paper investigates a novel motion planning algorithm based on rapidly-exploring random trees (RRTs) for an FFSR from an initial configuration to a goal end-effector (EE) pose. In a motion planning algorithm designed to deal with differential constraints and restrict base attitude disturbance, two control-based local planners are proposed, respectively, for random configuration guiding growth and goal EE pose-guiding growth of the tree. The former can ensure the effective exploration of the configuration space, and the latter can reduce the possibility of occurrence of singularity while ensuring the fast convergence of the algorithm and no violation of the attitude constraints. Compared with the existing works, it does not require the inverse kinematics to be solved while the planning task is completed and the attitude constraint is preserved. The simulation results verify the effectiveness of the algorithm.


2021 ◽  
Author(s):  
Berend van den Berg ◽  
Bruno Brito ◽  
Mohsen Alirezaei ◽  
Javier Alonso-Mora

2019 ◽  
Vol 41 (12) ◽  
pp. 3321-3330 ◽  
Author(s):  
Emre Ege ◽  
Mustafa Mert Ankarali

In this paper, we propose a new motion planning method that aims to robustly and computationally efficiently solve path planning and navigation problems for unmanned surface vehicles (USVs). Our approach is based on synthesizing two different existing methodologies: sequential composition of dynamic behaviours and rapidly exploring random trees (RRT). The main motivation of this integrated solution is to develop a robust feedback-based and yet computationally feasible motion planning algorithm for USVs. In order to illustrate the main approach and show the feasibility of the method, we performed simulations and tested the overall performance and applicability for future experimental applications. We also tested the robustness of the method under relatively extreme environmental uncertainty. Simulation results indicate that our method can produce robust and computationally feasible solutions for a broad class of USVs.


Robotica ◽  
2014 ◽  
Vol 34 (1) ◽  
pp. 202-225 ◽  
Author(s):  
Beobkyoon Kim ◽  
Terry Taewoong Um ◽  
Chansu Suh ◽  
F. C. Park

SUMMARYThe Tangent Bundle Rapidly Exploring Random Tree (TB-RRT) is an algorithm for planning robot motions on curved configuration space manifolds, in which the key idea is to construct random trees not on the manifold itself, but on tangent bundle approximations to the manifold. Curvature-based methods are developed for constructing tangent bundle approximations, and procedures for random node generation and bidirectional tree extension are developed that significantly reduce the number of projections to the manifold. Extensive numerical experiments for a wide range of planning problems demonstrate the computational advantages of the TB-RRT algorithm over existing constrained path planning algorithms.


Sign in / Sign up

Export Citation Format

Share Document