...
首页> 外文期刊>Journal of Mechanisms and Robotics: Transactions of the ASME >Task-Constrained Optimal Motion Planning of Redundant Robots Via Sequential Expanded Lagrangian Homotopy
【24h】

Task-Constrained Optimal Motion Planning of Redundant Robots Via Sequential Expanded Lagrangian Homotopy

机译:通过顺序扩大拉格朗日同型冗余机器人的任务约束最佳运动规划

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

摘要

Real-time motion planning of robots in a dynamic environment requires a continuous evaluation of the determined trajectory so as to avoid moving obstacles. This is even more challenging when the robot also needs to perform a task optimally while avoiding the obstacles due to the limited time available for generating a new collision-free path. In this paper, we propose the sequential expanded Lagrangian homotopy (SELH) approach, which is capable of determining the globally optimal robot's motion sequentially while satisfying the task constraints. Through numerical simulations, we demonstrate the capabilities of the approach by planning an optimal motion of a redundant mobile manipulator performing a complex trajectory. Comparison against existing optimal motion planning approaches, such as genetic algorithm (GA) and neural network (NN), shows that SELH is able to perform the planning at a faster rate. The considerably short computational time opens up an opportunity to apply this method in real time; and since the robot's motion is planned sequentially, it can also be adjusted to accommodate for dynamically changing constraints such as moving obstacles.
机译:动态环境中机器人的实时运动规划需要对所确定的轨迹进行连续评估,以避免移动障碍物。当机器人也需要最佳地执行任务时,这更具挑战性,同时避免由于用于生成新的碰撞路径的有限时间而避免障碍物。在本文中,我们提出了顺序扩展拉格朗日同型(Selh)方法,其能够在满足任务约束的同时顺序确定全局最佳机器人的运动。通过数值模拟,我们通过规划执行复杂轨迹的冗余移动机械手的最佳运动来展示该方法的能力。与现有最佳运动规划方法的比较,例如遗传算法(GA)和神经网络(NN),示出了Selh能够以更快的速率执行规划。相当短的计算时间开辟了一个实时应用这种方法的机会;由于机器人的运动顺序地,也可以调节以适应动态改变诸如移动障碍物的约束。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号