ImageVerifierCode 换一换
格式:PPT , 页数:53 ,大小:1.55MB ,
资源ID:2119316      下载积分:3 金币
快捷下载
登录下载
邮箱/手机:
温馨提示:
快捷下载时,用户名和密码都是您填写的邮箱或者手机号,方便查询和重复下载(系统自动生成)。 如填写123,账号就是123,密码也是123。
特别说明:
请自助下载,系统不会自动发送文件的哦; 如果您已付费,想二次下载,请登录后访问:我的下载记录
支付方式: 支付宝    微信支付   
验证码:   换一换

加入VIP,免费下载
 

温馨提示:由于个人手机设置不同,如果发现不能下载,请复制以下地址【https://www.bdocx.com/down/2119316.html】到电脑端继续下载(重复下载不扣费)。

已注册用户请登录:
账号:
密码:
验证码:   换一换
  忘记密码?
三方登录: 微信登录   QQ登录  

下载须知

1: 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。
2: 试题试卷类文档,如果标题没有明确说明有答案则都视为没有答案,请知晓。
3: 文件的所有权益归上传用户所有。
4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
5. 本站仅提供交流平台,并不能对任何下载内容负责。
6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。

版权提示 | 免责声明

本文(机器人学基础-第7章-机器人轨迹规划-蔡自兴.ppt)为本站会员(b****2)主动上传,冰豆网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对上载内容本身不做任何修改或编辑。 若此文所含内容侵犯了您的版权或隐私,请立即通知冰豆网(发送邮件至service@bdocx.com或直接QQ联系客服),我们立即给予删除!

机器人学基础-第7章-机器人轨迹规划-蔡自兴.ppt

1、中南大学中南大学蔡自兴,谢蔡自兴,谢 斌斌zxcai,2010机器人学基础机器人学基础第七章第七章 机器人轨迹规划机器人轨迹规划1Ch.7 Trajectory Planning of RobotsFundamentals of RoboticsCh.7 Trajectory Planning of Robots 2Ch.7 Trajectory Planning of Robots7.1General Considerations in Robot Trajectory Planning7.2Interpolated Calculation of Joint Trajectories 7.3

2、Planning of Cartesian Path Trajectories7.4Real Time Generation of Planning Trajectories7.5SummaryCh.7 Trajectory Planning of Robots 37.1General Considerations in Robot Trajectory Planning7.2Interpolated Calculation of Joint Trajectories 7.3Planning of Cartesian Path Trajectories7.4Real Time Generati

3、on of Planning Trajectories7.5SummaryCh.7 Trajectory Planning of Robots7.1 General Considerations in Trajectory Planning 轨迹规划应考虑的问题轨迹规划应考虑的问题Basic Problem:Move the manipulator arm from some initial position to some desired final position(May be going through some via points).47.1 General considerati

4、ons7.1 General Considerations in Trajectory PlanningTrajectory:Time history of position,velocity and acceleration for each DOFPath points:Initial,final and via pointsConstraints:Spatial,time,smoothness57.1 General considerationsJoint spaceEasy to go through via points(Solve inverse kinematics at all

5、 path points)No problems with singularitiesLess calculationsCan not follow straight lineCartesian spaceWe can track a shape(for orientation:equivalent axes,Euler angles,)More expensive at run time(after the path is calculated need joint angles in a lot of points)Discontinuity problems6General Consid

6、erations-Solution Space7.1 General considerationsCartesian planning difficulties:7General Considerations-Solution Space7.1 General considerationsInitial(A)and Goal(B)Points are reachable,but intermediate points(C)unreachable.Ch.7 Trajectory Planning of Robots 87.1General Considerations in Robot Traj

7、ectory Planning7.2Interpolated Calculation of Joint Trajectories 7.3Planning of Cartesian Path Trajectories7.4Real Time Generation of Planning Trajectories7.5SummaryCh.7 Trajectory Planning of RobotsJoint-Space SchemesEach path point is converted into a set of desired joint angles by application of

8、the inverse kinematics.A smooth function is found for each of the n joints which pass through the via points and end at the goal point.Time required for each segment is the same for each joint.The determination of the desired joint angle function for a particular joint is independent with other join

9、ts.97.2 Interpolated Calculation of Joint Trajectories 关节轨迹的插值计算关节轨迹的插值计算7.2 JointSpace SchemesChoice of interpolation function is not unique!10Joint-Space Schemes 7.2 JointSpace SchemesSeveral possible path shapes for a single joint.Some possible interpolation functions:Cubic polynomials Cubic poly

10、nomials for a path with via pointsHigher-order polynomials Linear function with parabolic blendsLinear function with parabolic blends for a path with via points11Joint-Space Schemes 7.2 JointSpace SchemesIn making a single smooth motion,at least four constraints on are evident:127.2.1 Cubic Polynomi

11、als 三次多项式插值三次多项式插值7.2 JointSpace SchemesCombining the four constraints yields four equations with four unknowns:137.2.1 Cubic Polynomials7.2 JointSpace SchemesThese four constraints uniquely specify a particular cubic:147.2.1 Cubic PolynomialsThe joint velocity and acceleration along this path are:7

12、.2 JointSpace SchemesEg.7.1 A single-link robot with a rotary joint is motionless at =15 degrees.It is desired to move the joint in a smooth manner to=75 degrees in 3 seconds.Find the coefficients of a cubic which accomplishes this motion and brings the manipulator to rest at the goal.Plot the posit

13、ion,velocity,and acceleration of the joint as a function of time.157.2.1 Cubic Polynomials7.2 JointSpace SchemesSolution:Plugging 0=15,f=75,tf=3 into(7.6),we find167.2.1 Cubic Polynomials7.2 JointSpace SchemesSolution:177.2.1 Cubic Polynomials7.2 JointSpace SchemesStarts at 15 degrees and ends at 75

14、 degrees!Solution:187.2.1 Cubic Polynomials7.2 JointSpace SchemesStarts and ends at rest!Solution:197.2.1 Cubic Polynomials7.2 JointSpace SchemesAcceleration profile is linear!If we come to rest at each pointuse formula from previous slideor continuous motion(no stops)need velocities at intermediate

15、 points:Initial Conditions:207.2.2 Cubic polynomials with via points 过路径点的三次多项式插值过路径点的三次多项式插值7.2 JointSpace SchemesSolutions:How to specify velocity at the via points:The user specifies the desired velocity at each via point in terms of a Cartesian linear and angular velocity of the tool frame at th

16、at instant.The system automatically chooses the velocities at the via points by applying a suitable heuristic in either Cartesian space or joint space(average of 2 sides etc.).The system automatically chooses the velocities at the via points in such a way as to cause the acceleration at the via points to be continuous.217.2 JointSpace Schemes7.2.2 Cubic polynomials with via pointsHigher order polynomials are sometimes used for path segments.For example,if we wish to be able to specify the positi

copyright@ 2008-2022 冰豆网网站版权所有

经营许可证编号:鄂ICP备2022015515号-1