Collision-free scheduling of multi-bridge machining systems: a colored traveling salesman problem-based approach

Multi-bridge machining systems U+0028 MBMS U+0029 have gained wide applications in industry due to their high production capacity and efficiency. They contain multiple bridge machines working in parallel within their partially overlapping workspaces. Their scheduling problems can be abstracted into a serial-colored travelling salesman problem in which each salesman has some exclusive cities and some cities shared with its neighbor U+0028 s U+0029. To solve it, we develop a greedy algorithm that selects a neighboring city satisfying proximity. The algorithm allows a salesman to select randomly its shared cities and runs accordingly many times. It can thus be used to solve job scheduling problems for MBMS. Subsequently, a collision-free scheduling method is proposed to address both job scheduling and collision resolution issues of MBMS. It is an extension of the greedy algorithm by introducing time window constraints and a collision resolution mechanism. Thus, the augmented greedy algorithm can try its best to select stepwise a job for an individual machine such that no time overlaps exist between it and the job sequence of the neighboring machine dealt in the corresponding overlapping workspace; and remove such a time overlap only when it is inevitable. Finally, we conduct a case study of a large triplebridge waterjet cutting system by applying the proposed method.

[1]  MengChu Zhou,et al.  Improved population-based incremental learning algorithm for scheduling multi-bridge waterjet cutting processes , 2014, Proceedings of the 11th IEEE International Conference on Networking, Sensing and Control.

[2]  Mengchu Zhou,et al.  A New Multiple Traveling Salesman Problem and Its Genetic Algorithm-Based Solution , 2013, 2013 IEEE International Conference on Systems, Man, and Cybernetics.

[3]  Gaurav S. Sukhatme,et al.  Article in Press Robotics and Autonomous Systems ( ) – Robotics and Autonomous Systems Multi-robot Task Allocation through Vacancy Chain Scheduling , 2022 .

[4]  MengChu Zhou,et al.  A Two-Stage Approach to Path Planning and Collision Avoidance of Multibridge Machining Systems , 2017, IEEE Transactions on Systems, Man, and Cybernetics: Systems.

[5]  Rahul Kala,et al.  Multi-robot path planning using co-evolutionary genetic programming , 2012, Expert Syst. Appl..

[6]  A. G. Gonzalez-Rodriguez,et al.  Collision-free motion planning and scheduling , 2011 .

[7]  MengChu Zhou,et al.  Colored Traveling Salesman Problem , 2015, IEEE Transactions on Cybernetics.

[8]  Hong Qu,et al.  An improved genetic algorithm with co-evolutionary strategy for global path planning of multiple mobile robots , 2013, Neurocomputing.

[9]  A. Schrijver,et al.  The Traveling Salesman Problem , 2011 .

[10]  John T. Wen,et al.  Coverage of a Planar Point Set With Multiple Robots Subject to Geometric Constraints , 2010, IEEE Transactions on Automation Science and Engineering.

[11]  Mengchu Zhou,et al.  Colored Traveling Salesman Problem and Solution , 2014 .

[12]  Gregory Gutin,et al.  Traveling salesman should not be greedy: domination analysis of greedy-type heuristics for the TSP , 2001, Discret. Appl. Math..

[13]  Brett Browning,et al.  xBots: An approach to generating and executing optimal multi-robot plans with cross-schedule dependencies , 2012, 2012 IEEE International Conference on Robotics and Automation.

[14]  David S. Johnson,et al.  The Traveling Salesman Problem: A Case Study in Local Optimization , 2008 .

[15]  H J Yoon,et al.  Scheduling for deadlock avoidance operation in robotic manufacturing cells , 2010 .

[16]  Taixiong Zheng,et al.  Multi-robot task allocation and scheduling based on fish swarm algorithm , 2010, 2010 8th World Congress on Intelligent Control and Automation.

[17]  T. Bektaş The multiple traveling salesman problem: an overview of formulations and solution procedures , 2006 .

[18]  Jun Li,et al.  A COORDINATION AND OPTIMIZATION METHOD FOR MULTI-BRIDGE WATERJET CUTTING PROCESSES , 2012 .

[19]  Nikos A. Aspragathos,et al.  Time-Optimal Task Scheduling for Two Robotic Manipulators Operating in a Three-Dimensional Environment , 2010 .

[20]  Yahui Gan,et al.  Cooperative Path Planning and Constraints Analysis for Master-Slave Industrial Robots , 2012 .