...
首页> 外文期刊>日本ロボット学会誌 >A numerical algorithm for optimal trajectory planning problems with multiple constraints and its application to nonholonomic systems
【24h】

A numerical algorithm for optimal trajectory planning problems with multiple constraints and its application to nonholonomic systems

机译:一种数字轨迹规划问题的数值算法及其在非完整系统中的应用

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

摘要

In this paper, we propose a novel gradient-type iterative algorithm for solving the optimal trajectory planning problems with multiple constraints. Since it is too difficult to generate trajectories considering all constraints at the same time, we introduce the concept of the order of priority into the trajectory generation procedure. In the proposed algorithm, a nominal trajectory is iteratively improved considering the order of priority of the constraints. The procedure is executed based on the gradient function which is synthesized in a hierarchical manner so that the convergence rate of the constraint with lower priority does not change the one with higher priority. The convergence properties of the proposed algorithm are examined. A method to improve the convergence properties when we apply the algorithm to the problem of nonholonomic systems is also proposed. The simulation results of planning trajectories for a 3-DOF planar free-joint manipulator show the effectiveness of the proposed algorithm.
机译:在本文中,我们提出了一种新颖的梯度迭代算法,用于解决多个约束的最佳轨迹规划问题。由于在同时考虑所有约束的轨迹太难,因此我们将优先顺序的概念介绍到轨迹生成过程中。在所提出的算法中,考虑到约束的优先级顺序,迭代地提高标称轨迹。该过程基于以分层方式合成的梯度函数来执行,使得具有较低优先级的约束的收敛速率不会改变具有更高优先级的。检查了所提出的算法的收敛性。还提出了一种改进收敛特性的方法,当我们将算法应用于非完整系统的问题时。三自由度平面自由联合机械手规划轨迹的仿真结果表明了该算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号