Trajectory Planning of a 6D Robot based on Meta Heuristic Algorithms

In this work, several established meta-heuristics (MHs) were employed for solving 6-DOF robot trajectory planning. A fourth order polynomial function is used to represent a motion path of the robot from initial to final points while an optimisation problem is posed to minimise travelling time subjec...

Full description

Bibliographic Details
Main Authors: Wichapong Kritsada, Pholdee Nantiwat, Bureerat Sujin, Radpukdee Thana
Format: Article
Language:English
Published: EDP Sciences 2018-01-01
Series:MATEC Web of Conferences
Online Access:https://doi.org/10.1051/matecconf/201822006004
id doaj-27e14a95802641c9ac6d276d7eb297da
record_format Article
spelling doaj-27e14a95802641c9ac6d276d7eb297da2021-02-02T04:51:48ZengEDP SciencesMATEC Web of Conferences2261-236X2018-01-012200600410.1051/matecconf/201822006004matecconf_icmsc2018_06004Trajectory Planning of a 6D Robot based on Meta Heuristic AlgorithmsWichapong Kritsada0Pholdee Nantiwat1Bureerat Sujin2Radpukdee Thana3Sustainable and Infrastructure Research and Development Center, Department of Mechancial Engineering, Faculty of Engineering, Khon Kaen UniversitySustainable and Infrastructure Research and Development Center, Department of Mechancial Engineering, Faculty of Engineering, Khon Kaen UniversitySustainable and Infrastructure Research and Development Center, Department of Mechancial Engineering, Faculty of Engineering, Khon Kaen UniversityDepartment of Industrial Engineering, Faculty of Engineering, Khon Kaen UniversityIn this work, several established meta-heuristics (MHs) were employed for solving 6-DOF robot trajectory planning. A fourth order polynomial function is used to represent a motion path of the robot from initial to final points while an optimisation problem is posed to minimise travelling time subject to velocity, acceleration and jerk constraints. The design variables are joint velocities and accelerations at intermediate positions, and moving time from the initial position to the intermediate position and from the intermediate position to the final position. Several MHs are used to solve the trajectory optimisation problem of robot manipulators while their performances are investigated. Based on this study, the best MH for robot trajectory planning is found while the results obtained from such a method are set as the baseline for further study of robot trajectory planning optimisation.https://doi.org/10.1051/matecconf/201822006004
collection DOAJ
language English
format Article
sources DOAJ
author Wichapong Kritsada
Pholdee Nantiwat
Bureerat Sujin
Radpukdee Thana
spellingShingle Wichapong Kritsada
Pholdee Nantiwat
Bureerat Sujin
Radpukdee Thana
Trajectory Planning of a 6D Robot based on Meta Heuristic Algorithms
MATEC Web of Conferences
author_facet Wichapong Kritsada
Pholdee Nantiwat
Bureerat Sujin
Radpukdee Thana
author_sort Wichapong Kritsada
title Trajectory Planning of a 6D Robot based on Meta Heuristic Algorithms
title_short Trajectory Planning of a 6D Robot based on Meta Heuristic Algorithms
title_full Trajectory Planning of a 6D Robot based on Meta Heuristic Algorithms
title_fullStr Trajectory Planning of a 6D Robot based on Meta Heuristic Algorithms
title_full_unstemmed Trajectory Planning of a 6D Robot based on Meta Heuristic Algorithms
title_sort trajectory planning of a 6d robot based on meta heuristic algorithms
publisher EDP Sciences
series MATEC Web of Conferences
issn 2261-236X
publishDate 2018-01-01
description In this work, several established meta-heuristics (MHs) were employed for solving 6-DOF robot trajectory planning. A fourth order polynomial function is used to represent a motion path of the robot from initial to final points while an optimisation problem is posed to minimise travelling time subject to velocity, acceleration and jerk constraints. The design variables are joint velocities and accelerations at intermediate positions, and moving time from the initial position to the intermediate position and from the intermediate position to the final position. Several MHs are used to solve the trajectory optimisation problem of robot manipulators while their performances are investigated. Based on this study, the best MH for robot trajectory planning is found while the results obtained from such a method are set as the baseline for further study of robot trajectory planning optimisation.
url https://doi.org/10.1051/matecconf/201822006004
work_keys_str_mv AT wichapongkritsada trajectoryplanningofa6drobotbasedonmetaheuristicalgorithms
AT pholdeenantiwat trajectoryplanningofa6drobotbasedonmetaheuristicalgorithms
AT bureeratsujin trajectoryplanningofa6drobotbasedonmetaheuristicalgorithms
AT radpukdeethana trajectoryplanningofa6drobotbasedonmetaheuristicalgorithms
_version_ 1724304736447889408