Cyclic Path Planning Of Hyper-Redundant Manipulator Using Whale Optimization Algorithm

• 主要な著者: Machmudah, Affiani, Parman, Setyamartana, Abbasi, Aijaz, Solihin, Mahmud Iwan, Abd Manan, Teh Sabariah, Beddu, Salmia, Ahmad, Amiruddin, Wan Rasdi, Nadiah
• フォーマット: 論文
• 言語: English
• 出版事項: Science and Information Organization 2021
• オンライン･アクセス: http://eprints.utem.edu.my/id/eprint/25747/2/PAPER_79-CYCLIC_PATH_PLANNING_OF_HYPER_REDUNDANT_MANIPULATOR.PDF; http://eprints.utem.edu.my/id/eprint/25747/; https://thesai.org/Downloads/Volume12No8/Paper_79-Cyclic_Path_Planning_of_Hyper_redundant_Manipulator.pdf

This paper develops a path planning algorithm of hyper-redundant manipulators to achieve a cyclic property. The basic idea is based on a geometrical analysis of a 3-link planar series manipulator in which there is an orientation angle boundary of a prescribed path. To achieve the repetitive behavior, for hyper-redundant manipulators consisting of 3-link components, an additional path is chosen in such away so that it is a repetitive curve which has the same curve frequency with the prescribed end- effector path. To solve the redundancy resolution, meta-heuristic optimizations, namely Genetic Algorithm (GA) and Whale Optimization Algorithm (WOA), are applied to search optimal trajectories inside local orientation angle boundaries. Results show that using constant of the local orientation angle trajectories for the 3-link component, the cyclic properties can be achieved. The performance of the WOA shows very promising result where generally it obtains the lowest fitness value as compare with the GA. Depending on the complexity of the path planning, dividing the path into several stages via intermediate points may be necessary to achieve the good posture. The performance of the swarm based meta-heuristic optimization, namely the WOA, shows very promising result where generally it obtains the lowest fitness value as compare with the GA. Using the developed approach, not only the cyclic property is obtained but also the optimal movement of the hyperredundant manipulator is achieved