{"id":"https://openalex.org/W2021431021","doi":"https://doi.org/10.1177/0278364913498788","title":"Physically routing robots in a multi-robot network: Flexibility through a three-dimensional matching graph","display_name":"Physically routing robots in a multi-robot network: Flexibility through a three-dimensional matching graph","publication_year":2013,"publication_date":"2013-09-18","ids":{"openalex":"https://openalex.org/W2021431021","doi":"https://doi.org/10.1177/0278364913498788","mag":"2021431021"},"language":"en","primary_location":{"id":"doi:10.1177/0278364913498788","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364913498788","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","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/A5101917996","display_name":"Lantao Liu","orcid":"https://orcid.org/0000-0002-6796-6817"},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lantao Liu","raw_affiliation_strings":["Department of Computer Science & Engineering, Texas A&M University","Department of Computer Science and Engineering, Texas A&M University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University,","institution_ids":["https://openalex.org/I91045830"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5035574727","display_name":"Dylan A. Shell","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Dylan A Shell","raw_affiliation_strings":["Department of Computer Science & Engineering, Texas A&M University","Department of Computer Science and Engineering, Texas A&M University,"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, Texas A&M University","institution_ids":["https://openalex.org/I91045830"]},{"raw_affiliation_string":"Department of Computer Science and Engineering, Texas A&M University,","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5101917996"],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":3.394,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.92824054,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"32","issue":"12","first_page":"1475","last_page":"1494"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9994000196456909,"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"}},"topics":[{"id":"https://openalex.org/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9994000196456909,"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.9991999864578247,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2210","display_name":"Mechanical Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.7582216858863831},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6998355388641357},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.661546528339386},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.5354908108711243},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.477450430393219},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4515000879764557},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.43193304538726807},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.429684579372406},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4149740934371948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.378227174282074},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3452221155166626},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3233337700366974},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.19541123509407043},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15136021375656128},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.13740220665931702}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7582216858863831},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6998355388641357},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.661546528339386},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.5354908108711243},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.477450430393219},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4515000879764557},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.43193304538726807},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.429684579372406},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4149740934371948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.378227174282074},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3452221155166626},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3233337700366974},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.19541123509407043},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15136021375656128},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.13740220665931702},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1177/0278364913498788","is_oa":false,"landing_page_url":"https://doi.org/10.1177/0278364913498788","pdf_url":null,"source":{"id":"https://openalex.org/S73484101","display_name":"The International Journal of Robotics Research","issn_l":"0278-3649","issn":["0278-3649","1741-3176"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320017","host_organization_name":"SAGE Publishing","host_organization_lineage":["https://openalex.org/P4310320017"],"host_organization_lineage_names":["SAGE Publishing"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The International Journal of Robotics Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W99591646","https://openalex.org/W152613852","https://openalex.org/W327198202","https://openalex.org/W1495826018","https://openalex.org/W2017332349","https://openalex.org/W2039533720","https://openalex.org/W2057265280","https://openalex.org/W2060932505","https://openalex.org/W2098917597","https://openalex.org/W2100904251","https://openalex.org/W2101337671","https://openalex.org/W2107918847","https://openalex.org/W2108772522","https://openalex.org/W2110178871","https://openalex.org/W2114476723","https://openalex.org/W2119312244","https://openalex.org/W2125690626","https://openalex.org/W2125708920","https://openalex.org/W2129853306","https://openalex.org/W2132543913","https://openalex.org/W2141461755","https://openalex.org/W2146951311","https://openalex.org/W2148587452","https://openalex.org/W2157488300","https://openalex.org/W2162729570","https://openalex.org/W2162749019","https://openalex.org/W2163893120","https://openalex.org/W2222512263","https://openalex.org/W2467020497","https://openalex.org/W2491954325","https://openalex.org/W2613433911","https://openalex.org/W2798588639","https://openalex.org/W3142658448","https://openalex.org/W3142707146","https://openalex.org/W3158940377","https://openalex.org/W4232113674","https://openalex.org/W4239749705","https://openalex.org/W4376551357"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2077383796","https://openalex.org/W2953461625","https://openalex.org/W2080136900","https://openalex.org/W2372768926","https://openalex.org/W2999799752","https://openalex.org/W2567825307","https://openalex.org/W2054458431","https://openalex.org/W2115167491","https://openalex.org/W2139908560"],"abstract_inverted_index":{"Many":[0],"multi-robot":[1],"scenarios":[2],"involve":[3],"navigation":[4],"of":[5,8,43,63,74,111,157,175,208,216],"a":[6,12,19,41,48,71,89,133,150,201],"set":[7],"networked":[9],"robots":[10,35,79,160],"through":[11,83,144],"constrained":[13],"environment":[14],"to":[15,27,40,53,56,65,92,139,165,180],"achieve":[16],"coverage,":[17],"maintain":[18],"predefined":[20,24],"shape,":[21],"sense":[22],"at":[23,230],"locations,":[25],"or":[26,102],"satisfy":[28],"some":[29],"other":[30],"distance-defined":[31],"property.":[32],"When":[33,236],"new":[34,237],"and":[36,60,119,213,273],"tasks":[37,59,164],"are":[38,80,129,147,161,240],"added":[39,162],"network":[42,146],"already":[44],"deployed":[45,159],"interchangeable":[46],"robots,":[47],"trade-off":[49],"arises":[50],"in":[51,77,153,186,193,247,271],"seeking":[52],"minimize":[54],"cost":[55,99],"execute":[57],"the":[58,61,66,108,145,171,176,182,209,217,242,259],"level":[62],"disruption":[64],"system.":[67],"This":[68],"paper":[69],"examines":[70],"navigation-oriented":[72],"variant":[73,174],"this":[75,198],"problem":[76,185],"which":[78,154],"physically":[81],"routed":[82],"an":[84,166,248],"existing":[85,167],"network.":[86],"We":[87,169,196],"propose":[88],"parametrizable":[90],"method":[91],"tune":[93],"emphasis":[94],"between":[95,141],"minimizing":[96,104],"global":[97],"travel":[98,115],"(or":[100],"energy,":[101],"distance),":[103],"interruption":[105],"(i.e.":[106],"obtaining":[107],"fewest":[109],"number":[110],"robot":[112],"reassignments),":[113],"reducing":[114],"distance":[116],"per":[117],"robot,":[118],"completing":[120],"all":[121],"operations":[122],"as":[123,125,163],"soon":[124],"possible.":[126],"Since":[127],"these":[128],"related":[130],"optimization":[131],"criteria,":[132],"single":[134],"parameter":[135],"provides":[136],"sufficient":[137],"flexibility":[138],"balance":[140],"them.":[142],"Paths":[143],"computed":[148],"via":[149],"task-allocation":[151],"formulation":[152],"destination":[155],"locations":[156],"newly":[158],"allocation.":[168],"adapt":[170],"graph":[172,203],"matching":[173],"Hungarian":[177,210],"Algorithm\u2014originally":[178],"designed":[179],"solve":[181],"optimal":[183],"assignment":[184,243],"complete":[187],"bipartite":[188,211],"graphs\u2014to":[189],"construct":[190],"routing":[191],"paths":[192],"sparse":[194],"networks.":[195],"do":[197],"by":[199],"constructing":[200],"three-dimensional":[202],"that":[204,252],"incorporates":[205],"logical":[206],"aspects":[207],"graph,":[212],"spatial":[214],"elements":[215],"Euclidean":[218],"graph.":[219],"The":[220,266],"approach":[221],"has":[222],"several":[223],"useful":[224],"features":[225],"including":[226],"being":[227],"particularly":[228],"effective":[229],"generating":[231],"multiple":[232],"simultaneous,":[233],"non-interfering":[234],"paths.":[235],"agent\u2013task":[238],"pairs":[239],"inserted,":[241],"is":[244,268],"globally":[245],"reallocated":[246],"incremental":[249],"fashion":[250],"so":[251],"it":[253],"requires":[254],"only":[255],"linear":[256],"time":[257],"when":[258],"robots\u2019":[260],"traversal":[261],"options":[262],"have":[263],"bounded":[264],"degree.":[265],"algorithm":[267],"studied":[269],"systematically":[270],"simulation":[272],"also":[274],"validated":[275],"with":[276],"physical":[277],"robots.":[278]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2}],"updated_date":"2026-05-03T06:03:33.228499","created_date":"2025-10-10T00:00:00"}