首页> 外文期刊>IEEE transactions on systems, man, and cybernetics. Part B, Cybernetics >Hierarchical Incremental Path Planning and Situation-Dependent Optimized Dynamic Motion Planning Considering Accelerations
【24h】

Hierarchical Incremental Path Planning and Situation-Dependent Optimized Dynamic Motion Planning Considering Accelerations

机译:考虑加速度的分层增量路径规划和基于情况的优化动态运动规划

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

摘要

This paper studies a hierarchical approach for incrementally driving a nonholonomic mobile robot to its destination in unknown environments. The algorithm is modified to handle a map containing unknown information. Based on it, optimal (discrete) paths are incrementally generated with a periodically updated map. Next, accelerations in varying velocities are taken into account in predicting the robot pose and the robot trajectory resulting from a motion command. Obstacle constraints are transformed to suitable velocity limits so that the robot can move as fast as possible while avoiding collisions when needed. Then, to trace the discrete path, the system searches for a waypoint-directed optimized motion in a reduced 1-D translation or rotation velocity space. Various situations of navigation are dealt with by using different strategies rather than a single objective function. Extensive simulations and experiments verified the efficacy of the proposed approach.
机译:本文研究了一种分层方法,用于逐步将非完整的移动机器人驱动到未知环境中的目的地。修改算法以处理包含未知信息的地图。基于此,将使用定期更新的地图增量生成最佳(离散)路径。接下来,在预测由运动命令产生的机器人姿态和机器人轨迹时,应考虑不同速度的加速度。障碍物约束被转换为合适的速度极限,以便机器人可以尽可能快地移动,同时在需要时避免碰撞。然后,为追踪离散路径,系统在缩小的一维平移或旋转速度空间中搜索航点定向的最佳运动。通过使用不同的策略而不是单个目标函数来处理各种导航情况。大量的仿真和实验验证了该方法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号