首页> 外文会议>2012 9th International Conference on Ubiquitous Robots and Ambient Intelligence. >Path planning through maze routing for a mobile robot with nonholonomic constraints
【24h】

Path planning through maze routing for a mobile robot with nonholonomic constraints

机译:具有非完整约束的移动机器人的迷宫路径规划

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

摘要

A comprehensive technique to plan path for a mobile robot with nonholonomic constraints through maze routing technique has been presented. Our robot uses a stereo vision based approach to detect the obstacles by creating dense 3D point clouds from the stereo images. ROS packages have been implemented on the robot for specific tasks of providing: i) Linear and angular velocity commands, ii) Calibration and rectification of the stereo images for generating point clouds, iii) Simulating the URDF (Unified Robot Description Format) module in real time, with respect to the real robot and iv) For visualizing the sensor data. For efficient path planning a hybrid technique using Lee's algorithm, modified by Hadlock and Soukup's algorithm has been implemented. Different path planning results have been shown using the maze routing algorithms. Preliminary results shows that Lee's algorithm is more time consuming in comparison with other algorithms. A hybrid of Lee's with Soukup's algorithm is more efficient but unpredictable for minimal path. A hybrid of Lee's with Hadlock's algorithm is the most efficient and least time consuming.
机译:提出了一种通过迷宫路由技术来规划具有非完整约束的移动机器人路径的综合技术。我们的机器人使用基于立体视觉的方法,通过根据立体图像创建密集的3D点云来检测障碍物。 ROS软件包已在机器人上实现,用于执行以下特定任务:i)线速度和角速度命令; ii)校准和校正用于生成点云的立体图像; iii)实际模拟URDF(统一机器人描述格式)模块相对于真实机器人的时间;以及iv)用于可视化传感器数据。为了进行有效的路径规划,已经实现了使用Lee算法的混合技术,该算法经过Hadlock和Soukup算法的修改。使用迷宫路由算法显示了不同的路径规划结果。初步结果表明,与其他算法相比,Lee算法更耗时。 Lee's与Soukup算法的混合体效率更高,但对于最小路径却无法预测。 Lee's与Hadlock算法的混合是最有效且最省时的。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号