A framework for mobile robot concurrent path planning and execution in incomplete and uncer.pdf

A framework for mobile robot concurrent path planning and execution in incomplete and uncer.pdf

  1. 1、本文档共7页,可阅读全部内容。
  2. 2、有哪些信誉好的足球投注网站(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
  3. 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  4. 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
A framework for mobile robot concurrent path planning and execution in incomplete and uncer

To appear: AIPS-98 Workshop on Integrating Planning, Scheduling Execution in Dynamic Uncertain Environments 1A Framework for Mobile RobotConcurrent Path Planning Executionin Incomplete Uncertain EnvironmentsJohn S. ZelekEngineering Systems Computing,School of Engineering, University of Guelph,Guelph, ON, N1G 2W1, Canadae-mail: jzelek@uoguelph.cawww: 0/web les/zelek/AbstractSensor-based discovery path planning is problematicbecause the path needs to be continually recomputed asnew information is discovered. A process-based client-server approach is presented that permits concurrentsensor-based map and localization-correction updatesas well as concurrent path computation and execution.Laplaces equation is constantly solved (i.e., a harmonicfunction) by using an iteration kernel convolved withan occupancy-grid representation of the current freespace. The path produced (i.e., by steepest gradientdescent on the harmonic function) is optimal in thesense of minimizing the distance to the goal as well asa hitting probability. This helps alleviate the in uenceof uncertainty on path planning. An initial heuristicestimate provides the path planner with instantaneousresponse (i.e., reactive), but with some deliberation it isable to produce optimal paths. In addition, the compu-tation time for generating the path is insigni cant pro-vided that the harmonic function has converged. Ona regular grid, the computation of the harmonic func-tion is linear in the total number of grid elements. Aquad-tree representation is used to minimize the com-putation time by reducing the number of grid elementsand minimally representing large spaces void of obsta-cles and goals. IntroductionSensor-based discover path planning is the guidance ofan agent - a robot - without a complete a priori map,by discovering and negotiating with the environment soas to reach a goal location while avoiding all encoun-tered obstacles. A robot must not only be able to createand execute plans, but must be willin

文档评论(0)

l215322 + 关注
实名认证
内容提供者

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

1亿VIP精品文档

相关文档