V-rep学习笔记:机器人逆运动学数值解法(CyclicCoordinateDescent。。。

更新时间:2023-06-03 01:19:31 阅读: 评论:0

V-rep学习笔记:机器⼈逆运动学数值解法
(CyclicCoordinateDescent。。。
  When performing  (IK) on a complicated bone chain, it can become too complex for an analytical solution. Cyclic Coordinate Descent (CCD) is an alternative that is both easy to implement and efficient to process。逆运动学问题⼀般采⽤解析法和基于Jacobian矩阵的迭代⽅法,前者虽然精度⾼⽽且能达到实时的效果,但是随着关节的增多,⾃由度随着增多,数学建模也变得很困难,甚⾄不可解。⽽后者很难达到实时的效果。
CCD 算法的思想
  Cyclic Coordinate Descent (CCD) 是⼀个启发式的迭代搜索算法,它通过每⼀次只改变⼀个关节的参数来逐步减少位置误差和姿态误差,每个迭代过程包括⼀个从关节链结构的末端到基点的遍历过程。由于CCD ⽅法将多关节的关节链问题简化为单关节问题,可以⽤解析法处理,因此每⼀步的迭代可以相当快。当求得每个关节的参数 (转⾓)θ后,将其代⼊正向运动学⽅程求得末端效器和每个关节的位置。从运动链的末端开始 , 逐步改变每个关节的旋转⾓度。先是改变最末端的关节,末端关节到末段执⾏器的向量为图中蓝⾊线段,末端关节到⽬标点的向量为图中红⾊线段。求出2 个向量的夹⾓α,让末端关节下的⼦链绕旋转轴转α⾓度,则末端执⾏器达到⼀个新位置。若没有达到⽬标,则继续取当前关节的上⼀关节,
改变其旋转⾓度,直到选到根节点。若末端还没有达到⽬标位置,则⼜从末端关节开始新⼀轮运动,直到位置误差⾜够⼩或者到达了给定的循环次数。
  After our first loop through the bone chain, we have moved the end effector much clor to the target position. By repeating this process, we will continue to get clor and clor. Once we have reached a tolerable distance from the target position or once we have performed too many iterations (for performance reasons), we can stop looping.下⾯三幅图展⽰了CCD算法的3次迭代过程,可以看出随着迭代的进⾏,末端离⽬标点越来越近。
下⾯在V-rep中建⽴平⾯3连杆机构,各杆长均为0.5m,使⽤Python脚本计算运动学逆解并控制V-rep中的模型,使其达到⽬标位置。# -*- coding: utf-8 -*-
import vrep            # V-rep library
import sys
import timebing输入法
import math
# This function will convert an angle to the equivalent rotation in the range [-pi,pi]
def ConfineAngle(angle):
angle = angle % (2.0 * math.pi)
if( angle < -math.pi ):
angle += (2.0 * math.pi)
if( angle > math.pi ):
angle -= (2.0 * math.pi)
return angle虾米冬瓜
def CalcIK():
id = linkNum - 1
while id >= 0:
retcode, J_pos = vrep.simxGetObjectPosition(clientID,joint_handle[id],-1,vrep.simx_opmode_oneshot_wait)
穷兵黩武的意思
retcode, tip = vrep.simxGetObjectPosition(clientID,tip_handle, -1, vrep.simx_opmode_oneshot_wait)
# Get the vector from the current bone to the end effector position.
curToEndX = tip[0] - J_pos[0]
curToEndY = tip[1] - J_pos[1]
curToEndMag = math.sqrt( curToEndX*curToEndX + curToEndY*curToEndY )
# Get the vector from the current bone to the target position.
curToTargetX = target[0] - J_pos[0];
curToTargetY = target[1] - J_pos[1];
curToTargetMag = math.sqrt(curToTargetX*curToTargetX+curToTargetY*curToTargetY)
# Get rotation
endTargetMag = curToEndMag*curToTargetMag
if endTargetMag <= 0.0001:    # prevent division by small numbers
cosRotAng = 1
sinRotAng = 0
李庆远真实寿命el:
cosRotAng = (curToEndX*curToTargetX + curToEndY*curToTargetY) / endTargetMag
sinRotAng = (curToEndX*curToTargetY - curToEndY*curToTargetX) / endTargetMag
# Clamp the cosine into range when computing the angle(might be out of rangedue to floating point error)
rotAng = math.acos(max(-1, min(1,cosRotAng)))
if  sinRotAng < 0.0:
rotAng = -rotAng
q[id] = q[id] + rotAng
# Rotate the current link
if(id == 0):
if(id == 0):
vrep.simxSetJointPosition(clientID,joint_handle[id], ConfineAngle(q[id])+math.pi/2, vrep.simx_opmode_oneshot) el:
vrep.simxSetJointPosition(clientID,joint_handle[id], ConfineAngle(q[id]), vrep.simx_opmode_oneshot)
# Check for termination
retcode, tip = vrep.simxGetObjectPosition(clientID,tip_handle, -1, vrep.simx_opmode_oneshot_wait)
endToTargetX = (target[0] - tip[0])
endToTargetY = (target[1] - tip[1])
error = math.sqrt(endToTargetX*endToTargetX + endToTargetY*endToTargetY)
if( error <= stol ):
# We found a valid solution.
return 1, error
id = id - 1
return 0, error  # cannot get to the target in this iteration
if__name__ == "__main__":
# Starts a communication thread with the rver
clientID = vrep.simxStart('127.0.0.1', 20001, True, True, 5000, 5)
# clientID: the client ID, or -1 if the connection to the rver was not possible
if clientID != -1:  #check if client connection successful
print'Connected to remote API rver'
el:
print'Connection not successful'
# Retrieves an object handle bad on its name.
errorCode,tip_handle = vrep.simxGetObjectHandle(clientID,'tip',vrep.simx_opmode_oneshot_wait)
errorCode,target_handle = vrep.simxGetObjectHandle(clientID,'target',vrep.simx_opmode_oneshot_wait)
errorCode,consoleHandle = vrep.simxAuxiliaryConsoleOpen(clientID,'info',4,1+4,None,None,None,None,vrep.simx_opmode_oneshot_wait)    joint_handle = [-1,-1,-1]    # store the joint handles
豆腐干炒肉丝for i in range(3):
errorCode,joint_handle[i] = vrep.simxGetObjectHandle(clientID,'j'+str(i+1),vrep.simx_opmode_oneshot_wait)
谁身在曹营心在汉
ilimit = 100    # maximum iteration
stol = 1e-2    # tolerance
q = [0,0,0]    # initial joint value名言名句大全人生哲理
linkNum = 3    # number of links
retcode, target = vrep.simxGetObjectPosition(clientID,target_handle, -1, vrep.simx_opmode_oneshot_wait)
retcode, tip = vrep.simxGetObjectPosition(clientID,tip_handle, -1, vrep.simx_opmode_oneshot_wait)
植树日
count = 0
isOK = 0
while ( not isOK ):
isOK,err = CalcIK()
vrep.simxAuxiliaryConsolePrint(clientID,consoleHandle,None,vrep.simx_opmode_oneshot_wait)
count = count + 1
vrep.simxAuxiliaryConsolePrint(clientID,consoleHandle,str(count)+' iterations err:'+str(err),vrep.simx_opmode_oneshot_wait)  if count > ilimit:
vrep.simxAuxiliaryConsolePrint(clientID,consoleHandle,"Solution wouldn't converge\r\n",vrep.simx_opmode_oneshot_wait) break
#time.sleep(0.1)
# Ends the communication thread. This should be the very last remote API function called on the clie
nt side
vrep.simxFinish(clientID)
  点击仿真按钮并运⾏Python控制脚本后,可以看到V-rep中的连杆模型不断调整其关节⾓,同时误差err逐渐减⼩。当误差减⼩到⼀定程度,就可以停⽌迭代。下⾯三幅图中⽬标处于不同位置,可以发现⽬标位置对迭代次数有较⼤的影响(为什么会这样?)
参考:
2. 阳⼩涛 ,杨克俭. CCD 算法及其在逆运动学中的应⽤与实现[J]. 重庆⼯学院学报 (⾃然科学),2008 年 5 ⽉

本文发布于:2023-06-03 01:19:31,感谢您对本站的认可!

本文链接:https://www.wtabcd.cn/fanwen/fan/82/840380.html

版权声明:本站内容均来自互联网,仅供演示用,请勿用于商业和其他非法用途。如果侵犯了您的权益请与我们联系,我们将在24小时内删除。

标签:关节   位置   迭代   运动学   误差   达到   问题
相关文章
留言与评论(共有 0 条评论)
   
验证码:
推荐文章
排行榜
Copyright ©2019-2022 Comsenz Inc.Powered by © 专利检索| 网站地图