Home /Research /Optimal Trajectories of Open-Chain Robot Systems: A New Solution Procedure Without Lagrange Multipliers
OTHER

Optimal Trajectories of Open-Chain Robot Systems: A New Solution Procedure Without Lagrange Multipliers

Sunil K. Agrawal, Pana Claewplodtook, Brian C. Fabien

Year
1998
Citations
4

Abstract

For an n d.o.f. robot system, optimal trajectories using Lagrange multipliers are characterized by 4n first-order nonlinear differential equations with 4n boundary conditions at the two end time. Numerical solution of such two-point boundary value problems with shooting techniques 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 satisfies n fourth-order differential equations. Due to absence of Lagrange multipliers, the two-point boundary-value problem can be solved efficiently and accurately using classical weighted residual methods.

Keywords

Lagrange multiplierMathematicsConstraint algorithmBoundary value problemNonlinear systemShooting methodApplied mathematicsPoint (geometry)Mathematical optimizationMathematical analysis

Related papers

Browse all OTHER papers