{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:50:23Z","timestamp":1772520623150,"version":"3.50.1"},"reference-count":31,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2022,1,15]],"date-time":"2022-01-15T00:00:00Z","timestamp":1642204800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Robotics"],"abstract":"<jats:p>Industrial robot applications should be designed to allow the robot to provide the best performance for increasing throughput. In this regard, both trajectory and task order optimization are crucial, since they can heavily impact cycle time. Moreover, it is very common for a robotic application to be kinematically or functionally redundant so that multiple arm configurations may fulfill the same task at the working points. In this context, even if the working cycle is composed of a small number of points, the number of possible sequences can be very high, so that the robot programmer usually cannot evaluate them all to obtain the shortest possible cycle time. One of the most well-known problems used to define the optimal task order is the Travelling Salesman Problem (TSP), but in its original formulation, it does not allow to consider different robot configurations at the same working point. This paper aims at overcoming TSP limitations by adding some mathematical and conceptual constraints to the problem. With such improvements, TSP can be used successfully to optimize the cycle time of industrial robotic tasks where multiple configurations are allowed at the working points. Simulation and experimental results are presented to assess how cost (cycle time) and computational time are influenced by the proposed implementation.<\/jats:p>","DOI":"10.3390\/robotics11010016","type":"journal-article","created":{"date-parts":[[2022,1,16]],"date-time":"2022-01-16T20:45:21Z","timestamp":1642365921000},"page":"16","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Optimizing Cycle Time of Industrial Robotic Tasks with Multiple Feasible Configurations at the Working Points"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6611-173X","authenticated-orcid":false,"given":"Matteo","family":"Bottin","sequence":"first","affiliation":[{"name":"Department of Industrial Engineering, University of Padova, 35131 Padova, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2452-221X","authenticated-orcid":false,"given":"Giovanni","family":"Boschetti","sequence":"additional","affiliation":[{"name":"Department of Management and Engineering, University of Padova, 36100 Vicenza, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5150-9486","authenticated-orcid":false,"given":"Giulio","family":"Rosati","sequence":"additional","affiliation":[{"name":"Department of Industrial Engineering, University of Padova, 35131 Padova, Italy"}]}],"member":"1968","published-online":{"date-parts":[[2022,1,15]]},"reference":[{"key":"ref_1","unstructured":"International Federation of Robotics (2021, November 07). IFR Press Conference. Available online: https:\/\/ifr.org\/downloads\/press2018\/Presentation_WR_2020.pdf."},{"key":"ref_2","doi-asserted-by":"crossref","unstructured":"Billard, A., Calinon, S., Dillmann, R., and Schaal, S. (2008). Survey: Robot Programming by Demonstration, Springrer. Technical Report.","DOI":"10.1007\/978-3-540-30301-5_60"},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Alizadeh, T., and Karimi, N. (2018, January 5\u20138). Exploiting the task space redundancy in robot programming by demonstration. Proceedings of the 2018 IEEE International Conference on Mechatronics and Automation (ICMA), Changchun, China.","DOI":"10.1109\/ICMA.2018.8484455"},{"key":"ref_4","doi-asserted-by":"crossref","unstructured":"Bottin, M., and Rosati, G. (2019). Trajectory optimization of a redundant serial robot using cartesian via points and kinematic decoupling. Robotics, 8.","DOI":"10.3390\/robotics8040101"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"237","DOI":"10.1007\/978-3-030-55807-9_27","article-title":"Iterative Path Planning of a Serial Manipulator in a Cluttered Known Environment","volume":"91","author":"Bottin","year":"2021","journal-title":"Mech. Mach. Sci."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"102091","DOI":"10.1016\/j.rcim.2020.102091","article-title":"Collision-free and smooth joint motion planning for six-axis industrial robots by redundancy optimization","volume":"68","author":"Lu","year":"2021","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_7","doi-asserted-by":"crossref","unstructured":"Calinon, S., Sardellitti, I., and Caldwell, D. (2010, January 18\u201322). Learning-based control strategy for safe human-robot interaction exploiting task and robot redundancies. Proceedings of the 2010 IEEE\/RSJ International Conference on Intelligent Robots and Systems (IROS), Taipei, Taiwan.","DOI":"10.1109\/IROS.2010.5648931"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1335","DOI":"10.1109\/LRA.2021.3057011","article-title":"Multi-Robot Task Sequencing & Automatic Path Planning for Cycle Time Optimization: Application for Car Production Line","volume":"6","author":"Touzani","year":"2021","journal-title":"IEEE Robot. Autom. Lett."},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"538","DOI":"10.1287\/opre.16.3.538","article-title":"The traveling salesman problem: A survey","volume":"16","author":"Bellmore","year":"1968","journal-title":"Oper. Res."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Zhang, J., Hong, L., and Liu, Q. (2021). An improved whale optimization algorithm for the traveling salesman problem. Symmetry, 13.","DOI":"10.3390\/sym13010048"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"115353","DOI":"10.1016\/j.eswa.2021.115353","article-title":"Solving traveling salesman problem using hybridization of rider optimization and spotted hyena optimization algorithm","volume":"183","author":"Krishna","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"115192","DOI":"10.1016\/j.eswa.2021.115192","article-title":"Evolutionary algorithm hybridized with local search and intelligent seeding for solving multi-objective Euclidian TSP","volume":"181","author":"Agrawal","year":"2021","journal-title":"Expert Syst. Appl."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"103172","DOI":"10.1016\/j.trc.2021.103172","article-title":"The Multi-visit Traveling Salesman Problem with Multi-Drones","volume":"128","author":"Luo","year":"2021","journal-title":"Transp. Res. Part C: Emerg. Technol."},{"key":"ref_14","doi-asserted-by":"crossref","unstructured":"Bottin, M., Faccio, M., Minto, R., and Rosati, G. (2021). Sales kit automated production: An integrated procedure for setup reduction in case of high products variety. Appl. Sci., 11.","DOI":"10.3390\/app112110110"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"107328","DOI":"10.1016\/j.cie.2021.107328","article-title":"Safe distance-based vehicle routing problem: Medical waste collection case study in COVID-19 pandemic","volume":"157","author":"Eren","year":"2021","journal-title":"Comput. Ind. Eng."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1016\/j.bbrc.2020.12.010","article-title":"A perspective on early detection systems models for COVID-19 spreading","volume":"538","author":"Vianello","year":"2021","journal-title":"Biochem. Biophys. Res. Commun."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"126333","DOI":"10.1016\/j.amc.2021.126333","article-title":"Modeling and application for rolling scheduling problem based on TSP","volume":"407","author":"Su","year":"2021","journal-title":"App. Math. Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"895","DOI":"10.1007\/s11081-020-09531-w","article-title":"How to minimize cycle times of robot manufacturing systems","volume":"22","author":"Hofmann","year":"2021","journal-title":"Optim. Eng."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1016\/j.tcs.2021.05.016","article-title":"Approximation of the Double Traveling Salesman Problem with Multiple Stacks","volume":"877","author":"Alfandari","year":"2021","journal-title":"Theor. Comput. Sci."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1016\/j.ins.2021.04.090","article-title":"Grouping memetic search for the colored traveling salesmen problem","volume":"570","author":"He","year":"2021","journal-title":"Inf. Sci."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"095001","DOI":"10.1088\/1361-6501\/abfc86","article-title":"A cost-effective planning method for automatic measurement based on task similarity and octopus optimization","volume":"32","author":"Li","year":"2021","journal-title":"Meas. Sci. Technol."},{"key":"ref_22","first-page":"553","article-title":"CO2 transportation hazards in CCS and EOR Operations: Preliminary lab\u2014Scale experimental investigation of CO2 pressurized releases","volume":"48","author":"Mocellin","year":"2016","journal-title":"Chem. Eng. Trans."},{"key":"ref_23","first-page":"117","article-title":"5\u2014Swarm Problem-Solving","volume":"Volume 2","author":"Banos","year":"2017","journal-title":"Agent-Based Spatial Simulation with NetLogo"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1007\/978-3-030-55807-9_26","article-title":"Working Cycle Sequence Optimization for Industrial Robots","volume":"91","author":"Bottin","year":"2021","journal-title":"Mech. Mach. Sci."},{"key":"ref_25","unstructured":"Kuffner, J.J., and La Valle, S.M. (2000, January 24\u201328). RRT-connect: An efficient approach to single-query path planning. Proceedings of the 2000 IEEE International Conference on Robotics and Automation, San Francisco, CA, USA."},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Kang, J.G., Lim, D.W., Choi, Y.S., Jang, W.J., and Jung, J.W. (2021). Improved RRT-connect algorithm based on triangular inequality for robot path planning. Sensors, 21.","DOI":"10.3390\/s21020333"},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.rcim.2017.04.007","article-title":"Optimal robot placement with consideration of redundancy problem for wrist-partitioned 6R articulated robots","volume":"48","author":"Doan","year":"2017","journal-title":"Robot. Comput.-Integr. Manuf."},{"key":"ref_28","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/978-3-030-00365-4_35","article-title":"A novel collision avoidance method for serial robots","volume":"66","author":"Bottin","year":"2019","journal-title":"Mech. Mach. Sci."},{"key":"ref_29","doi-asserted-by":"crossref","unstructured":"Rossi, A., Rosati, G., Cenci, S., Carli, A., Riello, V., Foroni, A., Mantovani, M., and Zanotti, L. (2011, January 5\u20139). Flexible assembly system for heat exchanger coils. Proceedings of the ETFA2011, Toulouse, France.","DOI":"10.1109\/ETFA.2011.6059045"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1109\/MRA.2003.1213616","article-title":"Welding robots","volume":"10","author":"Pires","year":"2003","journal-title":"IEEE Robot. Autom. Mag."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"3027","DOI":"10.1007\/s00170-021-07565-7","article-title":"C-ALB (Collaborative Assembly Line Balancing): A new approach in cobot solutions","volume":"116","author":"Boschetti","year":"2021","journal-title":"Int. J. Adv. Manuf. Technol."}],"container-title":["Robotics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2218-6581\/11\/1\/16\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T14:15:06Z","timestamp":1760364906000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2218-6581\/11\/1\/16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,1,15]]},"references-count":31,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2022,2]]}},"alternative-id":["robotics11010016"],"URL":"https:\/\/doi.org\/10.3390\/robotics11010016","relation":{},"ISSN":["2218-6581"],"issn-type":[{"value":"2218-6581","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,1,15]]}}}