A grasp planning algorithm under uneven contact point distribution scenario for space non-cooperative target capture

• Published in: Chinese journal of aeronautics Vol. 36; no. 11; pp. 452 - 464
• Main Authors: CAI, Bicheng, YUE, Chengfei, WU, Fan, CHEN, Xueqin, GENG, Yunhai
• Format: Journal Article
• Language: English
• Published: Elsevier Ltd 01.11.2023; Research Center of the Satellite Technology,Harbin Institute of Technology,Harbin 150001,China%Institute of Space Science and Applied Technology,Harbin Institute of Technology Shenzhen,Shenzhen 518055,China
• Subjects: Grasp planning; Line array modeling; Space debris removal; Space non-cooperative target capture; Virtual symmetrical contact point method; Space non-cooperative target capture; Grasp planning; Space debris removal; Line array modeling; Virtual symmetrical contact point method
• ISSN: 1000-9361; 2588-9230
• DOI: 10.1016/j.cja.2023.02.026

The contact point configuration should be carefully chosen to ensure a stable capture, especially for the non-cooperative target capture mission using multi-armed spacecraft. In this work scenario, the contact points on the base and on the arms are distributed on the opposite side of the target. Otherwise, large forces will be needed. To cope with this problem, an uneven-oriented distribution union criterion is proposed. The union criterion contains a virtual symmetrical criterion and a geometry criterion. The virtual symmetrical contact point criterion is derived from the proof of the force closure principle using computational geometry to ensure a stable grasp, and the geometry criterion is calculated by the volume of the minimum polyhedron formed by the contact points to get a wide-range distribution. To further accelerate the optimization rate and enhance the global search ability, a line array modeling method and a continuous-discrete global search algorithm are proposed. The line array modeling method reduces the workload of calculating the descent direction and the gradient available, while the continuous-discrete global search algorithm reducing the optimization dimension. Then a highly efficient grasping is achieved and the corresponding contact point is calculated. Finally, an exhaustive verification is conducted to numerically analyze the disturbance resistance ability, and simulation results demonstrate the effectiveness of the proposed algorithms.