An obstacle-avoidance inverse kinematics method for robotic manipulator in overhead multi-line environment

• Published in: Engineering science and technology, an international journal Vol. 53; p. 101686
• Main Authors: Yang, Pengju, Shen, Feng, Xu, Dingjie, Chen, Bingxing, Liu, Ronghai, Wang, Hongwu
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.05.2024; Elsevier
• Subjects: Inverse kinematics; Nonconvex programming; Obstacle avoidance; Robotic manipulator; Nonconvex programming; Robotic manipulator; Obstacle avoidance; Inverse kinematics
• ISSN: 2215-0986; 2215-0986
• DOI: 10.1016/j.jestch.2024.101686

The inverse kinematics problem plays a crucial role in robotic manipulator planning, autonomous control, and object grasping. This problem can be solved in simple environments based on existing studies. However, it is still challenging to quickly find a feasible inverse kinematic solution when obstacle avoidance is required. In this paper, we present a nonconvex composite programming method to solve the inverse kinematics problem with overhead obstacle-avoidance requirements. Our method enables efficient obstacle avoidance by directly calculating the minimum distance between the manipulator and the overhead environment. We construct end-effector error functions based on the Product of Exponentials model and explicitly provide their gradient formula. We derive the minimum distance based on the geometry parametric equation and directly utilize it to construct the obstacle avoidance function. We propose an enhanced version of adaptive moment estimation based on short-time gradient information to improve optimization performance. Finally, we conduct simulations and experiments in overhead line environments. Comparative results with other optimization methods demonstrate that our proposed method achieves a high success rate with a low solution time.