首页> 外文会议>Latest trends on circuits, systems and signals >The proposed 3D Navigation Approach of an Autonomous Mobile robot
【24h】

The proposed 3D Navigation Approach of an Autonomous Mobile robot

机译:提出的自主移动机器人的3D导航方法

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

摘要

In this present work, we present an algorithm for path planning to a target for mobile robot in 3D unknown environment. The proposed algorithm allows a mobile robot to navigate through static obstacles, and finding the 3D path in order to reach the target without collision. Path planning is to generate a collision free path in an environment with obstacles with respect to some criterion. Trajectory planning is to schedule the movement of a mobile robot along the planned path. This algorithm provides the robot the possibility to move from the source position S to the target position T. The proposed 3D path finding strategy is designed in an unknown environment with static unknown obstacles. The robot moves within this unknown environment by sensing and avoiding the 3D obstacles coming across its way towards the target. This navigation is done by using a set creation IP (intersection points) and the results of {2*n select mode], n is the number of non linear segments that are above or below the linear path ST in collision with the obstacle. We multiply by (02) two because each time we check two selected intersection points that are belonging to the perimeter of the obstacle and are in the open list of new intersection of the another obstacle. The 3D algorithm returns the best response of any entering map parameters. The key idea is around the main line from the source to the destination and the mth obstacle causing the collision where they construct the 3D feasible path (a set of non linear segments) which is the neighbour of non linear safety size robot segments. The proposed 3D algorithm finds the optimal feasible path.
机译:在本工作中,我们提出了一种用于3D未知环境中移动机器人目标路径规划的算法。所提出的算法允许移动机器人导航通过静态障碍物,并找到3D路径以便在没有碰撞的情况下到达目标。路径规划是要在具有某些标准障碍的环境中生成无碰撞的路径。轨迹计划是为了计划移动机器人沿计划路径的移动。该算法为机器人提供了从源位置S移至目标位置T的可能性。所提出的3D路径查找策略是在具有静态未知障碍物的未知环境中设计的。机器人通过感知并避免3D障碍物越过目标而在未知环境中移动。通过使用设置的创建IP(交叉点)和{2 * n选择模式]的结果来完成此导航,n是与障碍物碰撞的位于线性路径ST上方或下方的非线性线段的数量。之所以乘以(02),是因为每次我们检查两个选定的相交点,它们属于障碍物的周长,并且在另一个障碍物的新相交的打开列表中,因此乘以(02)。 3D算法返回所有输入地图参数的最佳响应。关键思想是围绕从源到目的地的主线以及引起碰撞的第m个障碍物,在障碍物处构造3D可行路径(一组非线性段),该路径是非线性安全尺寸机器人段的邻居。所提出的3D算法找到了最佳可行路径。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号