PLANNING THE JOINT TRAJECTORY OF REDUNDANT KINEMATICS CHAIN

K. Yankov
{"title":"PLANNING THE JOINT TRAJECTORY OF REDUNDANT KINEMATICS CHAIN","authors":"K. Yankov","doi":"10.15547/tjs.2022.03.011","DOIUrl":null,"url":null,"abstract":"In a number of technological operations, the end-effector of an open kinematic chain must follow a spatial trajectory, and a necessary condition for the realization of the movement is the smooth change of the generalized coordinates. An analogous problem exists in the development of drugs when a molecular configuration requiring minimal energy for its realization must be provided. A task of this nature must be solved in order to find the missing segments of a partially known protein structure. These problems lead to the more general task of ensuring a smooth change of the joint coordinates of the kinematic chain while performing a continuous spatial movement of the end-effector of the chain. An algorithm for planning a smooth reconfiguration of a redundant kinematics chain is proposed in the present work. The chain is decomposed into a countable number of substructures, each of which provides a unique solution of inverse kinematics for a target point. This makes it possible to select substructures during the spatial movement of the kinematic chain, ensuring a smooth change of the joint coordinates. The redundant generalized coordinates are force controlled, given the necessary values to ensure a smooth reconfiguration. The inverse kinematics problem is solved for the other joints.","PeriodicalId":30048,"journal":{"name":"Trakia Journal of Sciences","volume":"1 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2022-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Trakia Journal of Sciences","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.15547/tjs.2022.03.011","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

In a number of technological operations, the end-effector of an open kinematic chain must follow a spatial trajectory, and a necessary condition for the realization of the movement is the smooth change of the generalized coordinates. An analogous problem exists in the development of drugs when a molecular configuration requiring minimal energy for its realization must be provided. A task of this nature must be solved in order to find the missing segments of a partially known protein structure. These problems lead to the more general task of ensuring a smooth change of the joint coordinates of the kinematic chain while performing a continuous spatial movement of the end-effector of the chain. An algorithm for planning a smooth reconfiguration of a redundant kinematics chain is proposed in the present work. The chain is decomposed into a countable number of substructures, each of which provides a unique solution of inverse kinematics for a target point. This makes it possible to select substructures during the spatial movement of the kinematic chain, ensuring a smooth change of the joint coordinates. The redundant generalized coordinates are force controlled, given the necessary values to ensure a smooth reconfiguration. The inverse kinematics problem is solved for the other joints.
规划冗余运动链的关节轨迹
在许多工艺操作中,开放运动链的末端执行器必须遵循一定的空间运动轨迹,而实现该运动的必要条件是广义坐标的平滑变换。类似的问题也存在于药物的开发中,即必须提供一种需要最小能量才能实现的分子结构。为了找到部分已知的蛋白质结构的缺失片段,必须解决这种性质的任务。这些问题导致了更一般的任务,即确保运动链的关节坐标的平滑变化,同时执行链的末端执行器的连续空间运动。提出了一种规划冗余运动链平滑重构的算法。将链分解为可数的子结构,每个子结构都提供目标点的唯一逆运动学解。这使得在运动链的空间运动过程中选择子结构成为可能,从而确保关节坐标的平滑变化。冗余广义坐标是力控制的,给定必要的值以确保平滑重构。求解了其他关节的运动学逆问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
25
审稿时长
13 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信