Chaos-based Vortex Search algorithm for solving inverse kinematics problem of serial robot manipulators with offset wrist

• Published in: Applied soft computing Vol. 89; p. 106074
• Main Author: Toz, Metin
• Format: Journal Article
• Language: English
• Published: Elsevier B.V 01.04.2020
• Subjects: Chaos map; Inverse kinematics problem; Serial robot manipulator with offset wrist; Vortex search; Serial robot manipulator with offset wrist; Vortex search; Chaos map; Inverse kinematics problem
• ISSN: 1568-4946; 1872-9681; 1872-9681
• DOI: 10.1016/j.asoc.2020.106074

Vortex Search (VS) algorithm is a single-solution-based optimization algorithm that requires the high maximum number of iterations (NOI) to solve optimization problems. In this study, two methods were proposed to reduce the required maximum NOI of the VS algorithm. These methods are based on using ten chaos maps with the VS algorithm and provide improvements in the exploration and exploitation abilities of the algorithm for reducing the required maximum NOI. Ten chaos-based VS algorithms (CVSs) were obtained by combining these methods with the VS algorithm. The performances of the CVS algorithms were tested by fifty benchmark functions. The results were evaluated in terms of some statistical values and a pairwise statistical test, Wilcoxon Signed-Rank Test. According to the results, it was found that the CVS algorithm obtained by using the Gauss–Mouse chaos map was the best algorithm. And also, it was shown that the proposed CVS algorithm performs better than the classical VS algorithm, even when its maximum NOI was ten times less than the maximum NOI of the VS algorithm. Additionally, the effects of the proposed methods in the exploration and the exploitation abilities of the VS algorithm were visually shown and a comparison about algorithm processing time was presented. In order to test the performance of the proposed CVS algorithm in solving the real-world optimization problems, the inverse kinematics problem of a six Degrees Of Freedom (DOF) serial robot manipulator with offset wrist was solved with both the proposed CVS algorithm and the VS algorithm for two different types of trajectories. The results showed that the proposed algorithm outperforms the VS algorithm in terms of the objective function values and position errors of the end-effector of the serial robot manipulator. [Display omitted] •Two methods for reducing the maximum number of iterations for the VS algorithm.•Ten Chaos-Based VS algorithms (CVS).•The best CVS algorithm is the CVS3 that obtained by using the Gauss–Mouse chaos map.•Solution of the inverse kinematics of a serial robot with offset wrist by the CVS3.•CVS3 outperforms the classical VS algorithm even at ten times the maximum NOI.