首页> 外文会议>International Conference on Life System Modeling and Simulation(LSMS 2007); 20070914-17; Shanghai(CN) >Repetitive Motion Planning of Redundant Robots Based on LVI-Based Primal-Dual Neural Network and PUMA560 Example
【24h】

Repetitive Motion Planning of Redundant Robots Based on LVI-Based Primal-Dual Neural Network and PUMA560 Example

机译:基于LVI的Primal-Dual神经网络和PUMA560实例的冗余机器人重复运动计划

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

摘要

A primal-dual neural network based on linear variational inequalities (LVI) is presented in this paper, which is used to solve the repetitive motion planning of redundant robots. To do so, a drift-free criterion is exploited. In addition, the physical constraints such as joint limits and joint velocity limits are incorporated into the problem formulation of such a scheme. The scheme is finally reformulated as a quadratic programming (QP) problem and resolved at the velocity-level. Compared to other computational strategies on inverse kinematics, the LVI-based primal-dual neural network is designed based on the QP-LVI conversion and Karush-Kuhn-Tucker (KKT) conditions. With simple piecewise-linear dynamics and global (exponential) convergence to optimal solutions, it can handle general QP and linear programming (LP) problems in the same inverse-free manner. The repetitive motion planning scheme and the LVI-based primal-dual neural network are simulated based on PUMA560 robot manipulator with effectiveness demonstrated.
机译:提出了一种基于线性变分不等式(LVI)的原对偶神经网络,用于求解冗余机器人的重复运动规划。为此,采用了无漂移标准。另外,诸如关节极限和关节速度极限的物理约束被并入这种方案的问题公式中。该方案最终被重新表述为二次规划(QP)问题,并在速度级别上得到解决。与其他逆运动学计算策略相比,基于QVI-LVI转换和Karush-Kuhn-Tucker(KKT)条件设计了基于LVI的原始-对偶神经网络。通过简单的分段线性动力学和全局(指数)收敛到最优解,它可以以相同的无逆方式处理一般的QP和线性规划(LP)问题。在PUMA560机器人操纵器上仿真了重复运动计划方案和基于LVI的原始-双重神经网络,并证明了其有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号