首页 /研究 /Improving the Efficiency of Time-Optimal Path-Following Algorithms
MANIPULATION

Improving the Efficiency of Time-Optimal Path-Following Algorithms

J.-J.E. Slotine, Hyun Seok Yang

发表年份
1988
引用次数
19

摘要

This paper presents a new method which significantly improves the computational efficiency of time-optimal path-following planning algorithms for robot manipulators with limited actuator torques. The approach exploits the fact that the characteristic switching points of earlier techniques can be found directly in a straightforward fashion. Numerical examples, while showing the consistency of the algorithm with the existing techniques, demonstrate its potential for increasing computational efficiency by several orders of magnitude.

关键词

Computer sciencePath (computing)Computational complexity theoryAlgorithmConsistency (knowledge bases)ExploitMotion planningActuatorTorqueRobot

相关论文

查看 MANIPULATION 分类全部论文