Using Biased Randomization for Trajectory Optimization in Robotic Manipulators

Author(s):  
Alba Agustín ◽  
Alberto Olivares ◽  
Ernesto Staffetti
Robotica ◽  
2014 ◽  
Vol 34 (6) ◽  
pp. 1322-1334 ◽  
Author(s):  
Zeeshan Shareef ◽  
Ansgar Trächtler

SUMMARYIn robotics, path planning and trajectory optimization are usually performed separately to optimize the path from the given starting point to the ending point in the presence of obstacles. In this paper, path planning and trajectory optimization for robotic manipulators are solved simultaneously by a newly developed methodology called Discrete Mechanics and Optimal Control (DMOC). In DMOC, the Lagrange–d'Alembert equation is discretized directly unlike the conventional variational optimization method in which first the Euler–Lagrange equations are derived and then discretization takes place. In this newly developed method, the constraints for optimization of a desired objective function are the forced discrete Euler–Lagrange equations. In this paper, DMOC is used for simultaneous path planning and trajectory optimization for robotic manipulators in the presence of known static obstacles. Two numerical examples, applied on a DELTA parallel robot, are discussed to show the applicability of this new methodology. The optimal results obtained from DMOC are compared with the other state-of-the-art techniques. The difficulties and problems associated in using the DMOC for Parallel Kinematic Machine (PKM) are also discussed in this paper.


Sign in / Sign up

Export Citation Format

Share Document