{"id":"https://openalex.org/W2148587452","doi":"https://doi.org/10.1109/icra.2012.6224704","title":"Tunable routing solutions for multi-robot navigation via the assignment problem: A 3D representation of the matching graph","display_name":"Tunable routing solutions for multi-robot navigation via the assignment problem: A 3D representation of the matching graph","publication_year":2012,"publication_date":"2012-05-01","ids":{"openalex":"https://openalex.org/W2148587452","doi":"https://doi.org/10.1109/icra.2012.6224704","mag":"2148587452"},"language":"en","primary_location":{"id":"doi:10.1109/icra.2012.6224704","doi":"https://doi.org/10.1109/icra.2012.6224704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224704","pdf_url":null,"source":{"id":"https://openalex.org/S4210217939","display_name":"Proceedings - IEEE International Conference on Robotics and Automation/Proceedings","issn_l":"1050-4729","issn":["1050-4729","2577-087X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2148587452"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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","observed_orcids":["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":false,"raw_author_name":"Lantao Liu","raw_affiliation_strings":["Department of Computer Science and Engineering, Texas A&M University"],"raw_orcid":null,"affiliations":[{"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":"https://orcid.org/0000-0002-9310-7231","observed_orcids":["https://orcid.org/0000-0002-9310-7231","https://orcid.org/0000-0001-5850-5376"]},"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 and Engineering, Texas A&M University"],"raw_orcid":null,"affiliations":[{"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":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":1.7599,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":{"value":0.80197355,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":87,"max":95},"biblio":{"volume":"4","issue":null,"first_page":"4800","last_page":"4805"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9639000296592712,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9639000296592712,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.020999999716877937,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.002300000051036477,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/multi-robot-navigation","display_name":"multi-robot navigation","score":0.9580000042915344},{"id":"https://openalex.org/keywords/assignment-problem","display_name":"assignment problem","score":0.7390000224113464},{"id":"https://openalex.org/keywords/hungarian-algorithm","display_name":"Hungarian algorithm","score":0.8379999995231628},{"id":"https://openalex.org/keywords/graph-matching","display_name":"graph matching","score":0.8999999761581421},{"id":"https://openalex.org/keywords/robot-routing","display_name":"robot routing","score":0.5770000219345093},{"id":"https://openalex.org/keywords/task-allocation","display_name":"task allocation","score":0.9049999713897705},{"id":"https://openalex.org/keywords/incremental-optimization","display_name":"incremental optimization","score":0.5870000123977661}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8181319236755371},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7505561113357544},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7004403471946716},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6953384280204773},{"id":"https://openalex.org/C85044808","wikidata":"https://www.wikidata.org/wiki/Q620614","display_name":"Assignment problem","level":2,"score":0.6052322387695312},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5775944590568542},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5717446208000183},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.520470142364502},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5154098272323608},{"id":"https://openalex.org/C21785340","wikidata":"https://www.wikidata.org/wiki/Q281922","display_name":"Hungarian algorithm","level":3,"score":0.463931143283844},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4493471086025238},{"id":"https://openalex.org/C123784306","wikidata":"https://www.wikidata.org/wiki/Q944041","display_name":"Vehicle routing problem","level":3,"score":0.4140075743198395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31000590324401855},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.29353755712509155},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2731919288635254},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.14698845148086548},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13074252009391785},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09403973817825317},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","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":3,"locations":[{"id":"doi:10.1109/icra.2012.6224704","doi":"https://doi.org/10.1109/icra.2012.6224704","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icra.2012.6224704","pdf_url":null,"source":{"id":"https://openalex.org/S4210217939","display_name":"Proceedings - IEEE International Conference on Robotics and Automation/Proceedings","issn_l":"1050-4729","issn":["1050-4729","2577-087X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE International Conference on Robotics and Automation","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.719.6909","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.719.6909","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://robotics.usc.edu/%7Elantao/publications/manu_ijrr_routing.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.725.6083","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.725.6083","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://robotics.usc.edu/%7Elantao/publications/icra12-morphing.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W99591646","https://openalex.org/W152613852","https://openalex.org/W1973876344","https://openalex.org/W2017332349","https://openalex.org/W2039533720","https://openalex.org/W2053913299","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/W2119120935","https://openalex.org/W2119312244","https://openalex.org/W2125708920","https://openalex.org/W2129853306","https://openalex.org/W2132543913","https://openalex.org/W2141461755","https://openalex.org/W2146951311","https://openalex.org/W2157488300","https://openalex.org/W2162729570","https://openalex.org/W2162749019","https://openalex.org/W2222512263","https://openalex.org/W2467020497","https://openalex.org/W3142658448","https://openalex.org/W3158940377","https://openalex.org/W4232113674","https://openalex.org/W6679811478"],"related_works":["https://openalex.org/W2021431021","https://openalex.org/W7100145174","https://openalex.org/W148261690","https://openalex.org/W2295927337","https://openalex.org/W2295971704","https://openalex.org/W2276505282","https://openalex.org/W3023013592","https://openalex.org/W7017753269","https://openalex.org/W2156063776","https://openalex.org/W2618479943"],"abstract_inverted_index":{"In":[0],"scenarios":[1],"in":[2,21,86,117,136,149,153,161,168],"which":[3,87],"new":[4,140],"robots":[5,93],"and":[6,29,46,76,170],"tasks":[7,28],"are":[8,80,94,143,159],"added":[9,95],"to":[10,25,34,51,65,96,111],"a":[11,18,40,48,83],"network":[12],"of":[13,32,43,73,90,106,130],"already":[14],"deployed,":[15],"interchangeable":[16],"robots,":[17],"trade-off":[19],"arises":[20],"minimizing":[22,57,66],"the":[23,27,30,35,53,70,88,102,107,113,131,145],"cost":[24],"execute":[26],"level":[31],"disruption":[33],"system.":[36],"This":[37],"paper":[38],"considers":[39],"navigation-oriented":[41],"variant":[42,105],"this":[44],"problem":[45,116],"proposes":[47],"parametrizable":[49],"method":[50],"adjust":[52],"optimization":[54],"criterion:":[55],"from":[56],"global":[58],"travel":[59],"time":[60,155],"(or":[61],"energy,":[62],"or":[63],"distance),":[64],"interruption":[67],"(i.e.,":[68],"obtaining":[69],"fewest":[71],"number":[72],"robot":[74],"reassignments),":[75],"mixtures":[77],"in-between.":[78],"Paths":[79],"computed":[81],"by":[82,123],"task-allocation":[84],"formulation":[85],"destinations":[89],"newly":[91],"deployed":[92],"an":[97,128,150],"existing":[98],"allocation.":[99],"We":[100],"adapt":[101],"graph":[103,135],"matching":[104],"Hungarian":[108,133],"algorithm-originally":[109],"designed":[110],"solve":[112],"optimal":[114],"assignment":[115,146],"complete":[118],"graphs-to":[119],"construct":[120],"routing":[121],"paths":[122],"showing":[124],"that":[125],"there":[126],"is":[127,147,165],"interpretation":[129],"sparse":[132],"bipartite":[134],"three":[137],"dimensions.":[138],"When":[139],"agent-task":[141],"pairs":[142],"inserted,":[144],"reallocated":[148],"incremental":[151],"fashion":[152],"linear":[154],"(assuming":[156],"traversal":[157],"choices":[158],"limited":[160],"number).":[162],"The":[163],"algorithm":[164],"studied":[166],"systematically":[167],"simulation":[169],"also":[171],"validated":[172],"with":[173],"physical":[174],"robots.":[175]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":2}],"updated_date":"2026-10-16T09:59:22.235173","created_date":"2016-06-24T00:00:00"}