全局未知环境下多机器人运动蚂蚁导航算法-软件学报.PDFVIP

全局未知环境下多机器人运动蚂蚁导航算法-软件学报.PDF

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
全局未知环境下多机器人运动蚂蚁导航算法-软件学报

ISSN 1000-9825, CODEN RUXUEW E-mail: jos@ Journal of Software, Vol.17, No.9, September 2006, pp .1890−1898 http://www.j DOI: 10. 1360/jos171890 Tel/Fax : +86-10 © 2006 by Journal of Software. All rights reserved. ∗ 全局未知环境下多机器人运动蚂蚁导航算法 朱庆保+ (南京师范大学 计算机科学系,江苏 南京 210097) Ant Algorithm for Navigation of Multi-Robot Movement in Unknown Environment ZHU Qing-Bao+ (Department of Computer Science, Nanjing Normal University, Nanjing 210097, China) + Corresponding author: Phn: +86-25 Fax: +86-25 E-mail: qbzhu@ Zhu QB. Ant algorithm for navigation of multi-robot movement in unknown environment. Journal of Software, 2006,17(9):1890−1898. /1000-9825/17/1890.htm Abstract: The navigation problem of multi-robot movement in a complex and unknown environment is studied in the paper. A new algorithm, ants navigation algorithm, is presented. At the start the method maps the global targets onto the area near the border of the robot ’s eyeshot, and takes them as the local targets. Then two groups of ants will be cooperating to complete the search for the local optimal path in the robot ’s eyeshot. Based on these configurations, the algorithm can predict possible collision with other robots and execute subsequent avoidance plans. The local search will be executed by the algorithm repetitively whenever the robot progresses a step. So, the path of the robot will be altered dynamically, which makes the robot move on the global optimal path to the ending node. The simulation results indicate that the optimal path, which the robot moves on, can lead the robot to reach the end safely even in complicated geographical environment. The effect is very satisfactory. Key

文档评论(0)

2105194781 + 关注
实名认证
文档贡献者

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

1亿VIP精品文档

相关文档