动态环境下移动对象导航系统相关技术的研究计算机科学与技术专业论文.docxVIP

动态环境下移动对象导航系统相关技术的研究计算机科学与技术专业论文.docx

  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文档。上传文档
查看更多
动态环境下移动对象导航系统相关技术的研究计算机科学与技术专业论文

Abstract In recent years, because of the rapid development of wireless communication, wearable computers and mobile computing technology, mobile objects have been used in more and more areas. On the other hand, since the rapid development of GPS and sensor technology, navigation system whose main target is to give the location-related service has been widely used. This paper will focus on two most important parts of the navigation system:Path planning and location query. In dynamic environment, due to the limit of communication bandwidth, moving objects themselves, database storage space and other factors, it is impossible to track moving objects in real time and store their exact location at all times, we can only record some information at specific time. For the range location query, the papers goal is to estimate the location of mobile information and then give a probability answer. This paper presents a specific model, index structure and the corresponding querying algorithm. Classic path planning algorithms are mainly used in static environment. For dynamic environment, if the environment is changed, we could only update the environment information and rerun the algorithm again, this is inefficient: the second run of the algorithm cannot use the information acquired by the first run, their running time is almost equal. In nature,ant colony can find a best path under frequently changed environment, similarly, the ant algorithm has inherent robustness and can also find an optimal path. But the ant colony optimization algorithm has many deficiencies, such as using relatively long time, slow speed of convergence as the result of negative feedback effects of the congested section. In order to overcome these shortcomings, this paper proposes a path planning algorithm framework under dynamic environment: It not only retains the useful information of last run, which avoids re-running the algorithm and saves a lot of time, and also introduces the local-shaking technolo

您可能关注的文档

文档评论(0)

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

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

1亿VIP精品文档

相关文档