A Dual-Robot Welding Path Planning Method Based on Kmeans and Ant Colony Algorithms

For the problem of double robots working together in the welding process, this project proposes a path planning method based on Kmeans algorithm and ant colony algorithm. The Kmeans algorithm is used to classify all weld joint tasks and reasonably assign them to individual robots. The ant colony alg...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Proceedings (International Conference on Informative and Cybernetics for Computational Social Systems. Online) S. 172 - 176
Hauptverfasser: Wang, Jingjing, Deng, Hongli, Wang, Cun, Cao, Xinliang
Format: Tagungsbericht
Sprache:Englisch
Veröffentlicht: IEEE 10.12.2021
Schlagworte:
Ant Colony Algorithm
Classification algorithms
Clustering algorithms
Dual-Robot
Kmeans clustering algorithm
Path planning
Robots
Simulation
Task analysis
Welding
ISSN:2639-4235
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Abstract For the problem of double robots working together in the welding process, this project proposes a path planning method based on Kmeans algorithm and ant colony algorithm. The Kmeans algorithm is used to classify all weld joint tasks and reasonably assign them to individual robots. The ant colony algorithm is used to sort the weld joints assigned to individual robots and also to plan the work route for each robot. The simulation results show that the task assignment to this method is more scientific and reasonable than the existing methods, and the path planning results are shorter than the existing ones.
AbstractList For the problem of double robots working together in the welding process, this project proposes a path planning method based on Kmeans algorithm and ant colony algorithm. The Kmeans algorithm is used to classify all weld joint tasks and reasonably assign them to individual robots. The ant colony algorithm is used to sort the weld joints assigned to individual robots and also to plan the work route for each robot. The simulation results show that the task assignment to this method is more scientific and reasonable than the existing methods, and the path planning results are shorter than the existing ones.
Author Deng, Hongli
Wang, Cun
Cao, Xinliang
Wang, Jingjing
Author_xml – sequence: 1
  givenname: Jingjing
  surname: Wang
  fullname: Wang, Jingjing
  email: wangjj1204@126.com
  organization: Guangxi Science & Technology of Normal University,College of Vocational and Technical Education,Laibin,China
– sequence: 2
  givenname: Hongli
  surname: Deng
  fullname: Deng, Hongli
  email: 361389651@qq.com
  organization: Guangxi Science & Technology of Normal University,School of Culture and Communication,Laibin,China
– sequence: 3
  givenname: Cun
  surname: Wang
  fullname: Wang, Cun
  email: gxutwc@163.com
  organization: Guangxi Science & Technology of Normal University,College of Vocational and Technical Education,Laibin,China
– sequence: 4
  givenname: Xinliang
  surname: Cao
  fullname: Cao, Xinliang
  email: 376475069@qq.com
  organization: Guangxi Science & Technology of Normal University,College of Vocational and Technical Education,Laibin,China
BookMark eNotkMFOwzAQRA0Cibb0CzjgH0jweh3HPoZQoKKIioA4VpvENEGJjZpw6N9TRE-jeRq9w0zZmQ_eMXYNIgYQ9maZ50WRoBU2lkJCbFMpBcIJm4LWiRJSJeaUTaRGGymJyQWbD8OXEAIPM5XAhBUZv_uhLnoNZRj5h-vq1m_5msaGrzvy_q89u7EJNb-lwdU8eP7UO_IDJ1_zzI88D13we55127Brx6YfLtn5J3WDmx9zxt7vF2_5Y7R6eVjm2SpqAcwYVbqURiqXWtBoDLrKWKVJaIRE1lWKtjxQK4y22qB2UluTgjJkakICwhm7-ve2zrnN967tabffHD_AX25uUFc
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/ICCSS53909.2021.9722031
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
EISBN 1665402458
9781665402453
EISSN 2639-4235
EndPage 176
ExternalDocumentID 9722031
Genre orig-research
GrantInformation_xml – fundername: Ministry of Education
  funderid: 10.13039/100010002
GroupedDBID 6IE
6IF
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
IEGSK
OCL
RIE
RIL
ID FETCH-LOGICAL-i118t-c6b2824e79163883ec8946a063152dc739b883908696836e26987148a8da3a1a3
IEDL.DBID RIE
IngestDate Wed Aug 27 02:49:18 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i118t-c6b2824e79163883ec8946a063152dc739b883908696836e26987148a8da3a1a3
PageCount 5
ParticipantIDs ieee_primary_9722031
PublicationCentury 2000
PublicationDate 2021-Dec.-10
PublicationDateYYYYMMDD 2021-12-10
PublicationDate_xml – month: 12
  year: 2021
  text: 2021-Dec.-10
  day: 10
PublicationDecade 2020
PublicationTitle Proceedings (International Conference on Informative and Cybernetics for Computational Social Systems. Online)
PublicationTitleAbbrev ICCSS
PublicationYear 2021
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0003203451
Score 1.8003386
Snippet For the problem of double robots working together in the welding process, this project proposes a path planning method based on Kmeans algorithm and ant colony...
SourceID ieee
SourceType Publisher
StartPage 172
SubjectTerms Ant Colony Algorithm
Classification algorithms
Clustering algorithms
Dual-Robot
Kmeans clustering algorithm
Path planning
Robots
Simulation
Task analysis
Welding
Title A Dual-Robot Welding Path Planning Method Based on Kmeans and Ant Colony Algorithms
URI https://ieeexplore.ieee.org/document/9722031
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV3PS8MwFA5zePCksom_ycGj2ZqmTZPjrA5FHMMp7jaS9E0HWytbJ_jf-9LNieDFW0kphRfyvvcl78tHyIXDJSNDp5kGASyKYmAmHMdMKyszxAuLibkym0h6PTUc6n6NXG60MABQNZ9Byz9WZ_lZ4ZZ-q6ytkzAMvGh6K0mSlVZrs58i8E0U83ULFw90-y5NB4MYOb3Xo4S8tf76l41KhSLd3f_9f480f-R4tL8Bmn1Sg7xBBh16vTRT9ljYoqQvUB0i0T4WdPTbiIg-VPbQ9AqRKqNFTu9ngMhETZ7RTl7SFBNf_kk709diPinfZosmee7ePKW3bO2QwCZIDErmpEXKFEGifVmlBDilI2mw7MAwZy4R2uKoRtqipRISQqmRIEXKqMwIw404IPW8yOGQUAsqQ2gXjo9lxLW20oCwymESMAGH4Ig0fEBG76tLMEbrWBz_PXxCdnzMfd8HD05JvZwv4Yxsu49yspifVzP3BY42l78
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1dS8MwFA1jCvqksonf5sFHuzVNmiaPszoc-2C4iXsbaXqng62VrRP89952cyL44ltJKZQbcs89yT05hNxYXDLSs9rRwMERwgfHeBPf0SqSMeJFhIm5MJsIej01Gul-idxutTAAUDSfQS1_LM7y49Su8q2yug48z81F0zu-EB5bq7W2Oyoc3wmfbZq4mKvrrTAcDHxk9bkixWO1zfe_jFQKHGke_O8PDkn1R5BH-1uoOSIlSCpk0KD3KzNzntIozegLFMdItI8lHf22IqLdwiCa3iFWxTRNaHsOiE3UJDFtJBkNMfUln7Qxe00X0-xtvqyS5-bDMHx0Nh4JzhSpQeZYGSFpEhDovLBSHKzSQhosPDDQsQ24jnBUI3HRUnEJntRIkYQyKjbcMMOPSTlJEzghNAIVI7hzyyZSMK0jaYBHymIaMC4D95RU8oCM39fXYIw3sTj7e_ia7D0Ou51xp9Vrn5P9PP55FwhzL0g5W6zgkuzaj2y6XFwVs_gFqC6bBg
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=proceeding&rft.title=Proceedings+%28International+Conference+on+Informative+and+Cybernetics+for+Computational+Social+Systems.+Online%29&rft.atitle=A+Dual-Robot+Welding+Path+Planning+Method+Based+on+Kmeans+and+Ant+Colony+Algorithms&rft.au=Wang%2C+Jingjing&rft.au=Deng%2C+Hongli&rft.au=Wang%2C+Cun&rft.au=Cao%2C+Xinliang&rft.date=2021-12-10&rft.pub=IEEE&rft.eissn=2639-4235&rft.spage=172&rft.epage=176&rft_id=info:doi/10.1109%2FICCSS53909.2021.9722031&rft.externalDocID=9722031