{"id":"https://openalex.org/W2808371702","doi":"https://doi.org/10.1109/tro.2018.2830418","title":"Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms","display_name":"Multirobot Reconnection on Graphs: Problem, Complexity, and Algorithms","publication_year":2018,"publication_date":"2018-06-11","ids":{"openalex":"https://openalex.org/W2808371702","doi":"https://doi.org/10.1109/tro.2018.2830418","mag":"2808371702"},"language":"en","primary_location":{"id":"doi:10.1109/tro.2018.2830418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2018.2830418","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"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 Robotics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/11311/1099117","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008552962","display_name":"Jacopo Banfi","orcid":"https://orcid.org/0000-0001-9660-4869"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Jacopo Banfi","raw_affiliation_strings":["Department of Computer Science, University of Milan, Milano, Italy"],"raw_orcid":"https://orcid.org/0000-0001-9660-4869","affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milan, Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090235510","display_name":"Nicola Basilico","orcid":"https://orcid.org/0000-0002-4512-3480"},"institutions":[{"id":"https://openalex.org/I189158943","display_name":"University of Milan","ror":"https://ror.org/00wjc7c48","country_code":"IT","type":"education","lineage":["https://openalex.org/I189158943"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Nicola Basilico","raw_affiliation_strings":["Department of Computer Science, University of Milan, Milano, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Milan, Milano, Italy","institution_ids":["https://openalex.org/I189158943"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028729032","display_name":"Francesco Amigoni","orcid":"https://orcid.org/0000-0001-8146-6213"},"institutions":[{"id":"https://openalex.org/I93860229","display_name":"Politecnico di Milano","ror":"https://ror.org/01nffqt88","country_code":"IT","type":"education","lineage":["https://openalex.org/I93860229"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"Francesco Amigoni","raw_affiliation_strings":["Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milano, Italy"],"raw_orcid":"https://orcid.org/0000-0001-8146-6213","affiliations":[{"raw_affiliation_string":"Dipartimento di Elettronica, Informazione e Bioingegneria, Politecnico di Milano, Milano, Italy","institution_ids":["https://openalex.org/I93860229"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008552962"],"corresponding_institution_ids":["https://openalex.org/I189158943"],"apc_list":null,"apc_paid":null,"fwci":3.3221,"has_fulltext":true,"cited_by_count":23,"citation_normalized_percentile":{"value":0.92791735,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"34","issue":"5","first_page":"1299","last_page":"1314"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T12288","display_name":"Optimization and Search Problems","score":0.9991000294685364,"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/T10249","display_name":"Distributed Control Multi-Agent Systems","score":0.9983999729156494,"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.9962000250816345,"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/heuristic","display_name":"Heuristic","score":0.6338107585906982},{"id":"https://openalex.org/keywords/motion-planning","display_name":"Motion planning","score":0.6170205473899841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6154253482818604},{"id":"https://openalex.org/keywords/robot","display_name":"Robot","score":0.5975103974342346},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4606277048587799},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4349515736103058},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.43252143263816833},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42949387431144714},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4151461124420166},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3458796739578247},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.24273568391799927},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19551938772201538}],"concepts":[{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6338107585906982},{"id":"https://openalex.org/C81074085","wikidata":"https://www.wikidata.org/wiki/Q366872","display_name":"Motion planning","level":3,"score":0.6170205473899841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6154253482818604},{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.5975103974342346},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4606277048587799},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4349515736103058},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.43252143263816833},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42949387431144714},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4151461124420166},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3458796739578247},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.24273568391799927},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19551938772201538},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/tro.2018.2830418","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tro.2018.2830418","pdf_url":null,"source":{"id":"https://openalex.org/S144620930","display_name":"IEEE Transactions on Robotics","issn_l":"1552-3098","issn":["1552-3098","1941-0468"],"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 Robotics","raw_type":"journal-article"},{"id":"pmh:oai:re.public.polimi.it:11311/1099117","is_oa":true,"landing_page_url":"http://hdl.handle.net/11311/1099117","pdf_url":"http://hdl.handle.net/11311/1099117","source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:air.unimi.it:2434/631700","is_oa":true,"landing_page_url":"http://hdl.handle.net/2434/631700","pdf_url":null,"source":{"id":"https://openalex.org/S4306400516","display_name":"Archivio Istituzionale della Ricerca (Universita Degli Studi Di Milano)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I189158943","host_organization_name":"University of Milan","host_organization_lineage":["https://openalex.org/I189158943"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:oai:re.public.polimi.it:11311/1099117","is_oa":true,"landing_page_url":"http://hdl.handle.net/11311/1099117","pdf_url":"http://hdl.handle.net/11311/1099117","source":{"id":"https://openalex.org/S4306400312","display_name":"Virtual Community of Pathological Anatomy (University of Castilla La Mancha)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79189158","host_organization_name":"University of Castilla-La Mancha","host_organization_lineage":["https://openalex.org/I79189158"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[{"score":0.46000000834465027,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2808371702.pdf"},"referenced_works_count":52,"referenced_works":["https://openalex.org/W45679380","https://openalex.org/W201760388","https://openalex.org/W229097380","https://openalex.org/W1412564056","https://openalex.org/W1513963612","https://openalex.org/W1516796808","https://openalex.org/W1899379166","https://openalex.org/W1984505032","https://openalex.org/W2003808711","https://openalex.org/W2006912660","https://openalex.org/W2022337418","https://openalex.org/W2026508670","https://openalex.org/W2066005785","https://openalex.org/W2081805327","https://openalex.org/W2092507038","https://openalex.org/W2110510068","https://openalex.org/W2117448995","https://openalex.org/W2117889403","https://openalex.org/W2120422518","https://openalex.org/W2139992411","https://openalex.org/W2147125977","https://openalex.org/W2154929090","https://openalex.org/W2170102584","https://openalex.org/W2196669139","https://openalex.org/W2270545362","https://openalex.org/W2275488596","https://openalex.org/W2409793499","https://openalex.org/W2467020497","https://openalex.org/W2524009242","https://openalex.org/W2554009248","https://openalex.org/W2738970816","https://openalex.org/W2783236654","https://openalex.org/W2794292089","https://openalex.org/W2808401713","https://openalex.org/W4205585032","https://openalex.org/W4239749705","https://openalex.org/W4245646954","https://openalex.org/W6601821898","https://openalex.org/W6608852248","https://openalex.org/W6628263000","https://openalex.org/W6630784800","https://openalex.org/W6656110636","https://openalex.org/W6676425080","https://openalex.org/W6677801404","https://openalex.org/W6680889583","https://openalex.org/W6681768009","https://openalex.org/W6682750483","https://openalex.org/W6685062384","https://openalex.org/W6713839660","https://openalex.org/W6727470943","https://openalex.org/W6741370238","https://openalex.org/W6747918958"],"related_works":["https://openalex.org/W1764572413","https://openalex.org/W3150915502","https://openalex.org/W2359600231","https://openalex.org/W3216757130","https://openalex.org/W2380019117","https://openalex.org/W2093343611","https://openalex.org/W1987886368","https://openalex.org/W1660309994","https://openalex.org/W2369187583","https://openalex.org/W3154539612"],"abstract_inverted_index":{"In":[0,51],"several":[1],"multirobot":[2,77,125,133],"applications":[3],"in":[4,26,104,129],"which":[5],"communication":[6],"is":[7],"limited,":[8],"the":[9,13,27,56,76,130,132],"mission":[10],"could":[11],"require":[12],"robots":[14],"to":[15,23,32,37,101,114],"iteratively":[16],"take":[17],"coordinated":[18],"joint":[19],"decisions":[20],"on":[21,30,62,88],"how":[22,31],"spread":[24],"out":[25],"environment":[28,65],"and":[29,40,44,84,94,98],"reconnect":[33],"with":[34,137],"each":[35],"other":[36],"share":[38],"data":[39],"compute":[41],"plans.":[42],"Exploration":[43],"surveillance":[45],"are":[46,111],"examples":[47],"of":[48,58,86,92],"these":[49],"applications.":[50],"this":[52],"paper,":[53],"we":[54,80,95,109],"consider":[55],"problem":[57,127],"computing":[59],"robots'":[60],"paths":[61],"a":[63,116,122],"graph-represented":[64],"for":[66,121],"restoring":[67],"connections":[68],"at":[69],"minimum":[70],"traveling":[71],"cost.":[72],"We":[73],"call":[74],"it":[75,103],"reconnection":[78],"problem,":[79],"show":[81],"its":[82],"NP-hardness":[83],"hardness":[85],"approximation":[87],"some":[89],"important":[90],"classes":[91],"graphs,":[93],"provide":[96],"optimal":[97],"heuristic":[99],"algorithms":[100],"solve":[102],"practical":[105],"settings.":[106],"The":[107],"techniques":[108],"propose":[110],"then":[112],"exploited":[113],"derive":[115],"new":[117],"efficient":[118],"planning":[119,126,136],"algorithm":[120],"relevant":[123],"connectivity-constrained":[124],"addressed":[128],"literature,":[131],"informative":[134],"path":[135],"periodic":[138],"connectivity":[139],"problem.":[140]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}