OPTIMAL TRAJECTORIES OF OPEN-CHAIN ROBOT SYSTEMS - A NEW SOLUTION PROCEDURE WITHOUT LAGRANGE MULTIPLIERS

Citation
Sk. Agrawal et al., OPTIMAL TRAJECTORIES OF OPEN-CHAIN ROBOT SYSTEMS - A NEW SOLUTION PROCEDURE WITHOUT LAGRANGE MULTIPLIERS, Journal of dynamic systems, measurement, and control, 120(1), 1998, pp. 134-136
Citations number
4
Categorie Soggetti
Robotics & Automatic Control","Robotics & Automatic Control","Instument & Instrumentation
ISSN journal
00220434
Volume
120
Issue
1
Year of publication
1998
Pages
134 - 136
Database
ISI
SICI code
0022-0434(1998)120:1<134:OTOORS>2.0.ZU;2-F
Abstract
For an n d.o.f. robot system, optimal trajectories using Lagrange mult ipliers are characterized by 4n first-order nonlinear differential equ ations with 4n boundary conditions at the two end time. Numerical solu tion of such two-point boundary value problems with shooting technique s is hard since Lagrange multipliers can not be guessed. In this paper , a new procedure is proposed where the dynamic equations are embedded into the cost functional. It is shown that the optimal solution satis fies n fourth-order differential equations. Due to absence of Lagrange multipliers, the two-point boundary-value problem can be solved effic iently and accurately using classical weighted residual methods.