首页 /研究 /Decomposition method for the constrained path planning of articulated systems
OTHER

Decomposition method for the constrained path planning of articulated systems

Arben Çela, Yskandar Hamam, D. Georges

发表年份
1991
引用次数
4

摘要

This paper describes a general approach to the optimal path planning of industrial robots. The proposed method is based on nonlinear programming, decomposition-coordination and feedback decoupling and linearization. The optimal path is obtained through the optimization of a time-energy criterion for the linearized model by static feedback. The proposed method does not suffer from curse of dimensionality. Decomposition of the original optimization problem at the joints levels makes possible parallel processing and reduces substantially the CPU time needed. The application of this control scheme to an n-link articulated system is developed in details. It is programmed on VAX-station and is used as a CACSD tool for controlling the PAMIR robot developed at the Control Laboratory of ESIEE.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

关键词

Decoupling (probability)Curse of dimensionalityDecompositionLinearizationComputer sciencePath (computing)RobotFeedback linearizationMathematical optimizationMotion planning

相关论文

查看 OTHER 分类全部论文