Application of bidirectional rapidly exploring random trees (BiRRT) algorithm for collision-free trajectory planning of free-floating space manipulator
Tomasz Rybus, Jacek Prokopczuk, Mateusz Wojtunik, Konrad Aleksiejuk, Jacek Musiał
Abstract
Abstract On-orbit servicing and active debris removal missions will rely on the use of unmanned satellite equipped with a manipulator. Capture of the target object will be the most challenging phase of these missions. During the capture manoeuvre, the manipulator must avoid collisions with elements of the target object (e.g., solar panels). The dynamic equations of the satellite-manipulator system must be used during the trajectory planning because the motion of the manipulator influences the position and orientation of the satellite. In this paper, we propose application of the bidirectional rapidly exploring random trees (BiRRT) algorithm for planning a collision-free trajectory of a manipulator mounted on a free-floating satellite. A new approach based on pseudo-velocities method (PVM) is used for construction of nodes of the trajectory tree. Initial nodes of the second tree are selected from the set of potential final configurations of the system. The proposed method is validated in numerical simulations performed for a planar case (3-DoF manipulator). The obtained results are compared with the results obtained with two other trajectory planning methods based on the RRT algorithm. It is shown that in a simple test scenario, the proposed BiRRT PVM algorithm results in a lower manipulator tip position error. In a more difficult test scenario, only the proposed method was able to find a solution. Practical applicability of the BiRRT PVM method is demonstrated in experiments performed on a planar air-bearing microgravity simulator where the trajectory is realised by a manipulator mounted on a mock-up of the free-floating servicing satellite.