Optimization techniques applied to multiple manipulators for path planning and torque minimization

نویسندگان

  • Devendra P. Garg
  • Manish Kumar
چکیده

This paper presents the formulation and application of a strategy for the determination of an optimal trajectory for a multiple robotic configuration. Genetic Algorithm (GA) and Simulated Annealing (SA) have been used as the optimization techniques and results obtained from them compared. First, the motivation for multiple robot control and the current state-of-art in the field of cooperating robots are briefly given. This is followed by a discussion of energy minimization techniques in the context of robotics, and finally, the principles of using genetic algorithms and simulated annealing as an optimization tool are included. The initial and final positions of the end effector are specified. Two cases, one of a single manipulator, and the other of two cooperating manipulators carrying a common payload illustrate the proposed approach. The GA and SA techniques identify the optimal trajectory based on minimum joint torque requirements. The simulations performed for both the cases show that although both the methods converge to the global minimum, the SA converges to solution faster than the GA. r 2002 Elsevier Science Ltd. All rights reserved.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Near-Minimum-Time Motion Planning of Manipulators along Specified Path

The large amount of computation necessary for obtaining time optimal solution for moving a manipulator on specified path has made it impossible to introduce an on line time optimal control algorithm. Most of this computational burden is due to calculation of switching points. In this paper a learning algorithm is proposed for finding the switching points. The method, which can be used for both ...

متن کامل

Optimal Path Planning and Task Adjustment for Cooperative Flexible Manipulators

Accuracy and energy consumption are key aspects to be considered when using serial manipulators in industrial environment. Affordable operational and maintenance costs are very important issues for automated processes. However, high performance robots also require increasing precision when performing sophisticated tasks. In this paper a method for optimal path planning and task adjustment of co...

متن کامل

Joint Selection Criterion for Optimal Trajectory Planning for Robotic Manipulators Using Dynamic Programming

This paper presents a joint selection criterion for optimal trajectory planning using dynamic programming along a specified geometric path subject to torque and velocity constraints. A single non-stationary joint is normally considered for optimization purpose. In case of more than one non-stationary joints, the optimization by selecting any joint at random may end up with a non-optimal solutio...

متن کامل

Optimal Trajectory Planning for Minimum Vibration of Flexible Redundant Cooperative Manipulators

The optimal path planning for two flexible cooperating manipulators carrying a solid object on a prescribed tip trajectory has been studied using kinematic resolution. The formulation has been derived using the Pontryagin minimum principle that results in a two-point boundary value problem. Also, a numerical technique based on converting the abstract optimization to parametric optimization prob...

متن کامل

Optimal Trajectory Planning of a Mobile Robot with Spatial Manipulator For Spatial Obstacle Avoidance

Mobile robots that consist of a mobile platform with one or many manipulators mounted on it are of great interest in a number of applications. Combination of platform and manipulator causes robot operates in extended work space. The analysis of these systems includes kinematics redundancy that makes more complicated problem. However, it gives more feasibility to robotic systems because of the e...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002