This paper presents a new minimum-time trajectory planning method which consists of a desired path in the Cartesian space to a manipulator under external forces subject to the input voltage of the actuators. Firstly, the path is parametrized with an unknown parameter called a path parameter. This parameter is considered a function of time and an unknown parameter vector for optimization. Secondly, the optimization problem is converted into a regular parameter optimization problem, subject to the equations of motion and limitations in angular velocity, angular acceleration, angular jerk, input torques of actuators’, input voltage and final time, respectively. In the presented algorithm, the final time of the task is divided into known partitions, and the final time is an additional unknown variable in the optimization problem. The algorithm attempts to minimize the final time by optimizing the path parameter, thus it is parametrized as a polynomial of time with some unknown parameters. The algorithm can have a smooth input voltage in an allowable range; then all motion parameters and the jerk will remain smooth. Finally, the simulation study shows that the presented approach is efficient in the trajectory planning for a manipulator that wants to follow a Cartesian path. In simulations, the constraints are respected, and all motion variables and path parameters remain smooth.
Minimum-time path planning for robot manipulators using path parameter optimization with external force and frictions
01.01.2019
Tehnički glasnik ; ISSN 1846-6168 (Print) ; ISSN 1848-5588 (Online) ; Volume 13 ; Issue 1
Aufsatz (Zeitschrift)
Elektronische Ressource
Englisch
DDC: | 629 |
Energy efficient sinusoidal path planning of robot manipulators
Online Contents | 1994
|Cooperative Path Planning for Two Manipulators
British Library Online Contents | 1998
|Particle Swarm Optimization of Non Uniform Rational B-Splines for Robot Manipulators Path Planning
BASE | 2017
|Collision-Free Path Planning of Articulated Manipulators
Online Contents | 1993
|