Bidirectional RRT Algorithm for Collision Avoidance Motion Planning of FFSR
نویسندگان
چکیده
The nonholonomic kinematics characteristic of free-floating space robot (FFSR) in a microgravity environment is a special difficulty in its motion planning. First, kinematics model for FFSR system and state transition equation have been established by applying linear momentum and angular momentum conservation laws followed by FFSR in a microgravity environment. Second, aiming at the nonholonomic characteristic of FFSR, a collision avoidance motion planning algorithm based on bidirectional rapidly-exploring random tree (RRT) has been proposed. This paper focuses on explaining the basic theory of FFSR motion planning, the basic principle for such core algorithms as EXTEND, CONECT and RRT-Connect and the realization of such algorithms. Finally, the correctness of the algorithms proposed has been verified via computer simulation. Copyright © 2014 IFSA Publishing, S. L.
منابع مشابه
BBRRT Rapid Collision Avoidance Motion Planning Algorithm for Intelligent High Dimensional Robot
Aiming at collision avoidance, convergence and execution efficiency in the motion planning of intelligent high-dimensional robot, the solution for rapid bi-directional balanced RRT (BBRrt) collision avoidance based on random sampling has been proposed. Firstly, the theoretical basis for BBRrt has been researched based on the concept of random sampling for configuration space, the BBRrt algorith...
متن کاملIntelligent bidirectional rapidly-exploring random trees for optimal motion planning in complex cluttered environments
The sampling based motion planning algorithm known as Rapidly-exploring Random Trees (RRT) has gained the attention of many researchers due to their computational efficiency and effectiveness. Recently, a variant of RRT called RRT* has been proposed that ensures asymptotic optimality. Subsequently its bidirectional version has also been introduced in the literature known as Bidirectional-RRT* (...
متن کاملFinding coordinated paths for multiple holonomic agents in 2-d polygonal environment
Avoiding collisions is one of the vital tasks for systems of autonomous mobile agents. We focus on the problem of finding continuous coordinated paths for multiple mobile disc agents in a 2-d environment with polygonal obstacles. The problem is PSPACE-hard, with the state space growing exponentially in the number of agents. Therefore, the state of the art methods include mainly reactive techniq...
متن کاملA vision-based collision avoidance technique for micro air vehicles using local-level frame mapping and path planning
This paper presents a vision-based collision avoidance technique for small and Miniature Air Vehicles (MAVs) using local-level frame mapping and path planning. Using computer vision algorithms, a depth map that represents the range and bearing to obstacles is obtained. Based on the depth map, we estimate the range, azimuth to, and height of obstacles using an extended Kalman Filter (EKF) that t...
متن کاملSimultaneous Grasp and Motion Planning
In this work, we present an integrated approach for planning collision-free grasping motions. The proposed Grasp–RRT planner combines the three main tasks needed for grasping an object: building a feasible grasp, solving the inverse kinematics problem and searching a collision-free trajectory that brings the hand to the grasping pose. Therefore, RRT-based algorithms are used to build a tree of ...
متن کامل