【24h】

A Mobile Computing Approach for Navigation Purposes

机译:一种用于导航目的的移动计算方法

获取原文
获取原文并翻译 | 示例

摘要

The mobile computing technology has been rapidly increased in the past decade; however there still exist some important constraints which complicate the use of mobile information systems. The limited resources on the mobile computing would restrict some features that are available on the traditional computing technology. In almost all previous works it is assumed that the moving object cruises within a fixed altitude layer, with a fixed target point, and its velocity is predefined. In addition, accessibility to up-to-date knowledge of the whole mobile users and a global time frame are prerequisite. The lack of two last conditions in a mobile environment is our assumptions. In this article we suggest an idea based on space and time partitioning in order to provide a paradigm that treats moving objects in mobile GIS environment. A method for finding collision-free path based on the divide and conquer idea is proposed. The method is, to divide space-time into small parts and solve the problems recursively and the combination of the solutions solves the original problem. We concentrate here on finding a near optimal collision-free path because of its importance in robot motion planning, intelligent transportation system (ITS), and any mobile autonomous navigation system.
机译:在过去的十年中,移动计算技术得到了迅速的发展。然而,仍然存在一些重要的约束条件,使移动信息系统的使用变得复杂。移动计算上有限的资源将限制传统计算技术上可用的某些功能。在几乎所有以前的工作中,都假设移动物体在具有固定目标点的固定高度层内巡航,并且其速度是预先定义的。此外,必须具备访问整个移动用户的最新知识和全球时间框架的先决条件。在移动环境中缺少最后两个条件是我们的假设。在本文中,我们提出了一种基于时空划分的思想,以提供一种在移动GIS环境中处理移动对象的范例。提出了一种基于分而治之思想的无碰撞路径寻找方法。方法是将时空分成小部分并递归解决问题,解决方案的组合解决了原来的问题。由于它在机器人运动计划,智能运输系统(ITS)和任何移动自主导航系统中的重要性,因此我们将重点放在寻找接近最佳的无碰撞路径上。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号