ANALYSIS 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:

Antonov V. O.1

Affiliation:

1. Training at the Institute of Information Technologies and Telecommunications of NCFU

Abstract

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.

Publisher

Southwest State University

Subject

General Earth and Planetary Sciences,General Engineering,General Environmental Science

Reference18 articles.

1. Pogorelov A. D. Obzor algoritmov planirovaniya traektorii dvizheniya manipulyatorov // Molodezhnyi nauchno-tekhnicheskii vestnik. 2016. №. 8. S. 2-2.

2. Kamilyanov A. R. Planning of the trajectories of the movement of the multi-link manipulator in a complex three-dimensional working space on the basis of the evolutionary methods. Ph. D. Tesis. Ufa, 2007. 108 p.

3. Lin H. I. A fast and unified method to find a minimum-jerk robot joint trajectory using particle swarm optimization. Journal of Intelligent and Robotic Systems: Theory and Applications, 2014, vol. 75, no. 3-4, pp. 379-392.

4. Qi R., Zhou W., Wang T. An obstacle avoidance trajectory planning scheme for space manipulators based on genetic algorithm. Jiqiren/Robot, 2014, vol. 36, no. 3, pp. 263-270.

5. Xidias E. K. Time-optimal trajectory planning for hyper-redundant manipulators in 3D workspaces. Robotics and computer-integrated manufacturing, 2018, no. 50, pp. 286-298.

Cited by 1 articles. 订阅此论文施引文献 订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献

1. Energy efficiency assessment of anthropomorphic manipulator control algorithm;IOP Conference Series: Materials Science and Engineering;2020-08-01

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3