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

Abstract

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.

Keywords

Grinding manipulators multiple discrete non-connected grinding areas simulated annealing task-level time-optimal collision avoidance trajectory combined stochastic perturbation method

Get full access to this article

View all access options for this article.

References

Korayem

Nohooji

Nikoobin

. Path planning of mobile elastic robotic arms by indirect approach of optimal control. Int J Adv Robot Sys 2011; 8: 10–10.

Korayem

Nikoobin

. Maximum payload path planning for redundant manipulator using indirect solution of optimal control problem. Int J Adv Manuf Technol 2009; 44: 725–725.

Korayem

Irani

Nekoo

. Load maximization of flexible joint mechanical manipulator using nonlinear optimal controller. Acta Astronaut 2011; 69: 458–469.

Jaillet

Cortés

Siméon

. Sampling-based path planning on configuration-space costmaps. IEEE Transact Robot 2010; 26: 635–646.

Kuffner JJ and LaValle SM. RRT-connect: an efficient approach to single-query path planning. In: Robotics and Automation, 2000 Proceedings ICRA 00 IEEE international conference on 2000. Piscataway, NJ, USA: IEEE, pp.995–1001.

Beeson P and Ames B. TRAC-IK: an open-source library for improved solving of generic inverse kinematics. In: Humanoid Robots (Humanoids), 2015 IEEE-RAS 15th international conference on 2015. IEEE, pp.928–935.

Ratliff N, Zucker M, Bagnell JA, et al. CHOMP: gradient optimisation techniques for efficient motion planning. In: Robotics and Automation, 2009 ICRA’09 IEEE international conference on 2009. Piscataway, NJ, USA: IEEE, pp.489–494.

Karaman

Frazzoli

. Sampling-based algorithms for optimal motion planning. Int J Rob Res 2011; 30: 846–894.

Dobson

Bekris

. Sparse roadmap spanners for asymptotically near-optimal motion planning. Int J Rob Res 2014; 33: 18–47.

10.

Dobson A and Bekris KE. Improving sparse roadmap spanners. In: Robotics and Automation (ICRA), 2013 IEEE international conference on 2013. Piscataway, NJ, USA: IEEE, pp.4106–4111.

11.

Devaurs D, Siméon T and Cortés J. Enhancing the transition-based RRT to deal with complex cost spaces. In: Robotics and Automation (ICRA), 2013 IEEE international conference on 2013. Piscataway, NJ, USA, IEEE, pp.4120–4125.

12.

Salzman

Halperin

. Asymptotically near-optimal RRT for fast, high-quality motion planning. IEEE Trans Robot 2016; 32: 473–483.

13.

Diao

Chen

et al.

The optimal collision avoidance trajectory planning of redundant manipulators in the process of grinding ceramic billet surface. Math Probl Eng 2017; 2017: 12–12.

14.

Singh

van Oudheusden

. A branch and bound algorithm for the traveling purchaser problem. Eur J Oper Res 1997; 97: 571–579.

15.

Yuan

Wang

. Path selection model and algorithm for emergency logistics management. Comput Ind Eng 2009; 56: 1081–1094.

16.

Dorigo

Stützle

. Gendreau

Michel

Potvin

Jean-Yves

. Ant colony optimisation: overview and recent advances. Handbook of metaheuristics, Boston, MA, USA: Springer, 2010, pp. 227–263.

17.

Roberge

Tarbouchi

Labonté

. Comparison of parallel genetic algorithm and particle swarm optimisation for real-time UAV path planning. IEEE Trans Industr Inform 2013; 9: 132–141.

18.

Dai

Tang

Giret

et al.

Energy-efficient scheduling for a flexible flow shop using an improved genetic-simulated annealing algorithm. Robot Comput Integr Manuf 2013; 29: 418–429.

19.

Avşar

Aliabadi

. Parallelized neural network system for solving Euclidean traveling salesman problem. Appl Soft Comput 2015; 34: 862–873.

20.

Singh

Lodhi

. Comparison study of multiple traveling salesmen problem using genetic algorithm. Int J Comp Sci Net Sec 2014; 14: 107–107.

21.

Kirkpatrick

Gelatt

Vecchi

. Optimization by simulated annealing. science 1983; 220: 671–680.

22.

La Fata

Passannanti

. A simulated annealing-based approach for the joint optimisation of production/inventory and preventive maintenance policies. Int J Adv Manuf Technol 2017; 91: 3899–3909.

23.

Isakov

Zintchenko

Rønnow

et al.

Optimised simulated annealing for Ising spin glasses. Comput Phys Commun 2015; 192: 265–271.

24.

Lyden

Haque

. A simulated annealing global maximum power point tracking approach for PV modules under partial shading conditions. IEEE Trans Power Electron 2016; 31: 4171–4181.

25.

Matusiak

de Koster

Kroon

et al.

A fast simulated annealing method for batching precedence-constrained customer orders in a warehouse. Eur J Oper Res 2014; 236: 968–977.

26.

Prakash

Ceglarek

Tiwari

. Constraint-based simulated annealing (CBSA) approach to solve the disassembly scheduling problem. Int J Adv Manuf Technol 2012; 60: 1125–1137.

27.

Bahubalendruni

Biswal

. A review on assembly sequence generation and its automation. Proc IMechE, Part C: J Mechanical Engineering Science 2016; 230: 824–838.

28.

Vincent

Lin

S-W

. Multi-start simulated annealing heuristic for the location routing problem with simultaneous pickup and delivery. Appl Soft Comput 2014; 24: 284–290.

29.

Naderi

Azab

. An improved model and novel simulated annealing for distributed job shop problems. Int J Adv Manuf Technol 2015; 81: 693–703.

30.

Hashemi

Gollo

Seyedkashi

et al.

Adaptive hybrid optimisation of hydrodynamic deep drawing with radial pressure process by combination of parametric design and simulated annealing techniques. Proc IMechE, Part C: J Mechanical Engineering Science 2017; 231: 4564–4575.

31.

Teimouri

Amini

. Forward and reverse mapping of multiresponses turning process using adaptive network-based fuzzy inference system and simulated annealing algorithm. Proc IMechE, Part C: J Mechanical Engineering Science 2017; 232: 1746–1758.

32.

Van Laarhoven PJ and Aarts EH. Simulated annealing. Simulated annealing: theory and applications. D. Reidel Publishing Company, Dordrecht, Holland, Springer, 1987, pp.7–15.

33.

Aarts E, Korst J and Michiels W. Simulated annealing. In: Edmund K. Burke, Graham Kendall (eds) Search methodologies. Boston, MA, USA: Springer, 2005, pp.187–210.

34.

Englert M, Röglin H and Vöcking B. Worst case and probabilistic analysis of the 2-Opt algorithm for the TSP. In: Proceedings of the eighteenth annual ACM-SIAM symposium on discrete algorithms 2007. Philadelphia: Society for Industrial and Applied Mathematics, pp.1295–1304.

35.

Green

. Bayesian system identification of a nonlinear dynamical system using a novel variant of simulated annealing. Mech Syst Signal Process 2015; 52: 133–146.