Spatial–temporal load balancing and coordination of multi-robot stations
Uloženo v:
| Název: | Spatial–temporal load balancing and coordination of multi-robot stations |
|---|---|
| Autoři: | Åblad, Edvin, 1991, Spensieri, Domenico, 1978, Bohlin, Robert, 1972, Carlson, Johan, 1972, Strömberg, Ann-Brith, 1961 |
| Zdroj: | Interlinked combinatorial and geometrical optimization problems in an autonomous automotive manufacturing industry Smart Assembly IEEE Transactions on Automation Science and Engineering. 20(4):2203-2214 |
| Témata: | robot programming, Robotic assembly, path planning, discrete optimization, coordination, automotive manufacturing, generalized Voronoi diagram |
| Popis: | Cycle time minimization in multi-robot manufacturing stations is computationally challenging. This is due to the many aspects that need to be accounted for, including assigning process tasks to robots, specifying robot configurations at tasks, sequencing, planning motions, and coordinating the robots to avoid collisions. Hence, to find good solutions, often some assumptions are made and/or the problem is divided into subproblems—often limiting the set of solutions with the risk of excluding the best ones. In this study, we generalize the completely disjoint solution method that challenges the so-called shortest path assumption, i.e., to let each robot use its shortest collision-free motion between any two configurations, regardless of the other robots. We devise a generalized method called spatial–temporal load balancing and coordination, which prevents robot–robot collisions by a sequence of disjoint solutions, guiding task assignments, sequences, and robot motions (path and velocity). We study both artificial and industrial instances. For some of them, our suggested method is superior to methods based on the shortest path assumption, with as much as a 28% reduction in cycle time. Moreover, for problem instances with no special structure, we establish that the shortest path assumption is often reasonable. Note to Practitioners—This work is motivated by a particular industrial problem instance of a spot-welding station with two robots and where welds are placed along the edge of a workpiece. Due to the special geometry of the instance one robot can only perform welds in the middle of the edge and the other only at the ends. As a result, if the robots use their shortest motions between welds, then waiting times are required to prevent collisions. Moreover, the tasks are too close to each other to allow for a completely disjoint solution. Hence, we suggest a method based on sequence of disjoint solutions. |
| Popis souboru: | electronic |
| Přístupová URL adresa: | https://research.chalmers.se/publication/532930 https://research.chalmers.se/publication/533158 https://research.chalmers.se/publication/533158/file/533158_Fulltext.pdf |
| Databáze: | SwePub |
Full Text Finder 
Nájsť tento článok vo Web of Science | Abstrakt: | Cycle time minimization in multi-robot manufacturing stations is computationally challenging. This is due to the many aspects that need to be accounted for, including assigning process tasks to robots, specifying robot configurations at tasks, sequencing, planning motions, and coordinating the robots to avoid collisions. Hence, to find good solutions, often some assumptions are made and/or the problem is divided into subproblems—often limiting the set of solutions with the risk of excluding the best ones. In this study, we generalize the completely disjoint solution method that challenges the so-called shortest path assumption, i.e., to let each robot use its shortest collision-free motion between any two configurations, regardless of the other robots. We devise a generalized method called spatial–temporal load balancing and coordination, which prevents robot–robot collisions by a sequence of disjoint solutions, guiding task assignments, sequences, and robot motions (path and velocity). We study both artificial and industrial instances. For some of them, our suggested method is superior to methods based on the shortest path assumption, with as much as a 28% reduction in cycle time. Moreover, for problem instances with no special structure, we establish that the shortest path assumption is often reasonable. Note to Practitioners—This work is motivated by a particular industrial problem instance of a spot-welding station with two robots and where welds are placed along the edge of a workpiece. Due to the special geometry of the instance one robot can only perform welds in the middle of the edge and the other only at the ends. As a result, if the robots use their shortest motions between welds, then waiting times are required to prevent collisions. Moreover, the tasks are too close to each other to allow for a completely disjoint solution. Hence, we suggest a method based on sequence of disjoint solutions. |
|---|---|
| ISSN: | 15583783 15455955 |
| DOI: | 10.1109/TASE.2022.3214567 |