Polynomial joint angle arm robot motion planning in complex geometrical obstacles

This paper addresses a point-to-point of an arm robot motion planning in complex geometrical obstacle. It will govern a two-layer optimization strategy utilizing sixth degree polynomial as joint angle path. At the beginning of the motion planning process, the path planning starts with the optimization objective to minimize the joint angle travelling distance under collision detection rules as constraint. After the best path has been met, the associated time will be searched with the optimization objective to minimize the total travelling time and the torque under the maximum velocity, the maximum acceleration, the maximum jerk, and the maximum torque constraints. The performance of a Genetic Algorithm (GA) and a Particle Swarm Optimization (PSO) will be investigated in searching the feasible sixth degree polynomial joint angle path and the total travelling time that gives the optimal trajectories under kinodynamic constraints. A 3-Degree-Of-Freedom (3-DOF) planar robot will be utilized to simulate the proposed scenario.

[1]  Helen G. Cobb,et al.  An Investigation into the Use of Hypermutation as an Adaptive Operator in Genetic Algorithms Having Continuous, Time-Dependent Nonstationary Environments , 1990 .

[2]  Jorge Angeles,et al.  Fundamentals of Robotic Mechanical Systems , 2008 .

[3]  A. Gasparetto,et al.  A new method for smooth trajectory planning of robot manipulators , 2007 .

[4]  Jorge Angeles,et al.  Fundamentals of Robotic Mechanical Systems: Theory, Methods, and Algorithms , 1995 .

[5]  R. Saravanan,et al.  Evolutionary multi-criteria trajectory modeling of industrial robots in the presence of obstacles , 2009, Eng. Appl. Artif. Intell..

[6]  Paul Lajbcygier,et al.  Optimizing Technical Trading Strategies with Split Search Genetic Algorithms , 2002 .

[7]  Taha Chettibi.  Synthesis of dynamic motions for robotic manipulators with geometric path constraints , 2006 .

[8]  R. Haupt,et al.  Adaptive crossed dipole antennas using a genetic algorithm , 2004, IEEE Transactions on Antennas and Propagation.

[9]  James E. Smith,et al.  Self-Adaptation of Mutation Operator and Probability for Permutation Representations in Genetic Algorithms , 2010, Evolutionary Computation.

[10]  M. Boryga,et al.  Planning of manipulator motion trajectory with higher-degree polynomials use , 2009 .

[11]  José António Tenreiro Machado,et al.  Manipulator trajectory planning using a MOEA , 2007, Appl. Soft Comput..

[12]  H. Lehtihet,et al.  Minimum cost trajectory planning for industrial robots , 2004 .

[13]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[14]  Jingsong He,et al.  A Hybrid Genetic Algorithm with Hyper-Mutation and Elitist Strategies for Automated Analog Circuit Design , 2009, 2009 International Workshop on Intelligent Systems and Applications.