{"id":"https://openalex.org/W2891489679","doi":"https://doi.org/10.1109/icra.2018.8460886","title":"A Scalable Multi-Robot Task Allocation Algorithm","display_name":"A Scalable Multi-Robot Task Allocation Algorithm","publication_year":2018,"publication_date":"2018-05-01","ids":{"openalex":"https://openalex.org/W2891489679","doi":"https://doi.org/10.1109/icra.2018.8460886","mag":"2891489679"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2018.8460886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5045560127","display_name":"Chayan Sarkar","orcid":"https://orcid.org/0000-0003-4777-2086"},"institutions":[{"id":"https://openalex.org/I55215948","display_name":"Tata Consultancy Services (India)","ror":"https://ror.org/01b9n8m42","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210086519","https://openalex.org/I55215948"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Chayan Sarkar","raw_affiliation_strings":["TCS Research & Innovation, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TCS Research & Innovation, Kolkata, India","institution_ids":["https://openalex.org/I55215948"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5106236637","display_name":"Himadri Sekhar Paul","orcid":"https://orcid.org/0000-0002-6782-6777"},"institutions":[{"id":"https://openalex.org/I55215948","display_name":"Tata Consultancy Services (India)","ror":"https://ror.org/01b9n8m42","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210086519","https://openalex.org/I55215948"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Himadri Sekhar Paul","raw_affiliation_strings":["TCS Research & Innovation, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TCS Research & Innovation, Kolkata, India","institution_ids":["https://openalex.org/I55215948"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5044617871","display_name":"Arindam Pal","orcid":"https://orcid.org/0000-0001-5710-7464"},"institutions":[{"id":"https://openalex.org/I55215948","display_name":"Tata Consultancy Services (India)","ror":"https://ror.org/01b9n8m42","country_code":"IN","type":"company","lineage":["https://openalex.org/I4210086519","https://openalex.org/I55215948"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Arindam Pal","raw_affiliation_strings":["TCS Research & Innovation, Kolkata, India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"TCS Research & Innovation, Kolkata, India","institution_ids":["https://openalex.org/I55215948"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I55215948"],"apc_list":null,"apc_paid":null,"fwci":9.1499,"has_fulltext":false,"cited_by_count":60,"citation_normalized_percentile":{"value":0.98750797,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"5022","last_page":"5027"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9994999766349792,"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.9976000189781189,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.996999979019165,"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/heuristics","display_name":"Heuristics","score":0.8534094095230103},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.8055025339126587},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7288681268692017},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.6916029453277588},{"id":"https://openalex.org/keywords/vehicle-routing-problem","display_name":"Vehicle routing problem","score":0.6241812109947205},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.6066151857376099},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.5795732736587524},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5722501277923584},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.5056447982788086},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.480618417263031},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4453335404396057},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35110747814178467},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3380374312400818},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.283821702003479},{"id":"https://openalex.org/keywords/database","display_name":"Database","score":0.1228523850440979},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08504247665405273},{"id":"https://openalex.org/keywords/embedded-system","display_name":"Embedded system","score":0.07574766874313354},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.07443574070930481}],"concepts":[{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.8534094095230103},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.8055025339126587},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7288681268692017},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.6916029453277588},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.6241812109947205},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.6066151857376099},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.5795732736587524},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5722501277923584},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.5056447982788086},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.480618417263031},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4453335404396057},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35110747814178467},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3380374312400818},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.283821702003479},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.1228523850440979},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08504247665405273},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.07574766874313354},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.07443574070930481},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icra.2018.8460886","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2018.8460886","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 IEEE International Conference on Robotics and Automation (ICRA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.4300000071525574}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":34,"referenced_works":["https://openalex.org/W131069610","https://openalex.org/W1501435780","https://openalex.org/W1510238170","https://openalex.org/W1539282749","https://openalex.org/W1588299616","https://openalex.org/W1596429033","https://openalex.org/W1636918467","https://openalex.org/W2017070898","https://openalex.org/W2018691209","https://openalex.org/W2028630422","https://openalex.org/W2049791651","https://openalex.org/W2059715080","https://openalex.org/W2068840184","https://openalex.org/W2082153300","https://openalex.org/W2095757353","https://openalex.org/W2096416100","https://openalex.org/W2096796578","https://openalex.org/W2107918847","https://openalex.org/W2111563176","https://openalex.org/W2113257089","https://openalex.org/W2117226423","https://openalex.org/W2146870367","https://openalex.org/W2148026779","https://openalex.org/W2157488300","https://openalex.org/W2158591664","https://openalex.org/W2162844575","https://openalex.org/W2169240708","https://openalex.org/W2251882317","https://openalex.org/W2301433241","https://openalex.org/W2509755532","https://openalex.org/W2561426503","https://openalex.org/W2622090745","https://openalex.org/W2775798521","https://openalex.org/W4252801674"],"related_works":["https://openalex.org/W3119129187","https://openalex.org/W2470251263","https://openalex.org/W2193306078","https://openalex.org/W3177062893","https://openalex.org/W3125143773","https://openalex.org/W2007032764","https://openalex.org/W803550684","https://openalex.org/W2483226803","https://openalex.org/W4352977312","https://openalex.org/W1536056491"],"abstract_inverted_index":{"In":[0,129],"modern":[1],"warehouses,":[2],"robots":[3],"are":[4,162],"being":[5],"deployed":[6],"to":[7,24,99,113,148],"perform":[8],"complex":[9],"tasks":[10,50],"such":[11,38],"as":[12],"fetching":[13],"a":[14,22,25,30,56,59,105,114,134,163,178,192],"set":[15],"of":[16,49,67,74,89,107,127,157,166,180,198,205,211],"objects":[17,76],"from":[18],"various":[19],"locations":[20],"in":[21,182],"warehouse":[23],"docking":[26],"station.":[27],"This":[28,82],"requires":[29],"careful":[31],"task":[32,83,124,185],"allocation":[33,84],"along":[34],"with":[35,122],"route":[36,61],"planning":[37],"that":[39,51,109,210],"the":[40,64,68,71,75,80,90,123,149,158,170,173],"total":[41],"distance":[42],"traveled":[43],"(cost)":[44],"is":[45,86,97,187,207],"minimized.":[46],"The":[47],"number":[48,106,165,197,204],"can":[52],"be":[53,100],"performed":[54],"by":[55],"robot":[57,69],"on":[58,63,79],"single":[60],"depends":[62],"maximum":[65],"capacity":[66],"and":[70,176,203],"combined":[72],"weight":[73],"it":[77],"picks":[78],"route.":[81],"problem":[85],"an":[87],"instance":[88],"Capacity-constrained":[91],"Vehicle":[92],"Routing":[93],"Problem":[94],"(CVRP),":[95],"which":[96,142],"known":[98],"NP-hard.":[101],"Although,":[102],"there":[103,161],"exist":[104],"heuristics":[108],"provide":[110],"near-optimal":[111],"solutions":[112,159],"CVRP":[115],"instance,":[116],"they":[117],"do":[118],"not":[119],"scale":[120],"well":[121],"size":[125,186],"(number":[126],"nodes).":[128],"this":[130],"paper,":[131],"we":[132],"present":[133],"heuristic,":[135],"called":[136],"nearest-neighbor":[137],"based":[138],"Clustering":[139],"And":[140],"Routing$(nCAR)$,":[141],"has":[143],"better":[144],"execution":[145,201],"time":[146,202],"compared":[147],"state-of-the-art":[150],"heuristics.":[151],"Also,":[152],"our":[153],"heuristic":[154],"reduces":[155],"cost":[156],"when":[160,184],"large":[164],"nodes.":[167],"We":[168],"compare":[169],"performance":[171],"of$nCAR$with":[172],"Google":[174],"OR-Tools":[175,190],"found":[177],"speedup":[179],"6":[181],"runtime":[183],"2000.":[188],"Though":[189],"provides":[191],"low-cost":[193],"solution":[194],"for":[195],"small":[196],"tasks,":[199],"it's":[200],"routes":[206],"1.5":[208],"times":[209],"nCAR.":[212]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":8},{"year":2023,"cited_by_count":14},{"year":2022,"cited_by_count":5},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":2}],"updated_date":"2026-08-12T21:12:35.861297","created_date":"2025-10-10T00:00:00"}