首页> 外文期刊>optimal control applications and methods >Solving constrained minimum‐time robot problems using the sequential gradient restoration algorithm
【24h】

Solving constrained minimum‐time robot problems using the sequential gradient restoration algorithm

机译:Solving constrained minimum‐time robot problems using the sequential gradient restoration algorithm

获取原文
           

摘要

AbstractIn this paper three constrained minimum‐time control problems of a two‐link manipulator are solved using the sequential gradient and restoration algorithm (SGRA). In addition to the hard bounds on the control torques commonly considered in the literature, we also consider cases with bounded output power and with a constrained shoulder arm. The inequality constraints considered are reduced via Valentine‐type transformations to non‐differential path equality constraints. The SGRA is then used to solve these transformed problems with equality constraints. The results obtained indicate that at least one of the two controls is at its limits at any instant in time. The remaining control then adjusts itself so that none of the system constraints is violated. Hence the minimum‐time control is either a pure bang–bang control or a combined bang—bang/sin

著录项

获取原文

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号