首页> 外文学位 >Collision free path planning of an object using multiple robot manipulators.
【24h】

Collision free path planning of an object using multiple robot manipulators.

机译:使用多个机器人操纵器的无碰撞路径规划对象。

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

摘要

This thesis presents two algorithms for the path planning of robot manipulators, specifically for multiple manipulator systems attempting to transform a single object without the need for a closed form inverse kinematic solution for a specific manipulator. The first algorithm is a dual quaternion Jacobian based numerical inverse kinematic method. The Jacobian is formulated to transform the change in joint space of the manipulator to the change in dual quaternion transformation space of the manipulator's end effector. Joint space solutions are found that satisfy both the position and orientation of the end effector. The second algorithm is an adaptation of the sampling-based rapidly-exploring dense tree algorithm. The algorithm is adjusted to handle multiple manipulators cooperatively transforming a single object while avoiding environment collisions and invalid joint spaces. The tree generation algorithm forms extensions for the tree by extending the manipulators toward dual quaternion transformations of the object in the environment using the aforementioned numerical inverse kinematics algorithm. This avoids having to find random joint configurations of each manipulator that satisfy the closed link constraints caused by the grasps of each manipulator on the object. The algorithm is able to develop a path from an initial transformation to a goal transformation to the object using multiple robot manipulators. The algorithms presented are tested under a pair of simulation environments while varying the algorithm parameters as well as environment components such as the location of the manipulators as well as the presence of obstacles. Two seven degree of freedom Schunk manipulators were used for the experiments of this thesis.
机译:本文提出了两种用于机器人机械手路径规划的算法,特别是针对试图转换单个对象而不需要特定机械手的闭合形式逆运动学解决方案的多个机械手系统。第一种算法是基于双四元数雅可比矩阵的数值逆运动学方法。雅可比行列式的制定是将机械手关节空间的变化转换为机械手末端执行器的双四元数转换空间的变化。发现可以同时满足末端执行器位置和方向的关节空间解决方案。第二种算法是对基于采样的快速探索的密集树算法的改编。对该算法进行了调整,以处理多个机械手协同转换单个对象的情况,同时避免环境冲突和无效的关节空间。树生成算法通过使用上述数值逆运动学算法将操纵器向环境中对象的双四元数变换扩展,从而形成了树的扩展。这避免了必须找到每个操纵器的随机关节构造,该随机关节构造满足由每个操纵器在物体上的抓握所引起的闭合连杆约束。该算法能够使用多个机器人操纵器开发从初始转换到目标转换到对象的路径。所介绍的算法在一对模拟环境下进行测试,同时会改变算法参数以及环境组件(例如操纵器的位置以及是否存在障碍物)。本文使用了两个七个自由度的Schunk机械臂进行实验。

著录项

  • 作者

    Davis, Drew P.;

  • 作者单位

    University of Rhode Island.;

  • 授予单位 University of Rhode Island.;
  • 学科 Robotics.
  • 学位 M.S.
  • 年度 2014
  • 页码 65 p.
  • 总页数 65
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号