Hostname: page-component-77c78cf97d-cfh4f Total loading time: 0 Render date: 2026-05-04T19:04:06.737Z Has data issue: false hasContentIssue false
  • English
  • Français

Simultaneous task placement and sequence optimization in an inspection robotic cell

Published online by Cambridge University Press:  08 April 2021

MohammadHadi FarzanehKaloorazi Open the ORCID record for MohammadHadi FarzanehKaloorazi [Opens in a new window] ,
Ilian A. Bonev  and
Lionel Birglen
MohammadHadi FarzanehKaloorazi*
Affiliation:
École de technologie supérieure, 1100 Notre-Dame St W, Montreal H3C 1K3, Canada. E-mail: ilian.bonev@etsmtl.ca
Ilian A. Bonev
Affiliation:
École de technologie supérieure, 1100 Notre-Dame St W, Montreal H3C 1K3, Canada. E-mail: ilian.bonev@etsmtl.ca
Lionel Birglen
Affiliation:
Polytechnique Montréal, 2900 Édouard-Montpetit Blvd, Montreal H3T 1J4, Canada. E-mail: lionel.birglen@polymtl.ca
*
*Corresponding author. Email: hamidfarzane88@gmail.com
Get access Rights & Permissions [Opens in a new window]

Abstract

In this article, we improve the efficiency of a turbine blade inspection robotic workcell. The workcell consists of a stationary camera and a 6-axis serial robot that is holding a blade and presenting different zones of the blade to the camera for inspection. The problem at hand consists of a 6-DOF (degree of freedom) continuous optimization of the camera placement and a discrete combinatorial optimization of the sequence of inspection poses (images). For each image, all robot configurations (up to eight) are taken into consideration. A novel combined approach is introduced, called blind dynamic particle swarm optimization (BD-PSO), to simultaneously obtain the optimal design for both domains. The objective is to minimize the cycle time of the inspection process, while avoiding any collisions. Even though PSO is vastly used in engineering problems, the novelty of our combinatorial optimization method is in its ability to be used efficiently in traveling salesman problems where the distances between the cities are unknown and subject to change. This highly unpredictable environment is the case of the inspection cell where the cycle time between two images will change for different camera placements.

Keywords

Task placementCycle timeTraveling salesman problemParticle swarm optimization (PSO)Serial robotRedundancy

Information

Type
Article
Information
Robotica , Volume 39 , Issue 12 , December 2021 , pp. 2110 - 2130
Copyright
© The Author(s), 2021. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable

References

[1] Alatartsev, S., Stellmacher, S. and Ortmeier, F., “Robotic task sequencing problem: A survey,” J. Intell. Robot. Syst. 80(2), 279–298 (2015).10.1007/s10846-015-0190-6CrossRefGoogle Scholar
[2] Kovács, A., “Integrated task sequencing and path planning for robotic remote laser welding,” Int. J. Production Res. 54(4), 1210–1224 (2016).CrossRefGoogle Scholar
[3] Kolakowska, E., Smith, S. F. and Kristiansen, M., “Constraint optimization model of a scheduling problem for a robotic arm in automatic systems,” Rob. Auto. Syst. 62(2), 267–280 (2014).CrossRefGoogle Scholar
[4] Vicencio, K., Davis, B. and Gentilini, I., “Multi-goal Path Planning Based on the Generalized Traveling Salesman Problem with Neighborhoods,” 2014 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS 2014) (IEEE, 2014) pp. 2985–2990.CrossRefGoogle Scholar
[5] Kaloorazi, M., Masouleh, M. T. and Caro, S., “Interval-Analysis-Based Determination of the Singularity-Free Workspace of Gough-Stewart Parallel Robots,” 2013 21st Iranian Conference on Electrical Engineering (ICEE) (IEEE, 2013) pp. 1–6.CrossRefGoogle Scholar
[6] Kaloorazi, M.-H. F., Masouleh, M. T. and Caro, S., “Determination of the maximal singularity-free workspace of 3-DOF parallel mechanisms with a constructive geometric approach,” Mech. Mach. Theory 84, 25–36 (2015).10.1016/j.mechmachtheory.2014.10.003CrossRefGoogle Scholar
[7] FarzanehKaloorazi, M. H., Bonev, I. A. and Birglen, L., “Parameters Identification of the Path Placement Optimization Problem for a Redundant Coordinated Robotic Workcell,” ASME 2018 International Design Engineering Technical Conferences and Computers and Information in Engineering Conference (American Society of Mechanical Engineers, 2018) pp. V05BT07A087–V05BT07A087.Google Scholar
[8] Caro, S., Dumas, C., Garnier, S. and Furet, B., “Workpiece Placement Optimization for Machining Operations with a KUKA KR270-2 Robot,” 2013 IEEE International Conference on Robotics and Automation (ICRA) (IEEE, 2013) pp. 2921–2926.CrossRefGoogle Scholar
[9] Ur-Rehman, R., Caro, S., Chablat, D. and Wenger, P., “Multi-objective path placement optimization of parallel kinematics machines based on energy consumption, shaking forces and maximum actuator torques: Application to the orthoglide,” Mech. Mach. Theory 45(8), 1125–1141 (2010).CrossRefGoogle Scholar
[10] FarzanehKaloorazi, M., Bonev, I. A. and Birglen, L., “Simultaneous path placement and trajectory planning optimization for a redundant coordinated robotic workcell,” Mech. Mach. Theory 130, 346–362 (2018).CrossRefGoogle Scholar
[11] Zhang, J. and Li, A.-P., “Genetic Algorithm for Robot Workcell Layout Problem,” WCSE’09. WRI World Congress on Software Engineering, 2009, vol. 4 (IEEE, 2009) pp. 460–464.10.1109/WCSE.2009.375CrossRefGoogle Scholar
[12] Zacharia, P. T. and Aspragathos, N. A., “Optimization of Industrial Manipulators Cycle Time Based on Genetic Algorithms,” 2004 2nd IEEE International Conference on Industrial Informatics, 2004. INDIN’04 (IEEE, 2004) pp. 517–522.Google Scholar
[13] Baizid, K., Chellali, R., Yousnadj, A., Meddahi, A. and Bentaleb, T., “Genetic Algorithms Based Method for Time Optimization in Robotized Site,” 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems (IROS) (IEEE, 2010) pp. 1359–1364.10.1109/IROS.2010.5651948CrossRefGoogle Scholar
[14] Baizid, K., Meddahi, A., Yousnadj, A., Chellali, R., Khan, H. and Iqbal, J., “Robotized Task Time Scheduling and Optimization Based on Genetic Algorithms for Non Redundant Industrial Manipulators,” 2014 IEEE International Symposium on Robotic and Sensors Environments (ROSE) (IEEE, 2014) pp. 112–117.CrossRefGoogle Scholar
[15] Tubaileh, A., Hammad, I. and Kafafi, L., “Robot cell planning,” Eng. Tech. 26, 250–253 (2007).Google Scholar
[16] Zacharia, P. T. and Aspragathos, N., “Optimal robot task scheduling based on genetic algorithms,” Rob. Comput. Integr. Manuf. 21(1), 67–79 (2005).10.1016/j.rcim.2004.04.003CrossRefGoogle Scholar
[17] Aneja, Y. P. and Kamoun, H., “Scheduling of parts and robot activities in a two machine robotic cell,” Comput. Oper. Res. 26(4), 297–312 (1999).10.1016/S0305-0548(98)00063-XCrossRefGoogle Scholar
[18] Hall, N. G., Kamoun, H. and Sriskandarajah, C., “Scheduling in robotic cells: Classification, two and three machine cells,” Oper. Res. 45(3), 421–439 (1997).CrossRefGoogle Scholar
[19] Kurtser, P. and Edan, Y., “Planning the sequence of tasks for harvesting robots,” Rob. Auto. Syst. 131, 103591 (2020). https://doi.org/10.1016/j.robot.2020.103591.CrossRefGoogle Scholar
[20] Nedjatia, A. and Vizvárib, B., “Robot path planning by traveling salesman problem with circle neighborhood: Modeling, algorithm, and applications,” arXiv preprint arXiv:2003.06712 (2020).Google Scholar
[21] Oliinyk, A., Fedorchenko, I., Stepanenko, A., Rud, M. and Goncharenko, D., “Implementation of Evolutionary Methods of Solving the Travelling Salesman Problem in a Robotic Warehouse,” In: Data-Centric Business and Applications (Springer, 2020) pp. 263–292.10.1007/978-3-030-43070-2_13CrossRefGoogle Scholar
[22] Li, J. and Yang, F., “Task assignment strategy for multi-robot based on improved grey wolf optimizer,” J. Ambient Intell. Humanized Comput. 11, 6319–6335 (2020). https://doi.org/10.1007/s12652-020-02224-3.CrossRefGoogle Scholar
[23] Bottin, M., Rosati, G. and Boschetti, G., “Working Cycle Sequence Optimization for Industrial Robots,” The International Conference of IFToMM ITALY (Springer, 2020) pp. 228–236.10.1007/978-3-030-55807-9_26CrossRefGoogle Scholar
[24] Tian, S., Chen, Y., Gu, Q., Hu, R., Li, R. and He, D., “Optimal Path Planning for a Robot Shelf Picking System,” 2020 39th Chinese Control Conference (CCC) (IEEE, 2020) pp. 3898–3903.10.23919/CCC50068.2020.9189590CrossRefGoogle Scholar
[25] Kennedy, J., “Particle Swarm Optimization,” In: Encyclopedia of Machine Learning (Springer, 2011) pp. 760–766.CrossRefGoogle Scholar
[26] Field, G. and Stepanenko, Y., “Iterative Dynamic Programming: An Approach to Minimum Energy Trajectory Planning for Robotic Manipulators,” 1996 IEEE International Conference on Robotics and Automation, 1996. Proceedings, vol. 3 (IEEE, 1996) pp. 2755–2760.Google Scholar
[27] Hirakawa, A. R. and Kawamura, A., “Trajectory Planning of Redundant Manipulators for Minimum Energy Consumption without Matrix Inversion,” 1997 IEEE International Conference on Robotics and Automation, 1997. Proceedings, vol. 3 (IEEE, 1997) pp. 2415–2420.Google Scholar
[28] Chan, K. and Zalzala, A., “Genetic-Based Minimum-Time Trajectory Planning of Articulated Manipulators with Torque Constraints,” IEE Colloquium on Genetic Algorithms for Control Systems Engineering, (IET, 1993) pp. 4–1.Google Scholar
[29] Pateloup, V., Duc, E. and Ray, P., “Corner optimization for pocket machining,” Int. J. Mach. Tools Manuf. 44(12–13), 1343–1353 (2004).CrossRefGoogle Scholar
[30] Tian, L. and Collins, C., “Motion planning for redundant manipulators using a floating point genetic algorithm,” J. Intell. Rob. Syst. 38(3–4), 297–312 (2003).CrossRefGoogle Scholar
[31] Kaloorazi, M. H. F., Masouleh, M. T. and Caro, S., “Collision-free workspace of parallel mechanisms based on an interval analysis approach,” Robotica 35(8), 1747–1760 (2017).Google Scholar
[32] Kaloorazi, M. H. F., Masouleh, M. T. and Caro, S., “Collision-Free Workspace of 3-RPR Planar Parallel Mechanism via Interval Analysis,” In: Advances in Robot Kinematics (Springer, 2014) pp. 327–334.10.1007/978-3-319-06698-1_34CrossRefGoogle Scholar
[33] Jiménez, P., Thomas, F. and Torras, C., “3D collision detection: A survey,” Comput. Graphics 25(2), 269–285 (2001).CrossRefGoogle Scholar
[34] Lawler, E. L., The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, Wiley-Interscience Series in Discrete Mathematics (1985).Google Scholar
[35] Storn, R. and Price, K., “Differential evolution–a simple and efficient heuristic for global optimization over continuous spaces,” J. Global Optim. 11(4), 341–359 (1997).CrossRefGoogle Scholar
[36] Kennedy, J., “The Particle Swarm: Social Adaptation of Knowledge,” IEEE International Conference on Evolutionary Computation, 1997 (IEEE, 1997) pp. 303–308.Google Scholar
[37] Hassan, R., Cohanim, B., De Weck, O. and Venter, G., “A Comparison of Particle Swarm Optimization and the Genetic Algorithm,” 46th AIAA/ASME/ASCE/AHS/ASC Structures, Structural Dynamics and Materials Conference, p. 1897.Google Scholar
[38] Wang, K.-P., Huang, L., Zhou, C.-G. and Pang, W., “Particle Swarm Optimization for Traveling Salesman Problem,” 2003 International Conference on Machine Learning and Cybernetics, vol. 3 (IEEE, 2003) pp. 1583–1585.CrossRefGoogle Scholar
[39] Wang, T.-D., Li, X. and Wang, X., Simulated Evolution and Learning: 6th International Conference, SEAL 2006, Hefei, China, October 15–18, 2006, Proceedings, vol. 4247 (Springer, 2006).Google Scholar
[40] Odili, J. B. and Mohmad Kahar, M. N., “Solving the traveling salesman’s problem using the african buffalo optimization,” Comput. Intell. Neurosci. 2016, 3, (2016).Google Scholar
[41] Huilian, F., “Discrete particle swarm optimization for tsp based on neighborhood,” J. Comput. Inf. Syst. 6(10), 3407–3414 (2010).Google Scholar