网站大量收购独家精品文档,联系QQ:2885784924

SLAM经典入门教程.docx

  1. 1、本文档共177页,可阅读全部内容。
  2. 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
Simultaneous Localization and Mapping (SLAM) Lecture 01 Introduction SLAM Objective Place a robot in an unknown location in an unknown environment and have the robot incrementally build a map of this environment while simultaneously using this map to compute vehicle location SLAM began with seminal paper by R. Smith, M. Self, and P. Cheeseman in 1990 A solution to SLAM has been seen“HolyGrailasthe” –Would enable robots to operate in an environmentapriori without knowledge of obstacle locations ? Research over the last decade has shown that a solution is possible!! The Localization Problem Defined A mapof landmark locations is known a priori Take measurements of landmarkz(i.locatione.distance and bearing) Determine vehicle locationxkbased onk z –Need filter if sensor is noisy! xk: location of vehicle at time k uk: a control vector applied at k-1 to drive the vehicle fromk-1to xk zk: observation of a landmark taken at time k Xk: history of states {x 1, x2, x3, ?,xk} ? Uk: history of control inputs {u 1, u2, u3, ?,uk} m: set of all landmarks The Mapping Problem Defined k ? The vehicle locationsXare provided ? Take measurement of landmarkz(i.locatione.distance and bearing) ? Build mapbased on onk z –Need filter if sensor is noisy! Xk: history of states {x 1, x2, x3, ?,xk} zk: observation of a landmark taken at time k mi: true location ofththelandmarki m: set of all landmarks Simultaneous Localization and Mapping Defined k ? From knowledge of observationsZ k –Determine vehicle locationsX –Build mapof landmark locations xk: location of vehicle at time k uk: a control vector applied at k-1 to drive the vehicle fromk-1to xk th ? mi: true location oflandmarki ? zk: observation of a landmark taken at time k ? Xk: history of states {x 1, x2, x3, ?,xk} ? Uk: history of control inputs {u 1, u2, u3, ?,uk} m: set of all landmarks Zk: history of all observations {z 1, z2, ?,zk} H. Durrant-Whyte, D. Rye, “E.LocalisationNebot, of Automatic GuidedVehiclesISRR”,1995 Simultaneous

文档评论(0)

182****0747 + 关注
实名认证
内容提供者

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

1亿VIP精品文档

相关文档