{"id":"https://openalex.org/W2967877442","doi":"https://doi.org/10.1109/icra.2019.8794257","title":"A Heuristic for Task Allocation and Routing of Heterogeneous Robots while Minimizing Maximum Travel Cost","display_name":"A Heuristic for Task Allocation and Routing of Heterogeneous Robots while Minimizing Maximum Travel Cost","publication_year":2019,"publication_date":"2019-05-01","ids":{"openalex":"https://openalex.org/W2967877442","doi":"https://doi.org/10.1109/icra.2019.8794257","mag":"2967877442"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2019.8794257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2019.8794257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-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/A5044815306","display_name":"Jungyun Bae","orcid":"https://orcid.org/0000-0002-4673-2464"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jungyun Bae","raw_affiliation_strings":["Department of Mechanical Engineering, Korea University, Seoul, Republic of Korea","Department of Mechanical Engineering, Korea University,Seoul,Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Korea University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":"Department of Mechanical Engineering, Korea University,Seoul,Republic of Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100745067","display_name":"Jung-Ho Lee","orcid":"https://orcid.org/0000-0002-0672-5817"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jungho Lee","raw_affiliation_strings":["Department of Mechanical Engineering, Korea University, Seoul, Republic of Korea","Department of Mechanical Engineering, Korea University,Seoul,Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Korea University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":"Department of Mechanical Engineering, Korea University,Seoul,Republic of Korea","institution_ids":["https://openalex.org/I197347611"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5084269901","display_name":"Woojin Chung","orcid":"https://orcid.org/0000-0002-5322-6615"},"institutions":[{"id":"https://openalex.org/I197347611","display_name":"Korea University","ror":"https://ror.org/047dqcg40","country_code":"KR","type":"education","lineage":["https://openalex.org/I197347611"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Woojin Chung","raw_affiliation_strings":["Department of Mechanical Engineering, Korea University, Seoul, Republic of Korea","Department of Mechanical Engineering, Korea University,Seoul,Republic of Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mechanical Engineering, Korea University, Seoul, Republic of Korea","institution_ids":["https://openalex.org/I197347611"]},{"raw_affiliation_string":"Department of Mechanical Engineering, Korea University,Seoul,Republic of Korea","institution_ids":["https://openalex.org/I197347611"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4068,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.65383344,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":98},"biblio":{"volume":"191","issue":null,"first_page":"4531","last_page":"4537"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9998999834060669,"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"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/robot","display_name":"Robot","score":0.7522198557853699},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.7092376947402954},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6945199966430664},{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.684325635433197},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6632958650588989},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.644683301448822},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6219912767410278},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5606527328491211},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.5237013101577759},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.5136553645133972},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4945532977581024},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.4270693063735962},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24915078282356262},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.21287178993225098},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.14897531270980835},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.108782559633255}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7522198557853699},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7092376947402954},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6945199966430664},{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.684325635433197},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6632958650588989},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.644683301448822},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6219912767410278},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5606527328491211},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5237013101577759},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.5136553645133972},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4945532977581024},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.4270693063735962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24915078282356262},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.21287178993225098},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.14897531270980835},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.108782559633255},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2019.8794257","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2019.8794257","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.550000011920929,"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W91272057","https://openalex.org/W1919410445","https://openalex.org/W1968395937","https://openalex.org/W1970367338","https://openalex.org/W1971998222","https://openalex.org/W2007016814","https://openalex.org/W2017708378","https://openalex.org/W2041970949","https://openalex.org/W2070585337","https://openalex.org/W2078619461","https://openalex.org/W2095906270","https://openalex.org/W2138967774","https://openalex.org/W2143814744","https://openalex.org/W2171971243","https://openalex.org/W2192176441","https://openalex.org/W2219548420","https://openalex.org/W2262276395","https://openalex.org/W2409846154","https://openalex.org/W2563457599","https://openalex.org/W2566233299","https://openalex.org/W2622819000","https://openalex.org/W2902065475","https://openalex.org/W2962771877","https://openalex.org/W4302578348","https://openalex.org/W6603684918","https://openalex.org/W6652239298","https://openalex.org/W6680768685"],"related_works":["https://openalex.org/W4297427155","https://openalex.org/W3136451934","https://openalex.org/W3025823153","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269","https://openalex.org/W2017649536","https://openalex.org/W1990067406","https://openalex.org/W2135709899","https://openalex.org/W2006096198"],"abstract_inverted_index":{"The":[0,40],"article":[1],"proposes":[2],"a":[3,17,34,45,51,130,134,140,164,171],"new":[4],"heuristic":[5,131],"for":[6,47,77,139],"task":[7,148],"allocation":[8],"and":[9,33],"routing":[10],"of":[11,36,66,118,124,154,167],"heterogeneous":[12,26],"robots.":[13],"Specifically,":[14],"we":[15,128,157],"consider":[16],"path":[18],"planning":[19],"problem":[20],"where":[21],"there":[22,106],"are":[23,107],"two":[24,143],"(structurally)":[25],"robots":[27,68,144],"that":[28,53,112,137,159],"start":[29],"from":[30],"distinctive":[31],"depots":[32],"set":[35],"targets":[37],"to":[38,43,58],"visit.":[39],"objective":[41,87],"is":[42,88],"find":[44],"tour":[46],"each":[48,55],"robot":[49],"in":[50,89,115],"manner":[52],"enables":[54],"target":[56],"location":[57],"be":[59],"visited":[60],"at":[61],"least":[62],"once":[63],"by":[64],"one":[65],"the":[67,71,101,155,160],"while":[69,145],"minimizing":[70],"maximum":[72],"travel":[73],"cost.":[74],"A":[75],"solution":[76,169],"Multiple":[78],"Depot":[79],"Heterogeneous":[80],"Traveling":[81],"Salesman":[82],"Problem":[83],"(MDHTSP)":[84],"with":[85,92],"min-max":[86,126],"great":[90],"demand":[91],"many":[93],"potential":[94],"applications,":[95],"because":[96],"it":[97],"can":[98,113],"significantly":[99],"reduce":[100],"job":[102],"completion":[103],"duration.":[104],"However,":[105],"still":[108],"no":[109],"reliable":[110],"algorithms":[111],"run":[114],"short":[116,173],"amount":[117],"time.":[119,175],"As":[120],"an":[121],"initial":[122],"idea":[123],"solving":[125],"MDHTSP,":[127],"present":[129],"based":[132],"on":[133,147,151],"primal-dual":[135],"technique":[136],"solves":[138],"case":[141],"involving":[142],"focusing":[146],"allocation.":[149],"Based":[150],"computational":[152],"results":[153],"implementation,":[156],"show":[158],"proposed":[161],"algorithm":[162],"produces":[163],"good":[165],"quality":[166],"feasible":[168],"within":[170],"relatively":[172],"computation":[174]},"counts_by_year":[{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}