International Journal of Modern Engineering Research (IJMER)              www.ijmer.com               Vol. 2, Issue. 5, Se...
International Journal of Modern Engineering Research (IJMER)                  www.ijmer.com             Vol. 2, Issue. 5, ...
International Journal of Modern Engineering Research (IJMER)                   www.ijmer.com                    Vol. 2, Is...
International Journal of Modern Engineering Research (IJMER)               www.ijmer.com               Vol. 2, Issue. 5, S...
International Journal of Modern Engineering Research (IJMER)              www.ijmer.com             Vol. 2, Issue. 5, Sep....
Upcoming SlideShare
Loading in …5
×

Optimal Motion Planning For a Robot Arm by Using Artificial Bee Colony (ABC) Algorithm

644 views

Published on

http://www.ijmer.com/papers/Vol2_Issue6/DE2644344438.pdf

Published in: Technology
0 Comments
0 Likes
Statistics
Notes
  • Be the first to comment

  • Be the first to like this

No Downloads
Views
Total views
644
On SlideShare
0
From Embeds
0
Number of Embeds
2
Actions
Shares
0
Downloads
21
Comments
0
Likes
0
Embeds 0
No embeds

No notes for slide

Optimal Motion Planning For a Robot Arm by Using Artificial Bee Colony (ABC) Algorithm

  1. 1. International Journal of Modern Engineering Research (IJMER) www.ijmer.com Vol. 2, Issue. 5, Sep.-Oct. 2012 pp-4434-4438 ISSN: 2249-6645 Optimal Motion Planning For a Robot Arm by Using Artificial Bee Colony (ABC) Algorithm P.V. Savsani, 1 R. L. Jhala, 2 1 (Research Scholar PAHER University, Udaipur, Rajasthan, India) 2(Professor, Marwadi Education Foundation, Dept. of Mech. Engg.,Gujarat, India)Abstract: This work is concentrated to optimize the arms of the interception of a fast maneuvering object. Thetrajectory for planer two-link robot. The whole travel of the authors employed the guidance law throughout the trackingtrajectory is divided into two parts, which consists of fourth phase, and dynamic constraints such as torque and velocityorder polynomial trajectory for the one part and fifth order constraints and satisfied the matching condition of thetrajectory for the second part. There are many optimization position and velocity at the time of the interceptionalgorithms, which can be implemented to solve such altogether.problems. Evolutionary algorithms are also tried by many Garg and M. Kumar [8] use GA techniques forresearchers to solve such trajectory optimization problems. robot arm to identify the optimal trajectory based onEvolutionary algorithms are capable of giving global minimum joint torque requirements. The authors useoptimum solution and traditional optimization techniques polynomial of 4th degree in time for trajectoryconverge to local optima and so they are not suitable for the representation to joint space variables. Pires and Machadotrajectory problems. In this work artificial bee colony [10] propose a path planning method based on a GA while(ABC) algorithm is implemented to solve trajectory adopting the direct kinematics and the inverse dynamics.optimization problem. The objective function for the The optimal trajectory is the one that minimize the pathproposed ABC is to minimize traveling time and space, length, the ripple in the time evolution and the energywhile not exceeding a maximum pre-defined torque. The requirements, without any collision with the obstacle in theobjective function consist of four parameter, excessive workspace. S. G. Yue et al. [4] focused on the problem ofdriving torque, total joint traveling distance, total joint point-to-point trajectory planning of flexible redundantCartesian length and total consumed time for robot motion. robot manipulator (FRM) in joint space. The proposed trajectory to minimize vibration of FRMs is based on GA.Keywords: Artificial bee colony algorithm, 2R robotic arm, Pires et al [5] use genetic algorithm to optimize aTrajectory. planar robot manipulator trajectory. The main purpose of this paper is to present the optimum robot trajectory in free I. INTRODUCTION workspace and obstacle existence workspace by using ABC. Many researches on optimal trajectory planning In the first part of the work mathematical model is formed.have been reported in free workspace as well as in obstacle In the second part optimization of the developed robotexistence work space. The evolutionary algorithm is trajectory is done by using ABC.extensively used as practical optimization computationmethods, because of the advantage that this algorithm can II. ARTIFICIAL BEE COLONY (ABC)avoid local optimum value. This work focused on the TECHNIQUEtrajectory optimization of 2R robotic arm in free work space Artificial Bee Colony (ABC) Algorithm is anas well as circular obstacle existence robot work space using optimization algorithm based on the intelligent foragingABC. Forth order and fifth order polynomials are used to behaviour of honey bee swarm. The colony of artificial beesdescribe the segments that connect initial, intermediate and consists of three groups of bees: employed bees, onlookersfinal point at joint space. and scouts [9,11,12]. An employed bee searches the In last year’s, evolutionary algorithms have been destination where food is available. They collect the foodapplied in large number of fields. An optimal galloping and returns back to its origin where they perform waggletrajectory proposed by Giju Chae and Jong Hyeon Park[2] dance depending on the amount of food available at thewhich cost low energy and guarantees the stability of the destination. The onlooker bee watches the dance andquadruped robot. They optimized trajectory based on energy follows employed bee depending on the probability of theand stability using GA, which provides a robust and global available food means more onlooker bee will follow thesolution to a multi-body, highly nonlinear dynamic system. employed bee associated with the destination having moreFor generating smooth trajectory planning for specified amount of food. The employed bee whose food sourcepath, Zoller and Zentan [3] focused on the problem of the becomes abandoned convert into a scout bee and it searchestrajectory planning and dealt with constant kinetic energy for the new food source. For solving optimization problemsmotion planning. This method produced trajectory the population is divided into two parts consisting ofcharacteristics smoother and better than which did obtained employed bees and onlooker bees. An employed beefrom time optimal method. Zhe Tang et al. [6] proposed a searches the solution in the search space and the value ofthird–order spline interpolation based trajectory-planning objective function associated with the solution is the amountmethod to plan a smooth biped swing leg trajectory by of food associated with that solution. Employed bee updatesreducing the instant velocity change. its position using Equation (1) and it updates new position if Chwa et al. [7] proposed Missile Guidance it is better than the previous position, i.e it follows greedyAlgorithm to generate on–line trajectory planning of robot selection. www.ijmer.com 4434 | Page
  2. 2. International Journal of Modern Engineering Research (IJMER) www.ijmer.com Vol. 2, Issue. 5, Sep.-Oct. 2012 pp-4434-4438 ISSN: 2249-6645 vij  xij  Rij ( xij  xkj ) Step 5 (1) Calculate probability associated with the different solutions using Equation (2). Onlooker bee follows a Where vij is the new position of employes bee, xij is solution depending on the probability of that solution. Sothe current position of employed bee, k is a random number more the probability of the solution more will be thebetween (1, N(population size)/2) ≠ i and j =1, 2,...,Number onlooker bee following that solution.of design variables. Rij is a random number between (-1, 1).An onlooker bees chooses a food source depending on the Step 6probability value associated with that food source, pi , Update the position of onlooker bees usingcalculated using Equation (2). Equation (1). If the value of objective function of the new solution is better than the existing solution, replace the Fipi  N /2 existing solution with the new one F n1 n Step 7 (2) Identify abandon solution and replace it with the Where Fi is the fitness value of the solution i and newly generated solution using Equation (3)N/2 is the number of food sources which is equal to thenumber of employed bees. Step 8 The Employed bee whose position of the food Continue all the steps from step 3 until thesource cannot be improved for some predetermined number specified number of generations are reached.of cycles than that food source is called abandoned foodsource. That employed bee becomes scout and searches for III. MATHEMATICAL MODELLINGthe new solution randomly using Equation (3). For the present work two degree of freedom planar robotic arm is considered as shown in figure 1, where thexij  xmin  rand (0,1)( xmax  xmin ) j j j endeffector is required to move from starting point to goal (3) point in free work space as well as without colliding with the obstacle in work space. For the motion planning, point- The value of predetermined number of cycles is an to-point trajectory is taken which is connected by severalimportant control parameter of the ABC algorithm, which is segments with continuous acceleration at the intermediatecalled ―limit‖ for abandonment. The value of limit is via point. ABC is used as optimization tool.generally taken as Number of employed bees.Step by step procedure for the implementation of ABC isgiven as follows.Step 1 Initialize ABC parameters which are necessary forthe algorithm to proceed. These parameters includespopulation size which indicates the number of employedbees and onlooker bees, number of generations necessaryfor the termination criteria, value of limit, number of designvariables and respective range for the design variables.Step 2 Generate random population equal to thepopulation size specified. Each population member contains Figure 1 Two degree of freedom planar robotic armthe value of all the design variables. This value of designvariable is randomly generated in between the design For the motion planning, point-to-point trajectoryvariable range specified. First half of the population will is taken which is connected by several segments withconsist of employed bees. Each population member continuous acceleration at the intermediate via point asassociated with employed bees indicates each food source. shown in figure 2. For a robot, the number of degrees of freedom of a manipulator is n and the number of end-Step 3 effectors degree of freedom is m. If one wishes to be able toObtain the value of objective function for employed bees. specify the position, velocity, and acceleration at theThe value of objective function so obtained indicates the beginning and the end of a path segment, a fourth order andamount of nectar (food) associated with that destination a fifth order polynomial are used. Let us assume that there is(food source). mp intermediate via points between the initial and final points[1 ].Step 4 Update the position of employed bees using  i ,i 1 t   ai 0  ai1ti  ai 2ti2  ai 3ti3  ai 4ti4 ,Equation (1). If the value of objective function of the newsolution is better than the existing solution , replace the i  0,...., mp  1 (4)existing solution with the new one. www.ijmer.com 4435 | Page
  3. 3. International Journal of Modern Engineering Research (IJMER) www.ijmer.com Vol. 2, Issue. 5, Sep.-Oct. 2012 pp-4434-4438 ISSN: 2249-6645Where (ai0,…,ai4) are constants, and the constraint are given of the final configuration (n-m). Therefore, for 2-link robotas: case, it used mp= 1, n =2 and one degree of freedom of redundancy for the final point, there are six parameters to be determined. IV. FITNESS FUNCTION Present robot trajectory use the four parameters to meet the criteria of the robotic manipulator in free work space. All parameters are translated into penalty functions to be minimized. Each parameter is computed individually and is integrated in the fitness function evaluation. The fitness function ff adopted for evaluating the aspirant trajectories is defined as: f f  1 f ot   2 f q   3 f c   4 tT Figure 2 Intermediate point on planed trajectory (18) i  ai 0 (5) The optimization goal consists in finding a set of design parameters that minimize ff according to the i 1  ai 0  ai1Ti  ai 2Ti 2  ai 3Ti 3  ai 4Ti 4 (6) priorities given by the weighting factors βi (i = 1,.., 4), where each different set of weighting factors must results in .  ai1 (7) a different solution. For this work the weight factors are, . 1 ,  2 ,  3 ,  4    ,2,2,1 . 1 i 1  ai1  2ai 2Ti  3ai 3Ti 2  4ai 4Ti 3 (8) .. The fot index represents the amount of excessive  2a i 2 (9) driving, in relation to the maximum torque τi max, that is demanded for the ith joint motor for the trajectory. The index fq represents the total joint traveling distance of the Where Ti is the execution time from point i to point manipulator, The index fc represents total Cartesiani+1. The five unknowns can be solved as[1]. The trajectory length and The index tT represents the totalintermediate point (i+1)s acceleration can be obtained as: consumed time for robot motion. All four index are .. i 1  2ai 2  6ai 3Ti  12ai 4Ti 2 (10) calculated as given in [1]. For obstacle existence workspace, obstacle avoidance objective function fob has beenThe segment between the number mp of intermediate points combined with free space fitness function to form over alland the final point can be described by fifth order fitness function f, as shown below:polynomial as: i ,i 1 (t )  bi 0  bi1ti  bi 2ti2  bi 3ti3  bi 4ti4  bi 5ti5 , f  f f / f ob (20)(i  mp) (11)Where the constraints are given as: By fob, the robot manipulator has the ability to i  bi 0 (12) avoid the obstacle collision during its movement from point to point in side the workspace and it is calculated as [1]. Fori1  bi 0  bi1T ibi 2Ti 2  bi 3Ti 3  bi 4Ti 4  bi 5Ti 5 (13) the present work six parameter are optimized : . i  bi1 (14)  . . .  q1 , q2 , q3, q1 , q 2 , q 3 t1 , t 2    . i 1  bi1  2bi 2Ti  3bi 3Ti 2  4bi 4Ti 3 (15) Where qi and qi are intermediate joint angle and  5bi 5Ti 4 velocity for ith joint respectively, t1 is execution time from .. initial to intermediate via point, and t2 is execution time i  2bi 2 (16) from intermediate to final point. Limits of all the variables.. are as follows: i 1  2bi 2  6bi 3Ti  12bi 4Ti  20bi 5Ti 2 3 (17)    qi   (21) In addition, these constraints specify a linear set of .six equations with six unknowns whose solution is   / 4  q i   / 4 (22)explained in [1]. As formulated above, the total parametersto be determined are the joint angles of each intermediate 0.1  t i  8 (23)via point (n×mp parameters), the joint angular velocities ofeach intermediate point (n×mp parameters), the execution    q g   (24)time for each segment (mp+1 parameters), and the posture www.ijmer.com 4436 | Page
  4. 4. International Journal of Modern Engineering Research (IJMER) www.ijmer.com Vol. 2, Issue. 5, Sep.-Oct. 2012 pp-4434-4438 ISSN: 2249-6645Implementation of ABC For the case study, robotic arm movement isconsidered as motion of human hand, which start at (x=0 m,y= -0.76 m, ) and get final position (x= 0.76 m, y= 0).Various parameters for the illustration are taken as: Lengthof link 1 =0.3048 m ,Length of link 2=0.3048 m , Mass oflink 1 and 2= 175 gms. For ABC maximum generation=2000 and population= 10. The main target here is tominimizing traveling time and space, while not exceedingthe predefined torque(joint-1=45 N.m, joint-2=20N.m) ,infree workspace and without collision with any obstacle.Finally results of ABC are discussed. V. RESULTS AND DISCUSSION Trajectory of 2R robot is optimized using ABC. Figure 3 joint angle variation with respect to timeTable-1 shows total traveling time, total joint travelingdistance and total cartensian trajectory length for both freework space and obstacle avoidance work space.Table 1 Comparison of optimum results obtained in freeworkspace and obstacle existence workspaceResult value Free workspace Obstacle existence workspaceTotal traveling 2.0106 2.1078time(sec)Total joint 1.5776 6.6167travelingdistance(rad)Total Cartesian 3.1403 3.2623trajectorylength(m)Fitness value 11.2367 16.4495 As noted from the table 1 the values of all theparameters are more in obstacle existence workspace. Theamount of increment allows the robot to manipulate in thework space without colliding with obstacle. For theoptimum result function evaluation is taken as 20000 forboth free and obstacle existence workspace. Figure 3 shows the variation of joint angle withrespect to time in free robot workspace. Dotted linerepresents the variation of joint angle in free workspacewhile full line shows the angle variation in obstacleexistence workspace. Joint 1 angle varies from 0 to ~ -1.6rad in 2 sec when the arm moves in free workspace, while it Figure 4 torque variation with respect to timetakes more than 2 sec in obstacle existence workspace tocover the same range of angle. Joint 2 angle is almost zerowhen the robot arm moves in free workspace and variationof 0 to ~1.5 rad in is obtained when it moves in obstacleexistence workspace. Figure 5 fitness function with function evalution www.ijmer.com 4437 | Page
  5. 5. International Journal of Modern Engineering Research (IJMER) www.ijmer.com Vol. 2, Issue. 5, Sep.-Oct. 2012 pp-4434-4438 ISSN: 2249-6645 Figure 4 depicts that for both the workspace (free [5] Solteriro, P., Tenreiro, M., Moura O., 2003,and obstacle existence) torque for joint 1 and joint 2 are ―Fractional Order Dynamic in a Geneticwithin the predefined limit. Torque of joint 1 varies from 0 Algorithm‖.In:11th International Conference Onto ~33 Nm and joint 2 varies from 0 to ~ 12 Nm when robot Advanced Robotics, pp. 264-269. Colombia, Portugal.arm manipulate in free workspace over 2 sec. Manipulation [6] Tang, Z., Zhou, C., Sun Z. (2003). Trajectoryof robot arm in obstacle existence workspace gives the Planning For Smooth Transition of A Biped Robot.torque variation for joint 1( 0 to ~30 Nm) and joint 2 ( ~ -6 In:IEEE International Conference on Robotic &Nm to ~13Nm) over 2.1 sec. Automation,pp. 2455—2460. Fitness value variation with free and obstacle [7] Chwa, D., Kang, J., Im, K.,Choi, J. (2003). Robot Armexistence workspace is shown in figure 5. Fitness value in Trajectory Planning Using Missile Guidanceobstacle existence workspace is more than the fitness value Algorithm. In: SICE Annual Conference, pp. 2056-in free workspace. 2061. [8] Grag, P. , Kumar, M. (2002). Opimization Techniques VI. CONCLUSIONS Applied To Multiple Manipulators for Path Planning Trajectory planning method based on ABC with and Torque Minimization. Engineering Applicationsspecific objective functions is presented. Case study of of Artificial Intelligence,15(3), pp. 241-252.human motion is taken for the 2R planner robotic arm and [9] Savsani, V., Rao, R., Vakharia, D. P. (2010). Multitrajectory is optimized in free and obstacle existence objective optimization of mechanical elements usingworkspace. Comparison shows that fitness value for the artificial bee colony optimization technique. ASMEfree workspace is lesser than value in obstacle existence Early Career Technical Journalworkspace. The joint torque of the robot did not exceed its [10] Solteiro, P., Machado, J. (2000). A GA Perspective Ofmaximum pre-defined torque. Since ABC uses the direct The Energy Requirement For Manipulatorskinematics, the singularities do not constitute a problem. Maneuvering In A Workspace With Obstacles. Cec 2000-Congress On Evolutionary Computation, pp. REFERENCES 1110- -1116, Santiago, California, USA. [1] Kazem, I. B.,Mahdi, A. I.,Oudha, A. T. (2008). [11] Craig, J. (1989). Introduction to Robotics: Mechanics Motion Planning for a Robot Arm by Using Genetic and Control.Wesley Algorithm. Jordan Journal of Mech. and Ind. Engg. [12] Karaboga, D. (2005).An Idea Based On Honey Bee 2, pp. 131-136. Swarm For Numerical Optimization. Technical[2] Chae, G., Park, J., H. (2007). Galloping Trajectory Report-TR06, Erciyes University, Engineering Optimization and Control for Quadruped Robot Using Faculty, Computer Engineering Department. Genetic Algorithm. In: IEEE International Conference [13] Basturk, B. Karaboga, D. (2006). An Artificial Bee on Robotics and Biomimetics, pp. 1166-1171. Colony (ABC) Algorithm for Numeric function[3] Zoller, Z., Zentan, P. (1999). Constant Kinetic Energy Optimization. IEEE Swarm Intelligence Symposium, Robot Trajectory Planning. peridica polytechnicaser. May 12-14, Indianapolis, Indiana, USA. Mech. Eng., 43(2), pp. 213 – 228. [4] Yue, S.,G., Henrich, D., Xu, X., L., Toss, S.K. (2002). Point-to-Point Trajectory Planning of Flexible Redundant Robot Manipulators Using Genetic Algorithms. J. Robotica, 20, pp. 269—280. www.ijmer.com 4438 | Page

×