第四节4任务1基于采样的.pdf

  1. 1、本文档共83页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Lecture 4 KINODYNAMIC PATH FINDING 主讲人 Fei Gao Ph.D. in Robotics Hong Kong University of Science and Technology Assistant Professor,Zhejiang University Outline 1. Introduction 2. State Lattice Planning 3. Kinodynamic RRT* 4. Hybrid A* 5. Homework 2 Introduction 3 What is kinodynamic Kinodynamic : Kinematic + Dynamic The kinodynamic planning problem is to synthesize a robot motion subject to simultaneous kinematic constraints, such as oiding obstac , and dynamics constraints, such as modulus bounds on velocity, acceleration, and force. A kinodynamic solution is a mapping from time to generalized forces or accelerations. —— Kinodynamic Motion Planning, Bruce Donald, Patrick X ier, John Canny, John Reif • Differentially constrained • Up to force (acceleration) 4 Why kinodynamic planning ? Straight-line connections between pairs of states are typically not valid trajectories due to the system’s differential constraints Ask: We h e the back-end optimization, why kinodynamic planning? Recall the old-school pipeline: Mission Path Finding Trajectory Plan Optimization

文档评论(0)

183****7931 + 关注
实名认证
内容提供者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档