Open AccessANALYSIS OF THE COMPUTATIONAL COMPLEXITY OF THE METHOD OF ITERATIVE DIMENSIONAL-LINEAR GENERATION OF THE TRAJECTORY OF MOTION OF THE THREE-LINE ANTHROPOMORPHIC MANIPULATOR IN THE VOLUME SPACE WITH OBSTRUCTION
Author(s) -
В. О. Антонов
Publication year - 2018
Publication title -
izvestiâ ûgo-zapadnogo gosudarstvennogo universiteta
Language(s) - English
Resource type - Journals
eISSN - 2686-6757
pISSN - 2223-1560
DOI - 10.21869/2223-1560-2018-22-3-13-28
Subject(s) - computer science , algorithm , trajectory , motion planning , piecewise , mathematical optimization , computational complexity theory , mathematics , robot , artificial intelligence , mathematical analysis , physics , astronomy
Energy efficiency is an actual problem of the present, including in the field of robotics. Existing methods for planning the trajectory of motion of manipulators with excessive mobility face a number of problems, one of which is the impossibility of working in real time mode due to the high complexity of the scheduling algorithm. Moreover, the existing algorithms that work in real time are significantly inferior to the accuracy of the target operations. Therefore, earlier, in the author's articles, an iterative method of piecewise linear generation of the manipulator's trajectory was developed. In this paper, we analyze the computational complexity of the numerical method of iterative piecewise linear generation of the trajectory of a three-link anthropomorphic manipulator with 7 degrees of mobility in a volume space with an obstacle, an approximated hypersphere, in real time. A short description of the proposed method of planning the trajectory of motion is given. To move between the waypoints, the Denavite-Hartenberg representation used, with the formulation and solution of the problem of nonlinear optimization with the objective function of minimizing energy consumption when the manipulator moved to the target point. The initial generalized algorithm of the path planning method described. The number of operations that must performed in the process of execution of a recursive algorithm is considered. Parallelizing the branching recursive algorithm allows you to reduce the execution time to the time of executing a non-branching recursive algorithm with the same computational complexity and depth. A formula developed that allows you to select the values of variable parameters of the algorithm based on the available computational power and the allowable calculation time, and to determine the requirements for the manipulator computer system at the development stage.