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 | FullText | Text: Availability: 0 CustomLinks: – Url: https://research.chalmers.se/publication/532930# Name: EDS - SwePub (s4221598) Category: fullText Text: View record in SwePub – Url: https://resolver.ebscohost.com/openurl?sid=EBSCO:edsswe&genre=article&issn=15583783&ISBN=&volume=20&issue=4&date=20230101&spage=2203&pages=2203-2214&title=Interlinked combinatorial and geometrical optimization problems in an autonomous automotive manufacturing industry Smart Assembly IEEE Transactions on Automation Science and Engineering&atitle=Spatial%E2%80%93temporal%20load%20balancing%20and%20coordination%20of%20multi-robot%20stations&aulast=%C3%85blad%2C%20Edvin&id=DOI:10.1109/TASE.2022.3214567 Name: Full Text Finder Category: fullText Text: Full Text Finder Icon: https://imageserver.ebscohost.com/branding/images/FTF.gif MouseOverText: Full Text Finder – Url: https://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=EBSCO&SrcAuth=EBSCO&DestApp=WOS&ServiceName=TransferToWoS&DestLinkType=GeneralSearchSummary&Func=Links&author=%C3%85blad%20E Name: ISI Category: fullText Text: Nájsť tento článok vo Web of Science Icon: https://imagesrvr.epnet.com/ls/20docs.gif MouseOverText: Nájsť tento článok vo Web of Science |
|---|---|
| Header | DbId: edsswe DbLabel: SwePub An: edsswe.oai.research.chalmers.se.24a592a2.ee39.4aa0.874e.ff994822ffeb RelevancyScore: 1034 AccessLevel: 6 PubType: Academic Journal PubTypeId: academicJournal PreciseRelevancyScore: 1033.77954101563 |
| IllustrationInfo | |
| Items | – Name: Title Label: Title Group: Ti Data: Spatial–temporal load balancing and coordination of multi-robot stations – Name: Author Label: Authors Group: Au Data: <searchLink fieldCode="AR" term="%22Åblad%2C+Edvin%22">Åblad, Edvin</searchLink>, 1991<br /><searchLink fieldCode="AR" term="%22Spensieri%2C+Domenico%22">Spensieri, Domenico</searchLink>, 1978<br /><searchLink fieldCode="AR" term="%22Bohlin%2C+Robert%22">Bohlin, Robert</searchLink>, 1972<br /><searchLink fieldCode="AR" term="%22Carlson%2C+Johan%22">Carlson, Johan</searchLink>, 1972<br /><searchLink fieldCode="AR" term="%22Strömberg%2C+Ann-Brith%22">Strömberg, Ann-Brith</searchLink>, 1961 – Name: TitleSource Label: Source Group: Src Data: <i>Interlinked combinatorial and geometrical optimization problems in an autonomous automotive manufacturing industry Smart Assembly IEEE Transactions on Automation Science and Engineering</i>. 20(4):2203-2214 – Name: Subject Label: Subject Terms Group: Su Data: <searchLink fieldCode="DE" term="%22robot+programming%22">robot programming</searchLink><br /><searchLink fieldCode="DE" term="%22Robotic+assembly%22">Robotic assembly</searchLink><br /><searchLink fieldCode="DE" term="%22path+planning%22">path planning</searchLink><br /><searchLink fieldCode="DE" term="%22discrete+optimization%22">discrete optimization</searchLink><br /><searchLink fieldCode="DE" term="%22coordination%22">coordination</searchLink><br /><searchLink fieldCode="DE" term="%22automotive+manufacturing%22">automotive manufacturing</searchLink><br /><searchLink fieldCode="DE" term="%22generalized+Voronoi+diagram%22">generalized Voronoi diagram</searchLink> – Name: Abstract Label: Description Group: Ab Data: 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. – Name: Format Label: File Description Group: SrcInfo Data: electronic – Name: URL Label: Access URL Group: URL Data: <link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/532930" linkWindow="_blank">https://research.chalmers.se/publication/532930</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/533158" linkWindow="_blank">https://research.chalmers.se/publication/533158</link><br /><link linkTarget="URL" linkTerm="https://research.chalmers.se/publication/533158/file/533158_Fulltext.pdf" linkWindow="_blank">https://research.chalmers.se/publication/533158/file/533158_Fulltext.pdf</link> |
| PLink | https://erproxy.cvtisr.sk/sfx/access?url=https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=edsswe&AN=edsswe.oai.research.chalmers.se.24a592a2.ee39.4aa0.874e.ff994822ffeb |
| RecordInfo | BibRecord: BibEntity: Identifiers: – Type: doi Value: 10.1109/TASE.2022.3214567 Languages: – Text: English PhysicalDescription: Pagination: PageCount: 12 StartPage: 2203 Subjects: – SubjectFull: robot programming Type: general – SubjectFull: Robotic assembly Type: general – SubjectFull: path planning Type: general – SubjectFull: discrete optimization Type: general – SubjectFull: coordination Type: general – SubjectFull: automotive manufacturing Type: general – SubjectFull: generalized Voronoi diagram Type: general Titles: – TitleFull: Spatial–temporal load balancing and coordination of multi-robot stations Type: main BibRelationships: HasContributorRelationships: – PersonEntity: Name: NameFull: Åblad, Edvin – PersonEntity: Name: NameFull: Spensieri, Domenico – PersonEntity: Name: NameFull: Bohlin, Robert – PersonEntity: Name: NameFull: Carlson, Johan – PersonEntity: Name: NameFull: Strömberg, Ann-Brith IsPartOfRelationships: – BibEntity: Dates: – D: 01 M: 01 Type: published Y: 2023 Identifiers: – Type: issn-print Value: 15583783 – Type: issn-print Value: 15455955 – Type: issn-locals Value: SWEPUB_FREE – Type: issn-locals Value: CTH_SWEPUB Numbering: – Type: volume Value: 20 – Type: issue Value: 4 Titles: – TitleFull: Interlinked combinatorial and geometrical optimization problems in an autonomous automotive manufacturing industry Smart Assembly IEEE Transactions on Automation Science and Engineering Type: main |
| ResultId | 1 |