{"id":"https://openalex.org/W2767096559","doi":"https://doi.org/10.1109/tase.2017.2761180","title":"Intersection-Free Geometrical Partitioning of Multirobot Stations for Cycle Time Optimization","display_name":"Intersection-Free Geometrical Partitioning of Multirobot Stations for Cycle Time Optimization","publication_year":2017,"publication_date":"2017-10-26","ids":{"openalex":"https://openalex.org/W2767096559","doi":"https://doi.org/10.1109/tase.2017.2761180","mag":"2767096559"},"language":"en","primary_location":{"id":"doi:10.1109/tase.2017.2761180","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2017.2761180","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5084999502","display_name":"Edvin \u00c5blad","orcid":"https://orcid.org/0000-0002-4627-4360"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Edvin Ablad","raw_affiliation_strings":["Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden"],"raw_orcid":"https://orcid.org/0000-0002-4627-4360","affiliations":[{"raw_affiliation_string":"Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5035495788","display_name":"Domenico Spensieri","orcid":"https://orcid.org/0000-0002-0124-9022"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Domenico Spensieri","raw_affiliation_strings":["Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5079777366","display_name":"Robert Bohlin","orcid":"https://orcid.org/0000-0003-0961-8811"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert Bohlin","raw_affiliation_strings":["Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5045892686","display_name":"Johan S. Carlson","orcid":"https://orcid.org/0000-0002-6042-5540"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Johan S. Carlson","raw_affiliation_strings":["Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Geometry and Motion Planning Group, Research Centre for Industrial Mathematics, FCC, Gothenburg, Sweden","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5084999502"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.8408,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.87714663,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"15","issue":"2","first_page":"842","last_page":"851"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12782","display_name":"Assembly Line Balancing Optimization","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/workspace","display_name":"Workspace","score":0.7787753343582153},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7747601866722107},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.7348608374595642},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.6870723366737366},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6700934171676636},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6142934560775757},{"id":"https://openalex.org/keywords/real-time-computing","display_name":"Real-time computing","score":0.4177306890487671},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34949392080307007},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3205495774745941},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.228620707988739},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.17224282026290894},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11202248930931091}],"concepts":[{"id":"https://openalex.org/C58581272","wikidata":"https://www.wikidata.org/wiki/Q12741163","display_name":"Workspace","level":3,"score":0.7787753343582153},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7747601866722107},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7348608374595642},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.6870723366737366},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6700934171676636},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6142934560775757},{"id":"https://openalex.org/C79403827","wikidata":"https://www.wikidata.org/wiki/Q3988","display_name":"Real-time computing","level":1,"score":0.4177306890487671},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34949392080307007},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3205495774745941},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.228620707988739},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.17224282026290894},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11202248930931091},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/tase.2017.2761180","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tase.2017.2761180","pdf_url":null,"source":{"id":"https://openalex.org/S34881539","display_name":"IEEE Transactions on Automation Science and Engineering","issn_l":"1545-5955","issn":["1545-5955","1558-3783"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Automation Science and Engineering","raw_type":"journal-article"},{"id":"pmh:oai:publications.lib.chalmers.se:254675","is_oa":false,"landing_page_url":"http://publications.lib.chalmers.se/publication/254675-intersection-free-geometrical-partitioning-of-multirobot-stations-for-cycle-time-optimization","pdf_url":null,"source":{"id":"https://openalex.org/S4377196470","display_name":"Chalmers Publication Library (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text.Article.Journal.PeerReviewed"},{"id":"pmh:oai:research.chalmers.se:254675","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/254675","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""},{"id":"pmh:oai:research.chalmers.se:515683","is_oa":false,"landing_page_url":"https://research.chalmers.se/en/publication/883560d6-344d-4e2f-990b-34910556576e","pdf_url":null,"source":{"id":"https://openalex.org/S4306402469","display_name":"Chalmers Research (Chalmers University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I66862912","host_organization_name":"Chalmers University of Technology","host_organization_lineage":["https://openalex.org/I66862912"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":""}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5400000214576721,"id":"https://metadata.un.org/sdg/9","display_name":"Industry, innovation and infrastructure"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W94792778","https://openalex.org/W141747677","https://openalex.org/W429990585","https://openalex.org/W1530079218","https://openalex.org/W1547958754","https://openalex.org/W1978264569","https://openalex.org/W1983164251","https://openalex.org/W2016985188","https://openalex.org/W2029735784","https://openalex.org/W2056282208","https://openalex.org/W2074261743","https://openalex.org/W2081232663","https://openalex.org/W2092924973","https://openalex.org/W2105787045","https://openalex.org/W2111994433","https://openalex.org/W2120168439","https://openalex.org/W2153504150","https://openalex.org/W2167580124","https://openalex.org/W2181535787","https://openalex.org/W2327163782","https://openalex.org/W2521948973","https://openalex.org/W2623840627","https://openalex.org/W4239339957"],"related_works":["https://openalex.org/W1992503747","https://openalex.org/W2371519816","https://openalex.org/W2043154226","https://openalex.org/W2369529107","https://openalex.org/W2329043542","https://openalex.org/W2109948066","https://openalex.org/W1678858522","https://openalex.org/W3195090107","https://openalex.org/W38056103","https://openalex.org/W2031096545"],"abstract_inverted_index":{"Assembly":[0],"cells,":[1],"where":[2,161,221],"multiple":[3],"robots":[4,86,223],"perform":[5],"sets":[6],"of":[7,33,163,197],"tasks,":[8],"often":[9,41],"face":[10],"the":[11,28,34,43,48,122,135,149,158,171,175,181,198,210,222,235],"challenge":[12],"to":[13,36,53,66,78,105,111,145,218,234],"minimize":[14,79],"cycle":[15,44,80,99,185,231],"time":[16,45,81,89,100],"and":[17,46,56,103,151,191,229],"avoid":[18,146],"collisions.":[19],"Collisions":[20],"are":[21,140,189,202],"avoided":[22],"by":[23],"introducing":[24],"synchronization":[25],"schemes":[26],"among":[27,73,85],"robots,":[29],"preventing":[30],"shared":[31],"volumes":[32],"workspaces":[35],"be":[37],"simultaneously":[38],"entered.":[39],"Synchronization":[40],"increases":[42],"makes":[47],"robot":[49,113,138],"programming":[50],"more":[51],"difficult":[52],"generate,":[54],"adjust,":[55],"maintain.":[57],"In":[58,157],"this":[59],"paper,":[60],"we":[61],"present":[62],"a":[63,94,112,115,167],"novel":[64],"method":[65],"maximize":[67],"throughput":[68],"while":[69],"eliminating":[70],"all":[71],"synchronizations":[72],"robots.":[74],"We":[75],"devise":[76],"algorithms":[77],"generating":[82],"no":[83,118],"intersection":[84],"at":[87],"any":[88],"during":[90],"their":[91,154],"paths.":[92],"First,":[93],"surrogate":[95,182],"model":[96,183],"for":[97],"minimizing":[98],"is":[101,109,125,132,177,216],"provided":[102],"solved":[104],"optimality:":[106],"each":[107,129,227],"task":[108],"assigned":[110],"in":[114,143,153],"way":[116],"that":[117,128,214],"collision":[119],"occurs.":[120],"Afterward,":[121],"entire":[123],"workspace":[124,131],"partitioned":[126],"such":[127],"robot's":[130],"separated":[133],"from":[134,209],"others.":[136],"Finally,":[137],"paths":[139],"generated":[141,190,237],"automatically":[142],"order":[144],"collisions":[147],"with":[148,226],"environment":[150],"remaining":[152],"precomputed":[155],"partitions.":[156],"rare":[159],"cases":[160,208],"some":[162],"these":[164],"steps":[165],"fail,":[166],"feedback":[168],"procedure":[169],"redistributing":[170],"tasks":[172],"or":[173],"modifying":[174],"partitions":[176],"adopted.":[178],"Furthermore,":[179],"since":[180],"approximates":[184],"time,":[186],"several":[187],"solutions":[188],"evaluated":[192],"based":[193],"on":[194,206],"better":[195],"approximations":[196],"model.":[199],"The":[200],"results":[201],"convincing:":[203],"computational":[204],"experience":[205],"different":[207],"automotive":[211],"industry":[212],"shows":[213],"it":[215],"possible":[217],"generate":[219],"programs":[220],"never":[224],"intersect":[225],"other":[228],"achieve":[230],"times":[232],"comparable":[233],"ones":[236],"allowing":[238],"synchronization.":[239]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}