Task-level time-optimal collision avoidance trajectory planning for grinding manipulators

A computational framework that can plan the task-level time-optimal collision avoidance trajectory (TOCAT) of grinding manipulators is constructed based on the improved simulated annealing algorithm. When the workpiece surface has a plurality of discrete non-connected areas that need to be polished by grinding manipulators, the planning of TOCAT for a given grinding task is crucial, because it has a direct impact on the processing efficiency and intelligence of the automatic grinding system. Although many planning algorithms can be used to plan collision avoidance trajectories between any two points, the planning of the task-level TOCAT with multiple collision avoidance sub-trajectories is more difficult because it involves the permutation of the collision avoidance sub-trajectories for connecting several grinding areas. This paper proposes a task-level TOCAT planning framework based on the improved simulated annealing algorithm. Its key point is to plan the time-optimal sub-trajectory between any two points based on the trajectory evaluation mechanism. Its innovation lies in that the simulated annealing algorithm generates new solutions based on the combined stochastic perturbation method. The experimental results show that this framework can effectively solve the task-level TOCAT planning problem in multiple grinding areas, and the duration of the task-level collision avoidance trajectory is not only less discrete but also approximately globally optimal.

[1]  Berthold Vöcking,et al.  Worst Case and Probabilistic Analysis of the 2-Opt Algorithm for the TSP , 2007, SODA '07.

[2]  Vincent Roberge,et al.  Comparison of Parallel Genetic Algorithm and Particle Swarm Optimization for Real-Time UAV Path Planning , 2013, IEEE Transactions on Industrial Informatics.

[3]  Xindu Chen,et al.  The Optimal Collision Avoidance Trajectory Planning of Redundant Manipulators in the Process of Grinding Ceramic Billet Surface , 2017 .

[4]  D. Oudheusden,et al.  A branch and bound algorithm for the traveling purchaser problem , 1997 .

[5]  Emilio Frazzoli,et al.  Sampling-based algorithms for optimal motion planning , 2011, Int. J. Robotics Res..

[6]  Kostas E. Bekris,et al.  Improving sparse roadmap spanners , 2013, 2013 IEEE International Conference on Robotics and Automation.

[7]  Juan Cort Sampling-Based Path Planning on Configuration-Space Costmaps , 2010 .

[8]  Md Enamul Haque,et al.  A Simulated Annealing Global Maximum Power Point Tracking Approach for PV Modules Under Partial Shading Conditions , 2016, IEEE Transactions on Power Electronics.

[9]  M. H. Korayem,et al.  Maximum payload path planning for redundant manipulator using indirect solution of optimal control problem , 2009 .

[10]  Patrick Beeson,et al.  TRAC-IK: An open-source library for improved solving of generic inverse kinematics , 2015, 2015 IEEE-RAS 15th International Conference on Humanoid Robots (Humanoids).

[11]  Didier Devaurs,et al.  Enhancing the transition-based RRT to deal with complex cost spaces , 2013, 2013 IEEE International Conference on Robotics and Automation.

[12]  Matthias Troyer,et al.  Optimised simulated annealing for Ising spin glasses , 2014, Comput. Phys. Commun..

[13]  Bibhuti Bhusan Biswal,et al.  A review on assembly sequence generation and its automation , 2016 .

[14]  Kostas E. Bekris,et al.  Sparse roadmap spanners for asymptotically near-optimal motion planning , 2014, Int. J. Robotics Res..

[15]  Shih-Wei Lin,et al.  Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery , 2014, Appl. Soft Comput..

[16]  Manoj Kumar Tiwari,et al.  Constraint-based simulated annealing (CBSA) approach to solve the disassembly scheduling problem , 2012 .

[17]  Adriana Giret,et al.  Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm , 2013 .

[18]  Gianfranco Passannanti,et al.  A simulated annealing-based approach for the joint optimization of production/inventory and preventive maintenance policies , 2017 .

[19]  A. Nikoobin,et al.  Path Planning of Mobile Elastic Robotic Arms by Indirect Approach of Optimal Control , 2011 .

[20]  Yuan Yuan,et al.  Path selection model and algorithm for emergency logistics management , 2009, Comput. Ind. Eng..

[21]  P. L. Green Bayesian system identification of a nonlinear dynamical system using a novel variant of Simulated Annealing , 2015 .

[22]  Bihter Avsar,et al.  Parallelized neural network system for solving Euclidean traveling salesman problem , 2015, Appl. Soft Comput..

[23]  Peter Rossmanith,et al.  Simulated Annealing , 2008, Taschenbuch der Algorithmen.

[24]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[25]  Siddhartha S. Srinivasa,et al.  CHOMP: Gradient optimization techniques for efficient motion planning , 2009, 2009 IEEE International Conference on Robotics and Automation.

[26]  Shalini Singh Comparison Study of Multiple Traveling Salesmen Problem using Genetic Algorithm , 2013 .

[27]  Jari Saarinen,et al.  A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse , 2014, Eur. J. Oper. Res..

[28]  Dan Halperin,et al.  Asymptotically near-optimal RRT for fast, high-quality, motion planning , 2014, ICRA.

[29]  Steven M. LaValle,et al.  RRT-connect: An efficient approach to single-query path planning , 2000, Proceedings 2000 ICRA. Millennium Conference. IEEE International Conference on Robotics and Automation. Symposia Proceedings (Cat. No.00CH37065).

[30]  Ahmed Azab,et al.  An improved model and novel simulated annealing for distributed job shop problems , 2015 .

[31]  Moharam Habibnejad Korayem,et al.  Load maximization of flexible joint mechanical manipulator using nonlinear optimal controller , 2011 .

[32]  Abbas Hashemi,et al.  Adaptive hybrid optimization of hydrodynamic deep drawing with radial pressure process by combination of parametric design and simulated annealing techniques , 2017 .

[33]  Saeid Amini,et al.  Forward and reverse mapping of multiresponses turning process using adaptive network-based fuzzy inference system and simulated annealing algorithm , 2018 .