{"id":"https://openalex.org/W2605264528","doi":"https://doi.org/10.1145/3056460","title":"Tight Analysis of a Collisionless Robot Gathering Algorithm","display_name":"Tight Analysis of a Collisionless Robot Gathering Algorithm","publication_year":2017,"publication_date":"2017-03-31","ids":{"openalex":"https://openalex.org/W2605264528","doi":"https://doi.org/10.1145/3056460","mag":"2605264528"},"language":"en","primary_location":{"id":"doi:10.1145/3056460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3056460","pdf_url":null,"source":{"id":"https://openalex.org/S16632050","display_name":"ACM Transactions on Autonomous and Adaptive Systems","issn_l":"1556-4665","issn":["1556-4665","1556-4703"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Autonomous and Adaptive Systems","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/A5002981812","display_name":"Gokarna Sharma","orcid":"https://orcid.org/0000-0002-4930-4609"},"institutions":[{"id":"https://openalex.org/I149910238","display_name":"Kent State University","ror":"https://ror.org/049pfb863","country_code":"US","type":"education","lineage":["https://openalex.org/I149910238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Gokarna Sharma","raw_affiliation_strings":["Kent State University, Kent, OH"],"affiliations":[{"raw_affiliation_string":"Kent State University, Kent, OH","institution_ids":["https://openalex.org/I149910238"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044907189","display_name":"Costas Busch","orcid":"https://orcid.org/0000-0002-4381-4333"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Costas Busch","raw_affiliation_strings":["Louisiana State University, Baton Rouge, LA"],"affiliations":[{"raw_affiliation_string":"Louisiana State University, Baton Rouge, LA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101963514","display_name":"Supratik Mukhopadhyay","orcid":"https://orcid.org/0000-0003-0839-1133"},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Supratik Mukhopadhyay","raw_affiliation_strings":["Louisiana State University, Baton Rouge, LA"],"affiliations":[{"raw_affiliation_string":"Louisiana State University, Baton Rouge, LA","institution_ids":["https://openalex.org/I121820613"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5071018387","display_name":"Charles Malveaux","orcid":null},"institutions":[{"id":"https://openalex.org/I121820613","display_name":"Louisiana State University","ror":"https://ror.org/05ect4e57","country_code":"US","type":"education","lineage":["https://openalex.org/I121820613"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Charles Malveaux","raw_affiliation_strings":["Louisiana State University, Baton Rouge, LA"],"affiliations":[{"raw_affiliation_string":"Louisiana State University, Baton Rouge, LA","institution_ids":["https://openalex.org/I121820613"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5002981812"],"corresponding_institution_ids":["https://openalex.org/I149910238"],"apc_list":null,"apc_paid":null,"fwci":1.2432,"has_fulltext":false,"cited_by_count":12,"citation_normalized_percentile":{"value":0.81797314,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"12","issue":"1","first_page":"1","last_page":"20"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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/T12784","display_name":"Modular Robots and Swarm Intelligence","score":0.9940999746322632,"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"}},{"id":"https://openalex.org/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9927999973297119,"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/robot","display_name":"Robot","score":0.7583639621734619},{"id":"https://openalex.org/keywords/traverse","display_name":"Traverse","score":0.7529016137123108},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.674491822719574},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6710317730903625},{"id":"https://openalex.org/keywords/grid","display_name":"Grid","score":0.6646907925605774},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5423144102096558},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5283604264259338},{"id":"https://openalex.org/keywords/schedule","display_name":"Schedule","score":0.5211268067359924},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.45779353380203247},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.45515722036361694},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.4363382160663605},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.43318045139312744},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24001619219779968},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.2074280083179474}],"concepts":[{"id":"https://openalex.org/C90509273","wikidata":"https://www.wikidata.org/wiki/Q11012","display_name":"Robot","level":2,"score":0.7583639621734619},{"id":"https://openalex.org/C176809094","wikidata":"https://www.wikidata.org/wiki/Q15401496","display_name":"Traverse","level":2,"score":0.7529016137123108},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.674491822719574},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6710317730903625},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"score":0.6646907925605774},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5423144102096558},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5283604264259338},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.5211268067359924},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.45779353380203247},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.45515722036361694},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.4363382160663605},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.43318045139312744},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24001619219779968},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2074280083179474},{"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/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3056460","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3056460","pdf_url":null,"source":{"id":"https://openalex.org/S16632050","display_name":"ACM Transactions on Autonomous and Adaptive Systems","issn_l":"1556-4665","issn":["1556-4665","1556-4703"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Autonomous and Adaptive Systems","raw_type":"journal-article"},{"id":"pmh:oai:repository.lsu.edu:enviro_sciences_pubs-1401","is_oa":false,"landing_page_url":"https://repository.lsu.edu/enviro_sciences_pubs/402","pdf_url":null,"source":{"id":"https://openalex.org/S4210169993","display_name":"Civil War Book Review","issn_l":"1528-6592","issn":["1528-6592"],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310315936","host_organization_name":"Louisiana State University","host_organization_lineage":["https://openalex.org/P4310315936"],"host_organization_lineage_names":["Louisiana State University"],"type":"journal"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Faculty Publications","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W23804730","https://openalex.org/W40064335","https://openalex.org/W119243154","https://openalex.org/W161919772","https://openalex.org/W1480113909","https://openalex.org/W1483270512","https://openalex.org/W1485100503","https://openalex.org/W1518703065","https://openalex.org/W1567376369","https://openalex.org/W1569673105","https://openalex.org/W1588762506","https://openalex.org/W1597541823","https://openalex.org/W1878407411","https://openalex.org/W1968094522","https://openalex.org/W1970322539","https://openalex.org/W2009908058","https://openalex.org/W2024735613","https://openalex.org/W2025085543","https://openalex.org/W2040689398","https://openalex.org/W2041571902","https://openalex.org/W2063318377","https://openalex.org/W2063986067","https://openalex.org/W2066466105","https://openalex.org/W2077415032","https://openalex.org/W2087407707","https://openalex.org/W2097569568","https://openalex.org/W2114943830","https://openalex.org/W2119517221","https://openalex.org/W2127843168","https://openalex.org/W2144182788","https://openalex.org/W2152272732","https://openalex.org/W2158669326","https://openalex.org/W2209227950","https://openalex.org/W2337361160","https://openalex.org/W2507091382","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W2086365412","https://openalex.org/W3132096191"],"abstract_inverted_index":{"We":[0,225],"consider":[1],"the":[2,13,41,78,106,110,118,138,141,147,156,178,183,187,201,216,255,267],"fundamental":[3],"problem":[4,56,111,128,238],"of":[5,9,77,88,109,159,186,233,269,281],"gathering":[6,51,148],"a":[7,18,35,49,93,98,206,277],"set":[8],"n":[10,168,234,262],"robots":[11,42,188,196,235],"in":[12,63,84,97,129,177,209,221,236],"Euclidean":[14],"plane":[15],"that":[16,228],"have":[17],"physical":[19],"extent":[20],"and":[21,86,102,194],"hence":[22],"cannot":[23],"share":[24],"their":[25,124,160,282],"positions":[26,119],"with":[27,57],"other":[28],"robots.":[29],"The":[30],"objective":[31,60],"is":[32,137,175,189],"to":[33,39,117,146,162,191,200,205,258],"determine":[34],"minimum":[36,58],"time":[37,59,223],"schedule":[38],"gather":[40],"as":[43,46],"close":[44],"together":[45],"possible":[47],"around":[48],"predefined":[50],"point":[52],"avoiding":[53],"collisions.":[54],"This":[55,172],"has":[61],"applications":[62],"many":[64],"real-world":[65],"scenarios":[66],"including":[67],"fast":[68],"autonomous":[69],"coverage":[70],"formation.":[71],"Cord-Landwehr":[72,270],"et":[73,271],"al.":[74,272],"(in":[75],"Proceedings":[76],"International":[79],"Conference":[80],"on":[81,120],"Current":[82],"Trends":[83],"Theory":[85],"Practice":[87],"Computer":[89],"Science,":[90],"2011)":[91],"gave":[92],"local":[94,249],"greedy":[95,250],"algorithm":[96,125,161,268],"fully":[99],"synchronous":[100],"setting":[101],"proved":[103],"that,":[104],"for":[105,266],"discrete":[107],"version":[108],"where":[112,135,239],"robots\u2019":[113],"movements":[114],"are":[115,230,245],"restricted":[116],"an":[121],"integral":[122],"grid,":[123],"solves":[126],"this":[127,151,237],"O":[130],"(":[131,167,261],"nR":[132],")":[133],"rounds,":[134],"R":[136,163,242,259],"distance":[139],"from":[140],"farthest":[142],"initial":[143,231],"robot":[144],"position":[145],"point.":[149],"In":[150],"article,":[152],"we":[153,253],"improve":[154,254],"significantly":[155],"round":[157,173],"complexity":[158,174],"+":[164,260],"2":[165],"\u00b7":[166],"-":[169,263],"1)":[170,264],"rounds.":[171],"obtained":[176],"following":[179],"modified":[180],"model:":[181],"(1)":[182],"viewing":[184],"range":[185],"increased":[190],"three":[192],"hops":[193],"(2)":[195],"can":[197,214],"additionally":[198],"move":[199],"diagonally":[202],"opposite":[203],"corner":[204],"grid":[207,219],"cell":[208],"one":[210,222],"step\u2014that":[211],"is,":[212],"they":[213],"traverse":[215],"two":[217],"corresponding":[218],"edges":[220],"step.":[224],"also":[226],"prove":[227],"there":[229],"configurations":[232],"at":[240],"least":[241],"+(n-1)/2":[243],"rounds":[244,265],"needed":[246],"by":[247],"any":[248],"algorithm.":[251,283],"Furthermore,":[252],"lower":[256],"bound":[257],"These":[273],"results":[274],"altogether":[275],"provide":[276],"tight":[278],"runtime":[279],"analysis":[280]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
