Robot Path Integration in Manufacturing Processes: Genetic Algorithm Versus Ant Colony Optimization

Tool path planning for automated manufacturing processes is a computationally complex task. This paper addresses the problem of tool path integration in the context of spray-forming processes. Tool paths for geometry-complicated parts are generated by partitioning them into individual freeform surfa...

Full description

Saved in:
Bibliographic Details
Published inIEEE transactions on systems, man and cybernetics. Part A, Systems and humans Vol. 38; no. 2; pp. 278 - 287
Main Authors Tewolde, G.S., Weihua Sheng
Format Journal Article
LanguageEnglish
Published IEEE 01.03.2008
Subjects
Online AccessGet full text
ISSN1083-4427
1558-2426
DOI10.1109/TSMCA.2007.914769

Cover

Abstract Tool path planning for automated manufacturing processes is a computationally complex task. This paper addresses the problem of tool path integration in the context of spray-forming processes. Tool paths for geometry-complicated parts are generated by partitioning them into individual freeform surfaces, generating the paths for each partition, and then, finally, interconnecting the paths from the different patches so as to minimize the overall path length. We model the problem as a variant of the rural postman problem (RPP), which we call open-RPP. In this paper, we present two different solutions to the open-RPP. The first solution is based on genetic algorithms and the second one is based on ant colony optimization. This paper presents and compares the results from both methods on sample data and on real-world automotive body parts. We conclude this paper with remarks about the effectiveness of our implementations and the pros and cons of each method.
AbstractList Tool path planning for automated manufacturing processes is a computationally complex task. This paper addresses the problem of tool path integration in the context of spray-forming processes. Tool paths for geometry-complicated parts are generated by partitioning them into individual freeform surfaces, generating the paths for each partition, and then, finally, interconnecting the paths from the different patches so as to minimize the overall path length. We model the problem as a variant of the rural postman problem (RPP), which we call open-RPP. In this paper, we present two different solutions to the open-RPP. The first solution is based on genetic algorithms and the second one is based on ant colony optimization. This paper presents and compares the results from both methods on sample data and on real-world automotive body parts. We conclude this paper with remarks about the effectiveness of our implementations and the pros and cons of each method.
Author Tewolde, G.S.
Weihua Sheng
Author_xml – sequence: 1
  givenname: G.S.
  surname: Tewolde
  fullname: Tewolde, G.S.
  organization: Kettering Univ., Flint
– sequence: 2
  surname: Weihua Sheng
  fullname: Weihua Sheng
BookMark eNp9kLtOwzAUhi0EElB4AMTijSnFt8QJW1VBqUQF4rZGtnPSGqV2sZ2hPD29IAYGpnOG__uPzneKDp13gNAFJUNKSXX9-jIbj4aMEDmsqJBFdYBOaJ6XGROsONzspOSZEEweo9MYPwihQlTiBJlnr33CTyot8NQlmAeVrHfYOjxTrm-VSX2wbo6fgjcQI8QbPAEHyRo86uY-2LRY4ncIsY945BIe-867NX5cJbu0X7uyM3TUqi7C-c8coLe729fxffbwOJmORw-Z4RVJGWctyKbhbSF0qXVpSFMIxnnBZG4Eyzml1LRVq3MpNTFaK15wwjQXkDeyqfgAXe17V8F_9hBTvbTRQNcpB76PdSkZFTQvy02S7pMm-BgDtPUq2KUK65qSeuuz3vmstz7rvc8NI_8wxqbdfyko2_1LXu5JCwC_l4QQPC9K_g2PNIZj
CODEN ITSHFX
CitedBy_id crossref_primary_10_1177_1729881416663663
crossref_primary_10_3390_machines11040430
crossref_primary_10_1016_j_autcon_2018_02_029
crossref_primary_10_1002_dac_5507
crossref_primary_10_1109_TII_2018_2889740
crossref_primary_10_3233_JIFS_222211
crossref_primary_10_3390_drones8050171
crossref_primary_10_1109_TCYB_2014_2359966
crossref_primary_10_1016_j_oceaneng_2022_113391
crossref_primary_10_1016_S1672_6529_14_60125_6
crossref_primary_10_1109_TSMCA_2009_2025027
crossref_primary_10_1109_TSMCA_2009_2029557
crossref_primary_10_3390_aerospace9020086
crossref_primary_10_1088_1742_6596_1176_5_052006
crossref_primary_10_1007_s12541_021_00512_2
crossref_primary_10_1016_j_rcim_2014_12_003
crossref_primary_10_3390_math11132931
crossref_primary_10_5772_58543
crossref_primary_10_1109_ACCESS_2021_3108177
crossref_primary_10_1109_TR_2019_2930358
crossref_primary_10_1109_TSMCC_2011_2182609
crossref_primary_10_5772_9705
crossref_primary_10_1016_j_matpr_2021_10_009
Cites_doi 10.1162/106454699568728
10.1109/2.16221
10.1109/ROBOT.2000.844755
10.1109/ROBOT.2004.1307127
10.1109/100.728220
10.1109/ROBOT.2001.932525
10.1109/ROBOT.1993.292266
10.1109/EURCON.2005.1629922
10.1108/13552540210413284
10.1023/A:1023926804240
10.1109/IROS.2003.1249711
10.1109/ROBOT.2002.1013401
10.1109/3477.484436
10.1023/A:1025850513781
10.1109/ROBOT.2003.1242209
10.1145/330560.330832
10.1109/ICAR.1991.240615
10.1109/TSMCA.2003.817391
10.1016/0004-3702(88)90053-7
10.1145/330560.330839
10.1109/ROBOT.1997.619061
ContentType Journal Article
DBID 97E
RIA
RIE
AAYXX
CITATION
7U1
C1K
DOI 10.1109/TSMCA.2007.914769
DatabaseName IEEE All-Society Periodicals Package (ASPP) 2005–Present
IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Risk Abstracts
Environmental Sciences and Pollution Management
DatabaseTitle CrossRef
Risk Abstracts
Environmental Sciences and Pollution Management
DatabaseTitleList Risk Abstracts

Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://proxy.k.utb.cz/login?url=https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Sciences (General)
EISSN 1558-2426
EndPage 287
ExternalDocumentID 10_1109_TSMCA_2007_914769
4443568
Genre orig-research
GroupedDBID -~X
0R~
29I
4.4
5VS
6IK
85S
97E
AAJGR
AASAJ
AAWTH
ABAZT
ABQJQ
ABVLG
ACGFS
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
EBS
EJD
F5P
HZ~
IFIPE
IFJZH
IPLJI
JAVBF
LAI
M43
O9-
OCL
PZZ
RIA
RIE
RNS
VH1
VJK
AAYXX
CITATION
7U1
C1K
ID FETCH-LOGICAL-c390t-32fe7dd3f64b8bb8c0d642336275c4253111cf9fb577b0cbba36302b34e5d7d93
IEDL.DBID RIE
ISSN 1083-4427
IngestDate Tue Oct 07 08:06:43 EDT 2025
Thu Apr 24 23:01:47 EDT 2025
Wed Oct 01 04:51:42 EDT 2025
Tue Aug 26 16:47:22 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 2
Keywords genetic algorithm (GA)
Ant colony optimization (ACO)
path integration
tool path planning
spray forming
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c390t-32fe7dd3f64b8bb8c0d642336275c4253111cf9fb577b0cbba36302b34e5d7d93
Notes ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
PQID 872141588
PQPubID 23462
PageCount 10
ParticipantIDs ieee_primary_4443568
crossref_primary_10_1109_TSMCA_2007_914769
crossref_citationtrail_10_1109_TSMCA_2007_914769
proquest_miscellaneous_872141588
ProviderPackageCode CITATION
AAYXX
PublicationCentury 2000
PublicationDate 2008-03-01
PublicationDateYYYYMMDD 2008-03-01
PublicationDate_xml – month: 03
  year: 2008
  text: 2008-03-01
  day: 01
PublicationDecade 2000
PublicationTitle IEEE transactions on systems, man and cybernetics. Part A, Systems and humans
PublicationTitleAbbrev TSMCA
PublicationYear 2008
Publisher IEEE
Publisher_xml – name: IEEE
References ref13
ref12
ref14
lawler (ref17) 1985
ref11
kao (ref15) 1998
ref10
ref2
ref1
ref16
antonio (ref7) 1997; 12
ref23
ref26
ref25
ref20
ref22
ref21
(ref24) 2006
ref8
gen (ref18) 1997
ref9
ref4
ref3
ref6
ref5
thede (ref19) 2004; 20
References_xml – ident: ref22
  doi: 10.1162/106454699568728
– start-page: 1
  year: 1998
  ident: ref15
  article-title: optimal motion planning for deposition in layered manufacturing
  publication-title: Proc ASME Design Eng Tech Conf
– volume: 12
  start-page: 124
  year: 1997
  ident: ref7
  article-title: a framework for optimal trajectory planning for automated spray coating
  publication-title: Int J Robot Autom
– year: 1985
  ident: ref17
  publication-title: The Traveling Salesman Problem
– year: 1997
  ident: ref18
  publication-title: Genetic Algorithms and Engineering Design
– ident: ref2
  doi: 10.1109/2.16221
– ident: ref11
  doi: 10.1109/ROBOT.2000.844755
– ident: ref14
  doi: 10.1109/ROBOT.2004.1307127
– ident: ref9
  doi: 10.1109/100.728220
– ident: ref3
  doi: 10.1109/ROBOT.2001.932525
– ident: ref5
  doi: 10.1109/ROBOT.1993.292266
– ident: ref26
  doi: 10.1109/EURCON.2005.1629922
– ident: ref13
  doi: 10.1108/13552540210413284
– ident: ref25
  doi: 10.1023/A:1023926804240
– ident: ref8
  doi: 10.1109/IROS.2003.1249711
– ident: ref12
  doi: 10.1109/ROBOT.2002.1013401
– ident: ref21
  doi: 10.1109/3477.484436
– volume: 20
  start-page: 115
  year: 2004
  ident: ref19
  article-title: an introduction to genetic algorithms
  publication-title: J Comput Sci Colleges
  doi: 10.1023/A:1025850513781
– ident: ref10
  doi: 10.1109/ROBOT.2003.1242209
– ident: ref16
  doi: 10.1145/330560.330832
– ident: ref4
  doi: 10.1109/ICAR.1991.240615
– ident: ref23
  doi: 10.1109/TSMCA.2003.817391
– ident: ref1
  doi: 10.1016/0004-3702(88)90053-7
– ident: ref20
  doi: 10.1145/330560.330839
– year: 2006
  ident: ref24
  publication-title: Floyd-Marshall algorithm
– ident: ref6
  doi: 10.1109/ROBOT.1997.619061
SSID ssj0014494
Score 2.0703871
Snippet Tool path planning for automated manufacturing processes is a computationally complex task. This paper addresses the problem of tool path integration in the...
SourceID proquest
crossref
ieee
SourceType Aggregation Database
Enrichment Source
Index Database
Publisher
StartPage 278
SubjectTerms Ant colony optimization
Ant colony optimization (ACO)
Design automation
Formicidae
genetic algorithm (GA)
Genetic algorithms
Glass
Manufacturing automation
Manufacturing processes
path integration
Path planning
Robotics and automation
Robots
spray forming
Spraying
tool path planning
Title Robot Path Integration in Manufacturing Processes: Genetic Algorithm Versus Ant Colony Optimization
URI https://ieeexplore.ieee.org/document/4443568
https://www.proquest.com/docview/872141588
Volume 38
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1558-2426
  dateEnd: 20121231
  omitProxy: false
  ssIdentifier: ssj0014494
  issn: 1083-4427
  databaseCode: RIE
  dateStart: 19960101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1LS8QwEB50T3pQ1weuL3LwoGLXtsnm4W1ZFBVWxQd4K02aqqituO1Bf71Jml1ERbz1kNDAl5lMMjPfB7DNs8ypWAdRmrKA6JQGkuUq0BSnmArMmbC9w8NzenJLzu56d1OwP-mF0Vq74jPdtZ8ul5-VqrZPZQeEmMOd8mmYZpw2vVqTjAEhTvQwMiFFQEjMfAYzCsXBzfVw0G_YCkVEmK1t_nIGOVGVH57YHS_H8zAcL6ypKnnq1pXsqo9vnI3_XfkCzPk4E_WbjdGGKV0swuwX9sFFaHu7HqEdTz69uwTqqpRlhS5NYIhOPZWEgQ49FmiYFrXtg3CNjch3GOjRIbKzzW9Q__m-fHusHl6QfYWrR6hfVGhgvGvxji6Ma3rxPZ_LcHt8dDM4CbwQQ6CwCKsAx7lmWYZzSiSXkqswM9cWjC3DsTJGj43DVLnIZY8xGSopDcw4jCUmupexTOAVaBVloVcBRTSlcayJDq0WoIxEasASUqpeRGWs4g6EY2gS5VnKrVjGc-JuK6FIHJpWPZMlDZod2JtMeW0oOv4avGTRmQz0wHQAjfFPjH3ZpEla6LIeJdxckU2Qw_na7zPXYaYpIbFlaRvQqt5qvWnilEpuuQ36CWVA5E0
linkProvider IEEE
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwjV1NT9wwEB1Remg5QIEiFvrhQw9t1SxJ7Ngxt9WqaGkJrWCRuEWx4wACEsQmB_j1HTveFWqrqjcfbNnSs8djz7w3AB_SsnRVrIOoKETATMEDJSodGE4LyiVNhbTc4eyYT87Yt_PkfAm-LLgwxhiXfGaGtuli-WWjO_tVtscYXu48fQbPE2wmPVtrETNgzJU9jNCpCBiLhY9hRqHcm55m41GvVygjJmx285NbyJVV-cMWuwvmYA2y-dL6vJLrYdeqoX78TbXxf9f-Cla9p0lG_dZYhyVTb8DKE_3BDVj3J3tGPnr56U-boE8a1bTkJ7qG5NCLSSB45KomWVF3lgnhqI3EcwzMbJ_Y0TgNGd1cNPdX7eUtsf9w3YyM6paM0b7WD-QHGqdbz_p8DWcHX6fjSeBLMQSayrANaFwZUZa04kylSqU6LPHhQqnVONZ47CmaTF3JSiVCqFArhUDTMFaUmaQUpaRbsFw3tdkGEvGCx7FhJrTVAFUkCwRLKqWTiKtYxwMI59Dk2uuU23IZN7l7r4Qyd2ja-pki79EcwOfFkLtepONfnTctOouOHpgBkDn-OZ4wGzYpatN0szzFRzK6OWm68_eR7-HFZJod5UeHx9934WWfUGKT1N7AcnvfmbfotbTqndusvwB_jOea
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=article&rft.atitle=Robot+Path+Integration+in+Manufacturing+Processes%3A+Genetic+Algorithm+Versus+Ant+Colony+Optimization&rft.jtitle=IEEE+transactions+on+systems%2C+man+and+cybernetics.+Part+A%2C+Systems+and+humans&rft.au=Tewolde%2C+G+S&rft.au=Weihua+Sheng%2C+Weihua+Sheng&rft.date=2008-03-01&rft.issn=1083-4427&rft.volume=38&rft.issue=2&rft_id=info:doi/10.1109%2FTSMCA.2007.914769&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1083-4427&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1083-4427&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1083-4427&client=summon